\(k\)-nearest-neighbor clustering and percolation theory

DOI10.1007/s00453-007-9040-7zbMath1131.60089OpenAlexW2035452268MaRDI QIDQ2461550

Shang-Hua Teng, Frances F. Yao

Publication date: 28 November 2007

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-007-9040-7

zbMATH Keywords

clusteringpercolationrandom point setnearest neighbor graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43)

Related Items (6)

On nearest-neighbor graphs ⋮ Combinatorial aspects of geometric graphs ⋮ Limit behaviors of random connected graphs driven by a Poisson process ⋮ A strong law of large numbers for random biased connected graphs ⋮ Absence of percolation in graphs based on stationary point processes with degrees bounded by two ⋮ Randomized near-neighbor graphs, giant components and applications in data science

Uses Software

• Mathematica

Cites Work

• Unnamed Item
• Unnamed Item
• On a sharp transition from area law to perimeter law in a system of random surfaces
• On nearest-neighbor graphs
• Bulk transport properties and exponent inequalities for random resistor and flow networks
• On the homogeneous planar Poisson point process
• The loss of tension in an infinite membrane with holes distributed according to a Poisson law
• THE EXPECTED EXTREMES IN A DELAUNAY TRIANGULATION
• Coverage by randomly deployed wireless sensor networks
• A generalization of McDiarmid's theorem for mixed Bernoulli percolation
• Continuum Percolation

This page was built for publication: \(k\)-nearest-neighbor clustering and percolation theory