Connectivity of inhomogeneous random graphs
From MaRDI portal
Publication:2930053
DOI10.1002/rsa.20490zbMath1305.05111arXiv1210.6259OpenAlexW2112209432WikidataQ105583191 ScholiaQ105583191MaRDI QIDQ2930053
Nicolas Fraiman, Luc P. Devroye
Publication date: 17 November 2014
Published in: Random Structures & Algorithms, Random Structures \& Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.6259
Random graphs (graph-theoretic aspects) (05C80) Connectivity (05C40) Density (toughness, etc.) (05C42)
Related Items (7)
Nonparametric statistics of dynamic networks with distinguishable nodes ⋮ A large-deviations principle for all the components in a sparse inhomogeneous random graph ⋮ Connectivity of Poissonian inhomogeneous random multigraphs ⋮ Generalized random dot product graph ⋮ Evolution of a modified binomial random graph by agglomeration ⋮ Inhomogeneous random graphs, isolated vertices, and Poisson approximation ⋮ Cliques in rank-1 random graphs: the role of inhomogeneity
Cites Work
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Limits of dense graph sequences
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- The longest edge of the random minimal spanning tree
- Percolation on dense graph sequences
- Concentration Inequalities and Martingale Inequalities: A Survey
- Random Plane Networks
- The phase transition in inhomogeneous random graphs
- Probability Inequalities for Sums of Bounded Random Variables
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
This page was built for publication: Connectivity of inhomogeneous random graphs