Limit behaviors of random connected graphs driven by a Poisson process

DOI10.1007/s11232-012-0085-7zbMath1280.05122OpenAlexW1965755520MaRDI QIDQ394844

Yasunari Higuchi, Chun-hua Hu, Zhong Hao Xu

Publication date: 28 January 2014

Published in: Theoretical and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11232-012-0085-7

zbMATH Keywords

large deviationcentral limit theoremdependency graphmoderate deviationrandom connected graph

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Connectivity (05C40)

Related Items (1)

Emergence of the giant component in preferential-attachment growing networks

Cites Work

• A strong law of large numbers for random biased connected graphs
• On normal approximations of distributions in terms of dependency graphs
• Moderate deviations for some point measures in geometric probability
• Sums of functions of nearest neighbor distances, moment bounds, limit theorems and a goodness of fit test
• The minimum spanning tree constant in geometrical probability and under the independent model: A unified approach
• Central limit theorems for \(k\)-nearest neighbour distances
• Weak laws of large numbers in geometric probability
• Moderate deviations of dependent random variables related to CLT
• \(k\)-nearest-neighbor clustering and percolation theory
• On the fraction of random points by specified nearest-neighbour interrelations and degree of attraction
• Random Geometric Graphs
• The infamous upper tail
• Connectivity of random k-nearest-neighbour graphs
• Large deviations for sums of partly dependent random variables
• The spatial general epidemic and locally dependent random graphs
• A proof of the Gamma test
• Continuum Percolation

This page was built for publication: Limit behaviors of random connected graphs driven by a Poisson process