LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Inhomogeneous random graphs, isolated vertices, and Poisson approximation

Photo from wikipedia

Abstract Consider a graph on randomly scattered points in an arbitrary space, with any two points x, y connected with probability ϕ(x, y). Suppose the number of points is large… Click to show full abstract

Abstract Consider a graph on randomly scattered points in an arbitrary space, with any two points x, y connected with probability ϕ(x, y). Suppose the number of points is large but the mean number of isolated points is O(1). We give general criteria for the latter to be approximately Poisson distributed. More generally, we consider the number of vertices of fixed degree, the number of components of fixed order, and the number of edges. We use a general result on Poisson approximation by Stein's method for a set of points selected from a Poisson point process. This method also gives a good Poisson approximation for U-statistics of a Poisson process.

Keywords: random graphs; number; graphs isolated; inhomogeneous random; poisson approximation

Journal Title: Journal of Applied Probability
Year Published: 2018

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.