A strong law of large numbers for random biased connected graphs

DOI10.1007/S11232-012-0106-6MaRDI QIDQ395092zbMATH OpenOpenAlexFDO

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-0106-6

zbMATH Keywords

law of large numbersrandom biased connected graphrandom connected graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Inequalities; stochastic orderings (60E15) Connectivity (05C40)

Recommendations

• scientific article; zbMATH DE number 5252621
• A central limit theorem of random biased connected graphs
• Explicit laws of large numbers for random nearest-neighbour-type graphs
• Strong law of large numbers on graphs and groups
• An introduction to large deviations for random graphs
• On the strength of connectedness of a random graph
• The large deviation principle for the Erdős-Rényi random graph
• A large deviation principle for the Erdős-Rényi uniform random graph
• Large deviations for empirical measures of generalized random graphs

Cites work

• A proof of the Gamma test
• Asymptotic moments of near–neighbour distance distributions
• Central limit theorems for \(k\)-nearest neighbour distances
• Continuum Percolation
• Graph diameter in long-range percolation
• On normal approximations of distributions in terms of dependency graphs
• On the fraction of random points by specified nearest-neighbour interrelations and degree of attraction
• Percolation
• Random Geometric Graphs
• Sums of functions of nearest neighbor distances, moment bounds, limit theorems and a goodness of fit test
• The diameter of a long-range percolation graph
• The diameter of long-range percolation clusters on finite cycles
• The expected size of the sphere-of-influence graph
• The jackknife estimate of variance
• The relative neighbourhood graph of a finite planar set
• The spatial general epidemic and locally dependent random graphs
• \(k\)-nearest-neighbor clustering and percolation theory

Cited in

(6)

• Explicit laws of large numbers for random nearest-neighbour-type graphs
• Strong law of large numbers on graphs and groups
• Limit behaviors of random connected graphs driven by a Poisson process
• Functional strong law of large numbers for loads in a planar network model
• A central limit theorem of random biased connected graphs
• scientific article; zbMATH DE number 5252621 (Why is no real title available?)

This page was built for publication: A strong law of large numbers for random biased connected graphs

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