Nearest neighbor and hard sphere models in continuum percolation

DOI10.1002/(SICI)1098-2418(199610)9:3%3C295::AID-RSA3%3E3.0.CO;2-SMaRDI QIDQ4716331zbMATH OpenOpenAlexFDO

Authors Olle Häggström, Ronald Meester

Publication date 19 December 1996

Full work available at URL https://doi.org/10.1002/(sici)1098-2418(199610)9:3%3C295::aid-rsa3%3E3.0.co;2-s

zbMATH Keywords

Poisson processpercolationpercolation in the limiting configuration

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Recommendations

• Continuity and convergence of the percolation function in continuum percolation
• On continuum percolation
• On a continuum percolation model
• A percolating hard sphere model
• \(k\)-nearest-neighbor clustering and percolation theory

Cited in

(46)

• A method for the generation of 3D representative models of granular based materials
• Percolation in invariant Poisson graphs with i.i.d. degrees
• scientific article; zbMATH DE number 1369838 (Why is no real title available?)
• An algorithm to generate random dense arrangements for discrete element simulations of granular assemblies
• Localized techniques for broadcasting in wireless sensor networks
• A one-dimensional Poisson growth model with non-overlapping intervals.
• Improving the 3D finite-discrete element method and its application in the simulation of wheel-sand interactions
• Vertex ordering and partitioning problems for random spatial graphs.
• Percolation and limit theory for the poisson lilypond model
• A note on the lilypond model
• Descending chains, the lilypond model, and mutual-nearest-neighbour matching
• Poisson matching
• Geometrical selection in growing needles
• Recurrence or transience of random walks on random graphs generated by point processes in \(\mathbb{R}^d\)
• Random spatial growth with paralyzing obstacles
• Conformal loop ensembles: the Markovian characterization and the loop-soup construction
• The size of components in continuum nearest-neighbor graphs
• Absence of percolation for Poisson outdegree-one graphs
• Alignment percolation
• Optimal stationary markings
• Iterated Gilbert mosaics
• Continuum percolation and Euclidean minimal spanning trees in high dimensions
• New 3D geometrical deposition methods for efficient packing of spheres based on tangency
• Covering algorithms, continuum percolation and the geometry of wireless networks
• Rectangular Gilbert tessellation
• The disk-percolation model on graphs
• Random Sets: Models and Statistics
• Limit theorems for geometric functionals of Gibbs point processes
• Stationary Apollonian packings
• Absence of percolation in graphs based on stationary point processes with degrees bounded by two
• Signal to interference ratio percolation for Cox point processes
• Percolation in the vacant set of Poisson cylinders
• On a class of growth-maximal hardcore processes
• Percolation in lattice k-neighbor graphs
• A percolating hard sphere model
• Percolation in the secrecy graph
• The random connection model in high dimensions
• A tale of two balloons
• Friendly frogs, stable marriage, and the magic of invariance
• The RSW theorem for continuum percolation and the CLT for Euclidean minimal spanning trees
• Deterministic walk on Poisson point process
• Continuum percolation with steps in an annulus
• Continuum percolation with unreliable and spread-out connections
• Optimization of shape in continuum percolation
• Large deviations and Young measures for a Poissonian model of biphased material
• Random nearest neighbor graphs: the translation invariant case

This page was built for publication: Nearest neighbor and hard sphere models in continuum percolation

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