Cargando…
Diameter in ultra‐small scale‐free random graphs
It is well known that many random graphs with infinite variance degrees are ultra‐small. More precisely, for configuration models and preferential attachment models where the proportion of vertices of degree at least k is approximately k (−(τ − 1)) with τ ∈ (2,3), typical distances between pairs of...
Autores principales: | Caravenna, Francesco, Garavaglia, Alessandro, van der Hofstad, Remco |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
John Wiley & Sons, Inc.
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6446946/ https://www.ncbi.nlm.nih.gov/pubmed/30983844 http://dx.doi.org/10.1002/rsa.20798 |
Ejemplares similares
-
Progress in high-dimensional percolation and random graphs
por: Heydenreich, Markus, et al.
Publicado: (2017) -
Cluster Tails for Critical Power-Law Inhomogeneous Random Graphs
por: van der Hofstad, Remco, et al.
Publicado: (2018) -
Variational principle for scale-free network motifs
por: Stegehuis, Clara, et al.
Publicado: (2019) -
Long Paths in First Passage Percolation on the Complete Graph II. Global Branching Dynamics
por: Eckhoff, Maren, et al.
Publicado: (2020) -
Bounds for the Diameters of Orbital Graphs of Affine Groups
por: Maróti, Attila, et al.
Publicado: (2023)