Coupling Scale-Free and Classical Random Graphs
From MaRDI portal
Publication:4665449
DOI10.1080/15427951.2004.10129084zbMath1061.05084MaRDI QIDQ4665449
Publication date: 11 April 2005
Published in: Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15427951.2004.10129084
05C80: Random graphs (graph-theoretic aspects)
Related Items
The phase transition in inhomogeneous random graphs, A Geometric Preferential Attachment Model of Networks II, On a conditionally Poissonian graph process, On anti-stochastic properties of unlabeled graphs, MATRIX-MFO tandem workshop: Stochastic reinforcement processes and graphs. Abstracts from the MATRIX-MFO tandem workshop held March 5--10, 2023, Degree distributions in recursive trees with fitnesses, Rumor spreading in social networks, Main-memory triangle computations for very large (sparse (power-law)) graphs, Diameters in preferential attachment models, Network navigation with non-Lèvy superdiffusive random walks, Condensation phenomena in preferential attachment trees with neighbourhood influence, Techniques for analyzing dynamic random graph models of web-like networks: An overview, Universality for distances in power-law random graphs