Coupling Scale-Free and Classical Random Graphs
From MaRDI portal
Recommendations
Cited in
(20)- 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
- The phase transition in inhomogeneous random graphs
- Rumor spreading in social networks
- 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
- Relations between scaling exponents in unimodular random graphs
- On the coexistence of competing memes in the same social network
- Degree distributions in recursive trees with fitnesses
- On isomorphism-invariant antistochastic properties of random graphs
- Open problems in stochastic reinforcement models
- Security of scale-free networks
- Stability of the LCD model
- On a 2-parameter class of scale free random graphs
- Main-memory triangle computations for very large (sparse (power-law)) graphs
- Diameters in preferential attachment models
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)