Abstract
We study metric and spectral properties of dense inhomogeneous random graphs. We generalize results known for the Erdös–Renyi model. In our case an edge (i, j) is present with probability κ(X i , X j )p, where κ ≥ 0 is a fixed kernel and X i are independent variables from a general distribution on a separable metric space.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
L. Addario-Berry, N. Broutin, and C. Goldschmidt, “The continuum limit of critical random graphs”, Probability Theory and Related Fields 152 (3–4) (2012), 367–406.
B. Bollobás, “The diameter of random graphs”, Transactions of the American Mathematical Society 267 (1) (1981), 41–52.
B. Bollobás, S. Janson, and O. Riordan, “The phase transition in inhomogeneous random graphs”, Random Structures & Algorithms 31 (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”, Advances in Mathematics 219 (6) (2008), 1801–1851.
C. Borgs, J.T. Chayes, L. Lovász, V.T. Sós, and K. Vesztergombi, “Convergent sequences of dense graphs II: multiway cuts and statistical physics”, Annals of Mathematics 176 (2012), 151–219.
F. Chung and L. Lu, “The diameter of sparse random graphs”, Advances in Applied Mathematics 26 (2001), 257–279.
L. Devroye and N. Fraiman, “Connectivity threshold of inhomogeneous random graphs”, Random Structures & Algorithms 45 (3) (2014), 408–420.
Z. Füredi and J. Komlós, “The eigenvalues of random symmetric matrices”, Combinatorica 1 (3) (1981), 233–241.
V. Klee and D. Larman, “Diameters of random graphs”, Canadian Journal of Mathematics 33 (1981), 618–640.
L. Lovász, “Large networks and graph limits”, American Mathematical Society, 2012.
L. Lovász and B. Szegedy, “Limits of dense graph sequences”, Journal of Combinatorial Theory, Series B 96 (6) (2006), 933–957.
V. Marchenko and L. Pastur, “Distribution of eigenvalues for some sets of random matrices”, Math. USSR Sb. 1 (4) (1967), 457–483.
A. Nachmias and Y. Peres, “Critical random graphs: diameter and mixing time”, The Annals of Probability 36 (4) (2008), 1267–1286.
O. Riordan and N. Wormald, “The diameter of sparse random graphs”, Combinatorics, Probability & Computing 19 (5–6) (2010), 835–926.
B. Söderberg, “General formalism for inhomogeneous random graphs”, Physical review E 66 (6) (2002), 066121.
E. Wigner, “On the distribution of the roots of certain symmetric matrices”, Annals of Mathemathics 67 (1958), 325–328.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Fraiman, N., Mitsche, D. (2017). Metric and Spectral Properties of Dense Inhomogeneous Random Graphs. In: Díaz, J., Kirousis, L., Ortiz-Gracia, L., Serna, M. (eds) Extended Abstracts Summer 2015. Trends in Mathematics(), vol 6. Birkhäuser, Cham. https://doi.org/10.1007/978-3-319-51753-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-51753-7_7
Published:
Publisher Name: Birkhäuser, Cham
Print ISBN: 978-3-319-51752-0
Online ISBN: 978-3-319-51753-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)