Inhomogeneous random graphs, isolated vertices, and Poisson approximation

Research output: Contribution to journalArticlepeer-review

10 Citations (SciVal)
69 Downloads (Pure)


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.

Original languageEnglish
Pages (from-to)112-136
Number of pages25
JournalJournal of Applied Probability
Issue number1
Publication statusPublished - 1 Mar 2018


  • Inhomogeneous random graph
  • Poisson approximation
  • Stein's method
  • U-statistic
  • latent variable model
  • random connection model
  • random geometric graph
  • stochastic block model

ASJC Scopus subject areas

  • Statistics and Probability
  • Mathematics(all)
  • Statistics, Probability and Uncertainty


Dive into the research topics of 'Inhomogeneous random graphs, isolated vertices, and Poisson approximation'. Together they form a unique fingerprint.

Cite this