Inhomogeneous random graphs, isolated vertices, and Poisson approximation

DOI10.1017/jpr.2018.9zbMath1396.05102arXiv1507.07132OpenAlexW2963824031WikidataQ130056809 ScholiaQ130056809MaRDI QIDQ4684930

Mathew D. Penrose

Publication date: 26 September 2018

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.07132

zbMATH Keywords

Stein's methodPoisson approximationrandom geometric graphstochastic block modelU-statisticrandom connection modellatent variable modelinhomogeneous random graph

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80)

Related Items

An elementary approach to component sizes in critical random graphs, Poisson process approximation under stabilization and Palm coupling, On the distances within cliques in a soft random geometric graph, Unnamed Item, Thresholds for vanishing of `isolated' faces in random Čech and Vietoris-Rips complexes, The random connection model and functions of edge-marked Poisson processes: second order properties and normal approximation, Isolation and connectivity in random geometric graphs with self-similar intensity measures, Poisson approximation and connectivity in a scale-free random connection model, Phase transitions and percolation at criticality in enhanced random connection models, Poisson approximation with applications to stochastic geometry

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connectivity of soft random geometric graphs
• Nonuniform random geometric graphs with location-dependent radii
• Novel scaling limits for critical inhomogeneous random graphs
• Functional Poisson approximation in Kantorovich-Rubinstein distance with applications to \(U\)-statistics and stochastic geometry
• Estimation and prediction for stochastic blockmodels for graphs with latent block structure
• Extremes on trees
• Connectivity of inhomogeneous random graphs
• Criticality of the exponential rate of decay for the largest nearest-neighbor link in random geometric graphs
• Continuum Percolation
• A simple coupling of renewal processes
• Extremes for the minimal spanning tree on normally distributed points
• Random Geometric Graphs
• Latent Space Approaches to Social Network Analysis
• The phase transition in inhomogeneous random graphs
• Lectures on the Poisson Process
• Random Networks for Communication