Nearest neighbor and hard sphere models in continuum percolation
From MaRDI portal
Publication:4716331
DOI10.1002/(SICI)1098-2418(199610)9:3%3C295::AID-RSA3%3E3.0.CO;2-SzbMATH Open0866.60088OpenAlexW2015859644MaRDI QIDQ4716331FDOQ4716331
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
Cited In (43)
- A method for the generation of 3D representative models of granular based materials
- Title not available (Why is that?)
- Percolation in invariant Poisson graphs with i.i.d. degrees
- 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.
- 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
- On a Class of Growth-Maximal Hardcore Processes
- Friendly Frogs, Stable Marriage, and the Magic of Invariance
- Poisson matching
- Geometrical selection in growing needles
- Recurrence or transience of random walks on random graphs generated by point processes in \(\mathbb{R}^d\)
- The size of components in continuum nearest-neighbor graphs
- Random spatial growth with paralyzing obstacles
- Absence of percolation for Poisson outdegree-one graphs
- Conformal loop ensembles: the Markovian characterization and the loop-soup construction
- Alignment percolation
- Optimal stationary markings
- Iterated Gilbert mosaics
- New 3D geometrical deposition methods for efficient packing of spheres based on tangency
- Continuum percolation and Euclidean minimal spanning trees in high dimensions
- Covering algorithms, continuum percolation and the geometry of wireless networks
- Random Sets: Models and Statistics
- The disk-percolation model on graphs
- Absence of percolation in graphs based on stationary point processes with degrees bounded by two
- Limit theorems for geometric functionals of Gibbs point processes
- Stationary Apollonian packings
- Signal to interference ratio percolation for Cox point processes
- Percolation in the vacant set of Poisson cylinders
- Percolation in the secrecy graph
- The random connection model in high dimensions
- A tale of two balloons
- Improving the 3D Finite-Discrete Element Method and Its Application in the Simulation of Wheel–Sand Interactions
- Deterministic walk on Poisson point process
- The RSW theorem for continuum percolation and the CLT for Euclidean minimal spanning trees
- Continuum percolation with steps in an annulus
- Continuum percolation with unreliable and spread-out connections
- Optimization of shape in continuum percolation
- Random nearest neighbor graphs: the translation invariant case
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4716331)
