A strong law of large numbers for random biased connected graphs

DOI10.1007/S11232-012-0106-6zbMATH Open1280.05121OpenAlexW2172218753MaRDI QIDQ395092FDOQ395092

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

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

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)

Cites Work

• Random Geometric Graphs
• The relative neighbourhood graph of a finite planar set
• The jackknife estimate of variance
• Percolation
• The spatial general epidemic and locally dependent random graphs
• Continuum Percolation
• The diameter of a long-range percolation graph
• 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
• On the fraction of random points by specified nearest-neighbour interrelations and degree of attraction
• Asymptotic moments of near–neighbour distance distributions
• A proof of the Gamma test
• On normal approximations of distributions in terms of dependency graphs

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
• Title not available (Why is that?)

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)