Skip to main content Accessibility help

On the Spread of Random Graphs



The spread of a connected graph G was introduced by Alon, Boppana and Spencer [1], and measures how tightly connected the graph is. It is defined as the maximum over all Lipschitz functions f on V(G) of the variance of f(X) when X is uniformly distributed on V(G). We investigate the spread for certain models of sparse random graph, in particular for random regular graphs G(n,d), for Erdős–Rényi random graphs Gn,p in the supercritical range p>1/n, and for a ‘small world’ model. For supercritical Gn,p, we show that if p=c/n with c>1 fixed, then with high probability the spread of the giant component is bounded, and we prove corresponding statements for other models of random graphs, including a model with random edge lengths. We also give lower bounds on the spread for the barely supercritical case when p=(1+o(1))/n. Further, we show that for d large, with high probability the spread of G(n,d) becomes arbitrarily close to that of the complete graph $\mathsf{K}_n$ .



Hide All
[1]Alon, N., Boppana, R. and Spencer, J. (1998) An asymptotic isoperimetric inequality. Geom. Funct. Anal. 8 411436.
[2]Benjamini, I., Kozma, G. and Wormald, N. C. (2014) The mixing time of the giant component of a random graph. Random Struct. Alg. doi:10.1002/rsa.20539.
[3]Bobkov, S. G., Houdré, C. and Tetali, P. (2006) The subgaussian constant and concentration inequalities. Israel J. Math. 156 255283.
[4]Bollobás, B. (2001) Random Graphs, second edition, Vol. 73 of Cambridge Studies in Advanced Mathematics, Cambridge University Press.
[5]Ding, J., Kim, J. H., Lubetzky, E. and Peres, Y. (2010) Diameters in supercritical random graphs via first passage percolation. Combin. Probab. Comput. 19 729751.
[6]Dubhashi, D. and Ranjan, D. (1998) Balls and bins: A study in negative dependence. Random Struct. Alg. 13 99124.
[7]Durrett, R. (2010) Random Graph Dynamics, Cambridge University Press.
[8]Janson, S. and Luczak, M. J. (2007) A simple solution to the k-core problem. Random Struct. Alg. 30 5062.
[9]Janson, S., Knuth, D. E., Łuczak, T. and Pittel, B. (1993) The birth of the giant component. Random Struct. Alg. 4 231358.
[10]Janson, S., Łuczak, T. and Rucinski, A. (2000) Random Graphs, Wiley.
[11]Joag-Dev, K. and Proschan, F. (1983) Negative association of random variables, with applications. Ann. Statist. 11 286295.
[12]Kolchin, V. F. (1986) Random Mappings, Translation Series in Mathematics and Engineering, Optimization Software Inc., New York. Translated from the Russian.
[13]Łuczak, T. (1990) Component behavior near the critical point of the random graph process. Random Struct. Alg. 1 287310.
[14]Łuczak, T. (1991) Size and connectivity of the k-core of a random graph. Discrete Math. 91 6168.
[15]Łuczak, T. (1991) Cycles in a random graph near the critical point. Random Struct. Alg. 2 421439.
[16]Newman, M. E. J. and Watts, D. J. (1999) Renormalization group analysis of the small-world network model. Phys. Lett. A 263 341346.
[17]Pavlov, Y. L. (1977) The asymptotic distribution of maximum tree size in a random forest (in Russian). Teor. Verojatnost. i Primenen. 22 523533. English translation in Theoret. Probab. Appl. 22 (1977) 509520.
[18]Pavlov, Y. L. (1996) Random Forests (in Russian), Karelian Centre Russian Academy of Sciences, Petrozavodsk. English translation (2000), VSP, Zeist.
[19]Riordan, O. and Wormald, N. C. (2010) The diameter of sparse random graphs. Combin. Probab. Comput. 19 835926.
[20]Walkup, D. W. (1980) Matchings in random regular bipartite digraphs. Discrete Math. 31 5964.
[21]Watts, D. J. and Strogatz, S. H. (1998) Collective dynamics of ‘small-world’ networks. Nature 393 440442.



Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed