Coupling Scale-Free and Classical Random Graphs
From MaRDI portal
Publication:4665449
DOI10.1080/15427951.2004.10129084zbMATH Open1061.05084OpenAlexW1977585052MaRDI QIDQ4665449FDOQ4665449
Authors: Béla Bollobás, Oliver Riordan 
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
Recommendations
Cited In (19)
- Security of scale-free networks
- On the coexistence of competing memes in the same social network
- Relations between scaling exponents in unimodular random graphs
- On a conditionally Poissonian graph process
- Universality for distances in power-law random graphs
- Rumor spreading in social networks
- On anti-stochastic properties of unlabeled graphs
- Main-memory triangle computations for very large (sparse (power-law)) graphs
- Degree distributions in recursive trees with fitnesses
- Condensation phenomena in preferential attachment trees with neighbourhood influence
- MATRIX-MFO tandem workshop: Stochastic reinforcement processes and graphs. Abstracts from the MATRIX-MFO tandem workshop held March 5--10, 2023
- On a 2-parameter class of scale free random graphs
- Network navigation with non-Lèvy superdiffusive random walks
- Diameters in preferential attachment models
- Techniques for analyzing dynamic random graph models of web-like networks: An overview
- On isomorphism-invariant antistochastic properties of random graphs
- A Geometric Preferential Attachment Model of Networks II
- The phase transition in inhomogeneous random graphs
- Stability of the LCD model
This page was built for publication: Coupling Scale-Free and Classical Random Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4665449)
