Connectivity threshold of Bluetooth graphs

DOI10.1002/rsa.20459zbMath1280.05069arXiv1103.0351OpenAlexW2962836177MaRDI QIDQ2874082

Nicolas Fraiman, Nicolas Broutin, Gábor Lugosi, Luc P. Devroye

Publication date: 28 January 2014

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1103.0351

zbMATH Keywords

percolationdiameterconnectivityrandom geometric graphspanning ratio

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

Related Items

Connectivity of soft random geometric graphs, Randomized near-neighbor graphs, giant components and applications in data science

Cites Work

• Unnamed Item
• Compressions and isoperimetric inequalities
• On the connectivity of random m-orientable graphs and digraphs
• The critical probability of bond percolation on the square lattice equals 1/2
• The longest edge of the random minimal spanning tree
• On the existence of Hamiltonian cycles in a class of random graphs
• Surface order large deviations for high-density percolation
• Hamilton cycles in 3-out
• Percolation
• Random Geometric Graphs
• Probability Inequalities for Sums of Bounded Random Variables
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations