Coupling Scale-Free and Classical Random Graphs
From MaRDI portal
Publication:4665449
DOI10.1080/15427951.2004.10129084zbMath1061.05084OpenAlexW1977585052MaRDI 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
Related Items
Condensation phenomena in preferential attachment trees with neighbourhood influence, The phase transition in inhomogeneous random graphs, 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, On the coexistence of competing memes in the same social network, Degree distributions in recursive trees with fitnesses, Techniques for analyzing dynamic random graph models of web-like networks: An overview, A Geometric Preferential Attachment Model of Networks II, Main-memory triangle computations for very large (sparse (power-law)) graphs, Diameters in preferential attachment models, Rumor spreading in social networks, Universality for distances in power-law random graphs, On a conditionally Poissonian graph process, Network navigation with non-Lèvy superdiffusive random walks
