Continuous percolation: Tree approximation and most probable clusters
From MaRDI portal
Recommendations
Cited in
(19)- Growth, percolation, and correlations in disordered fiber networks
- Finite clusters in high-density continuous percolation: Compression and sphericality
- A probabilistic approach to the site percolation problems using fractal tree
- Exact determination of the two-point cluster function for one-dimensional continuum percolation.
- Connectivity properties of continuum percolation processes on R^2
- From lattice long-range percolation to the continuum one.
- A critical exponent for shortest-path scaling in continuum percolation
- Monte Carlo renormalization group study of the percolation problem of discs with a distribution of radii
- Percolation of overlapping squares or cubes on a lattice
- From discrete to continuous percolation in dimensions 3 to 7
- Emergence of giant strongly connected components in continuum disk-spin percolation
- Anisotropy in finite continuum percolation: threshold estimation by Minkowski functionals
- Estimation of percolation thresholds via percolation in inhomogeneous media
- Two-dimensional continuum percolation models with disks under the generalized Achlioptas process
- Percolation of hyperspheres in dimensions 3 to 5: from discrete to continuous
- Topological estimation of percolation thresholds
- Percolation of fully penetrable disks using the three-leg cluster method
- Excess number of percolation clusters on the surface of a sphere
- A lattice-based approach to percolation in penetrable sphere systems
This page was built for publication: Continuous percolation: Tree approximation and most probable clusters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2712758)
