Connectivity of Poissonian inhomogeneous random multigraphs

Lorenzo Federico


We introduce a model for inhomogeneous random graphs designed to have a lot of flexibility in the assignment of the degree sequence and the individual edge probabilities while remaining tractable. To achieve this we run a Poisson point process over the square [0, 1]2, with an intensity proportional to a kernel W(x, y) and identify every couple of vertices of the graph with a subset of the square, adding an edge between them if there is a point in such subset. This ensures unconditional independence among edges and makes many statements much easier to prove in this setting than in other similar models. Here we prove sharpness of the connectivity threshold under mild integrability conditions on W(x, y).


graphons, connectivity threshold, inhomogeneous random graphs

Full Text:




B. Bollobás, C. Borgs, J. Chayes, and O. Riordan, Percolation on dense graph sequences, Ann. Probab., 38(1):150–183, (2010),

B. Bollobás, S. Janson, and O. Riordan, The phase transition in inhomogeneous random graphs, Random Structures Algorithms 31(1) (2007), 3–122,

C. Borgs, J.T. Chayes, L. Lovász, V.T. Sós, and K. Vesztergombi, Convergent sequences of dense graphs. I. Subgraph frequencies, metric properties and testing, Adv. Math. 219(6) (2008), 1801–1851.

L. Devroye and N. Fraiman, Connectivity of inhomogeneous random graphs, Random Structures Algorithms, 45(3) (2014), 408–420,

P. Erds and A.Rényi, On random graphs. I, Publ. Math. Debrecen 6 (1959), 290–297.

P. Erds and J. Spencer, Evolution of the n-cube, Comput. Math. Appl. 5(1) (1979), 33–39.

V. Falgas-Ravry, J. Larsson, and K. Markström, Speed and concentration of the covering time for structured coupon collectors, arXiv:1601.04455 (2016).

L. Federico and R. van der Hofstad, Critical window for connectivity in the configuration model, Combin. Probab. Comput., 26(5) (2017), 660–680,

J.A. Fill, E.R. Scheinerman, and K.B. Singer-Cohen, Random intersection graphs when m = ω(n): an equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models, Random Structures Algorithms 16(2) (2000), 156–176,<156::AID-RSA3>3.3.CO;2-8.

P.W. Holland, K.B. Laskey, and S. Leinhardt, Stochastic blockmodels: first steps, Social Networks 5(2) (1983), 109–137,

F. Joos, Random subgraphs in sparse graphs, SIAM J. Discrete Math., 29(4) (2015), 2350–2360,

I. Norros and H. Reittu, On a conditionally Poissonian graph process, Adv. in Appl. Probab., 38(1) (2006), 59–75,

C. Radin and L. Sadun, Phase transitions in a complex network, J. Phys. A 46(30) (2013), 305002, 12,

K. Rybarczyk, Diameter, connectivity, and phase transition of the uniform random intersection graph, Discrete Math. 311(17) (2011), 1998–2019,


  • There are currently no refbacks.

ISSN: 2338-2287

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

View EJGTA Stats