Limit behaviors of random connected graphs driven by a Poisson process

DOI10.1007/S11232-012-0085-7zbMATH Open1280.05122OpenAlexW1965755520MaRDI QIDQ394844FDOQ394844

Authors: Y. Higuchi, Zhong Hao Xu, Chunhua Hu 

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

Recommendations

• Poisson convergence and Poisson processes with applications to random graphs
• Connection probabilities in Poisson random graphs with uniformly bounded edges
• Limit density of connected components in a graph process
• Poisson convergence and semi-induced properties of random graphs
• On a conditionally Poissonian graph process
• Connectivity of Poissonian inhomogeneous random multigraphs
• Poisson convergence of numbers of vertices of a given degree in random graphs
• Inhomogeneous random graphs, isolated vertices, and Poisson approximation
• Poisson approximation and connectivity in a scale-free random connection model
• Limit laws in the generalized random graphs with random vertex weights

zbMATH Keywords

central limit theoremlarge deviationmoderate deviationdependency graphrandom connected graph

Mathematics Subject Classification ID

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

Cites Work

• Random Geometric Graphs
• Weak laws of large numbers in geometric probability
• The spatial general epidemic and locally dependent random graphs
• Continuum Percolation
• Moderate deviations of dependent random variables related to CLT
• Large deviations for sums of partly dependent random variables
• The infamous upper tail
• 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
• \(k\)-nearest-neighbor clustering and percolation theory
• On the fraction of random points by specified nearest-neighbour interrelations and degree of attraction
• A strong law of large numbers for random biased connected graphs
• Connectivity of random k-nearest-neighbour graphs
• A proof of the Gamma test
• On normal approximations of distributions in terms of dependency graphs
• Moderate deviations for some point measures in geometric probability

Cited In (5)

• A transport process on graphs and its limiting distributions
• The random connection model and functions of edge-marked Poisson processes: second order properties and normal approximation
• Emergence of the giant component in preferential-attachment growing networks
• Limit theory for the Gilbert graph
• A central limit theorem of random biased connected graphs

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

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