Spectral gap of random hyperbolic graphs and related parameters
From MaRDI portal
Publication:1650095
DOI10.1214/17-AAP1323zbMath1391.60022arXiv1606.02240WikidataQ129994224 ScholiaQ129994224MaRDI QIDQ1650095
Dieter Mitsche, Marcos A. Kiwi
Publication date: 29 June 2018
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.02240
Related Items
Spatial networks and percolation. Abstracts from the workshop held January 17--23, 2021 (hybrid meeting) ⋮ Sub-tree counts on hyperbolic random geometric graphs ⋮ Spectral gap of random hyperbolic graphs and related parameters ⋮ Optimal Cheeger cuts and bisections of random geometric graphs ⋮ Scale-free percolation mixing time ⋮ Law of large numbers for the largest component in a hyperbolic model of complex networks ⋮ The diameter of KPKVB random graphs ⋮ The contact process on random hyperbolic graphs: metastability and critical exponents ⋮ Clustering in a hyperbolic model of complex networks ⋮ On the largest component of subcritical random hyperbolic graphs ⋮ Penalising transmission to hubs in scale-free spatial random graphs ⋮ On the Second Largest Component of Random Hyperbolic Graphs ⋮ Sampling Geometric Inhomogeneous Random Graphs in Linear Time
Cites Work
- Unnamed Item
- Unnamed Item
- Scale-free percolation
- On the largest component of a hyperbolic model of complex networks
- Geometric bounds for eigenvalues of Markov chains
- Spectral gap of random hyperbolic graphs and related parameters
- Geometric inhomogeneous random graphs
- Law of large numbers for the largest component in a hyperbolic model of complex networks
- The probability of connectivity in a hyperbolic model of complex networks
- Clustering and the Hyperbolic Geometry of Complex Networks
- Random Hyperbolic Graphs: Degree Sequence and Clustering
- Typical distances in a geometric model for complex networks
- On the Diameter of Hyperbolic Random Graphs
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Bootstrap percolation on geometric inhomogeneous random graphs