Nearest neighbor and hard sphere models in continuum percolation

From MaRDI portal
Revision as of 20:30, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4716331

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1098-2418(199610)9:3<295::AID-RSA3>3.0.CO;2-S" /><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 percolationA one-dimensional Poisson growth model with non-overlapping intervals.Vertex ordering and partitioning problems for random spatial graphs.Poisson matchingIterated Gilbert mosaicsA note on the lilypond modelAlignment percolationThe random connection model in high dimensionsUnnamed ItemFriendly Frogs, Stable Marriage, and the Magic of InvarianceLimit theorems for geometric functionals of Gibbs point processesAbsence of percolation for Poisson outdegree-one graphsConformal loop ensembles: the Markovian characterization and the loop-soup constructionStationary Apollonian packingsNew 3D geometrical deposition methods for efficient packing of spheres based on tangencyAbsence of percolation in graphs based on stationary point processes with degrees bounded by twoRandom nearest neighbor graphs: the translation invariant caseA tale of two balloonsDeterministic walk on Poisson point processCovering algorithms, continuum percolation and the geometry of wireless networksGeometrical selection in growing needlesPercolation in the secrecy graphDescending chains, the lilypond model, and mutual-nearest-neighbour matchingPercolation and limit theory for the poisson lilypond modelLocalized techniques for broadcasting in wireless sensor networksPercolation in invariant Poisson graphs with i.i.d. degreesRandom Sets: Models and StatisticsContinuum percolation with steps in an annulusSignal to interference ratio percolation for Cox point processesThe size of components in continuum nearest-neighbor graphsAn algorithm to generate random dense arrangements for discrete element simulations of granular assembliesContinuum percolation with unreliable and spread-out connectionsOptimal stationary markingsThe disk-percolation model on graphsRandom spatial growth with paralyzing obstaclesImproving the 3D Finite-Discrete Element Method and Its Application in the Simulation of Wheel–Sand InteractionsRecurrence 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 treesContinuum percolation and Euclidean minimal spanning trees in high dimensionsOn a Class of Growth-Maximal Hardcore ProcessesLarge 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