Coupling Scale-Free and Classical Random Graphs

DOI10.1080/15427951.2004.10129084MaRDI QIDQ4665449zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

random graphcouplingscale-free graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Security of scale-free networks
• The diameter of a scale-free random graph
• A new class of scale free random graphs
• Stability of the LCD model
• The degree sequence of a scale-free random graph process

Cited in

(19)

• MATRIX-MFO tandem workshop: Stochastic reinforcement processes and graphs. Abstracts from the MATRIX-MFO tandem workshop held March 5--10, 2023
• Stability of the LCD model
• Relations between scaling exponents in unimodular random graphs
• The phase transition in inhomogeneous random graphs
• On isomorphism-invariant antistochastic properties of random graphs
• Universality for distances in power-law random graphs
• Network navigation with non-Lèvy superdiffusive random walks
• Rumor spreading in social networks
• Diameters in preferential attachment models
• Techniques for analyzing dynamic random graph models of web-like networks: An overview
• On a conditionally Poissonian graph process
• Security of scale-free networks
• On anti-stochastic properties of unlabeled graphs
• A Geometric Preferential Attachment Model of Networks II
• On the coexistence of competing memes in the same social network
• On a 2-parameter class of scale free random graphs
• Degree distributions in recursive trees with fitnesses
• Condensation phenomena in preferential attachment trees with neighbourhood influence
• Main-memory triangle computations for very large (sparse (power-law)) graphs

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)