Nearest neighbor and hard sphere models in continuum percolation
From MaRDI portal
Publication:4716331
DOI<295::AID-RSA3>3.0.CO;2-S 10.1002/(SICI)1098-2418(199610)9:3<295::AID-RSA3>3.0.CO;2-SzbMath0866.60088OpenAlexW2015859644MaRDI QIDQ4716331
Olle Häggström, Ronald W. J. Meester
Publication date: 19 December 1996
Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199610)9:3<295::aid-rsa3>3.0.co;2-s
Related Items (41)
Optimization of shape in continuum percolation ⋮ A one-dimensional Poisson growth model with non-overlapping intervals. ⋮ Vertex ordering and partitioning problems for random spatial graphs. ⋮ Poisson matching ⋮ Iterated Gilbert mosaics ⋮ A note on the lilypond model ⋮ Alignment percolation ⋮ The random connection model in high dimensions ⋮ Unnamed Item ⋮ Friendly Frogs, Stable Marriage, and the Magic of Invariance ⋮ Limit theorems for geometric functionals of Gibbs point processes ⋮ Absence of percolation for Poisson outdegree-one graphs ⋮ Conformal loop ensembles: the Markovian characterization and the loop-soup construction ⋮ Stationary Apollonian packings ⋮ New 3D geometrical deposition methods for efficient packing of spheres based on tangency ⋮ Absence of percolation in graphs based on stationary point processes with degrees bounded by two ⋮ Random nearest neighbor graphs: the translation invariant case ⋮ A tale of two balloons ⋮ Deterministic walk on Poisson point process ⋮ Covering algorithms, continuum percolation and the geometry of wireless networks ⋮ Geometrical selection in growing needles ⋮ Percolation in the secrecy graph ⋮ Descending chains, the lilypond model, and mutual-nearest-neighbour matching ⋮ Percolation and limit theory for the poisson lilypond model ⋮ Localized techniques for broadcasting in wireless sensor networks ⋮ Percolation in invariant Poisson graphs with i.i.d. degrees ⋮ Random Sets: Models and Statistics ⋮ Continuum percolation with steps in an annulus ⋮ Signal to interference ratio percolation for Cox point processes ⋮ The size of components in continuum nearest-neighbor graphs ⋮ An algorithm to generate random dense arrangements for discrete element simulations of granular assemblies ⋮ Continuum percolation with unreliable and spread-out connections ⋮ Optimal stationary markings ⋮ The disk-percolation model on graphs ⋮ Random spatial growth with paralyzing obstacles ⋮ Improving the 3D Finite-Discrete Element Method and Its Application in the Simulation of Wheel–Sand Interactions ⋮ Recurrence or transience of random walks on random graphs generated by point processes in \(\mathbb{R}^d\) ⋮ The RSW theorem for continuum percolation and the CLT for Euclidean minimal spanning trees ⋮ Continuum percolation and Euclidean minimal spanning trees in high dimensions ⋮ On a Class of Growth-Maximal Hardcore Processes ⋮ Large deviations and Young measures for a Poissonian model of biphased material
This page was built for publication: Nearest neighbor and hard sphere models in continuum percolation
