A strong law of large numbers for random biased connected graphs
From MaRDI portal
Publication:395092
DOI10.1007/s11232-012-0106-6zbMath1280.05121MaRDI QIDQ395092
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-0106-6
60E15: Inequalities; stochastic orderings
05C80: Random graphs (graph-theoretic aspects)
05C40: Connectivity
Related Items
Cites Work
- On normal approximations of distributions in terms of dependency graphs
- The relative neighbourhood graph of a finite planar set
- The jackknife estimate of variance
- Sums of functions of nearest neighbor distances, moment bounds, limit theorems and a goodness of fit test
- Central limit theorems for \(k\)-nearest neighbour distances
- The expected size of the sphere-of-influence graph
- \(k\)-nearest-neighbor clustering and percolation theory
- The diameter of long-range percolation clusters on finite cycles
- Graph diameter in long-range percolation
- The diameter of a long-range percolation graph
- On the fraction of random points by specified nearest-neighbour interrelations and degree of attraction
- Percolation
- Random Geometric Graphs
- Asymptotic moments of near–neighbour distance distributions
- The spatial general epidemic and locally dependent random graphs
- A proof of the Gamma test
- Continuum Percolation