Graph connectivity with fixed endpoints in the random-connection model

DOI10.1017/S0269964824000160MaRDI QIDQ6852337zbMATH OpenFDO

Authors Qingwei Liu, Nicolas Privault

Publication date 26 February 2026

Published in Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1017/S0269964824000160

zbMATH Keywords

central limit theoremconnectivitycumulant methodKolmogorov distancenormal approximationnumerical methodsPoisson point processrandom graphsrandom-connection model

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Central limit and other weak theorems (60F05) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Probabilistic models, generic numerical methods in probability and statistics (65C20)

Cites work

• Applications of Faa Di Bruno's Formula in Mathematical Statistics
• Connectivity of soft random geometric graphs over annuli
• Estimation and prediction for stochastic blockmodels for graphs with latent block structure
• Gaussian polytopes: a cumulant-based approach
• scientific article; zbMATH DE number 51763 (Why is no real title available?)
• scientific article; zbMATH DE number 3629949 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 194996 (Why is no real title available?)
• scientific article; zbMATH DE number 3103824 (Why is no real title available?)
• Limit theory for isolated and extreme points in hyperbolic random geometric graphs
• Lévy Systems and Moment Formulas for Mixed Poisson Integrals
• Moments of k-hop counts in the random-connection model
• Moments of Poisson stochastic integrals with random integrands
• Normal approximation of subgraph counts in the random-connection model
• Normal convergence by higher semi-invariants with applications to sums of dependent random variables and random graphs
• On connected diagrams and cumulants of Erdős-Rényi matrix models
• Random connection models in the thermodynamic regime: central limit theorems for add-one cost stabilizing functionals
• Random graphs.
• The method of cumulants for the normal approximation
• The random connection model and functions of edge-marked Poisson processes: second order properties and normal approximation
• Wiener chaos: Moments, cumulants and diagrams. A survey with computer implementation

Cited in

(1)

• Normal to Poisson phase transition for subgraph counting in the random-connection model

This page was built for publication: Graph connectivity with fixed endpoints in the random-connection model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6852337)