Cluster size in bond percolation on the Platonic solids
@article{Lanchier2020ClusterSI, title={Cluster size in bond percolation on the Platonic solids}, author={Nicolas Lanchier and Axel La Salle}, journal={arXiv: Probability}, year={2020} }
The main objective of this paper is to study the size of a typical cluster of bond percolation on each of the five Platonic solids: the tetrahedron, the cube, the octahedron, the dodecahedron and the icosahedron. Looking at the clusters from a dynamical point of view, i.e., comparing the clusters with birth processes, we first prove that the first and second moments of the cluster size are bounded by their counterparts in a certain branching process, which results in explicit upper bounds that…
References
SHOWING 1-10 OF 14 REFERENCES
First and second moments of the size distribution of bond percolation clusters on rings, paths and stars
- Mathematics
- 2020
Uniqueness of the infinite cluster and continuity of connectivity functions for short and long range percolation
- Mathematics
- 1987
For independent translation-invariant irreducible percolation models, it is proved that the infinite cluster, when it exists, must be unique. The proof is based on the convexity (or almost convexity)…
Percolation ?
- Mathematics
- 1982
572 NOTICES OF THE AMS VOLUME 53, NUMBER 5 Percolation is a simple probabilistic model which exhibits a phase transition (as we explain below). The simplest version takes place on Z2, which we view…
Percolation on finite graphs and isoperimetric inequalities
- Mathematics
- 2004
Consider a uniform expanders family Gn with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of Gn obtained by retaining each edge, randomly and independently,…
Uniqueness of the infinite cluster and related results in percolation
- Mathematics
- 1987
We present the following results for independent percolation:
a)
continuous differentiability (in the natural parameters) of the free energy function (mean number of clusters per site),…
Largest random component of ak-cube
- MathematicsComb.
- 1982
It is shown that forp=λ/k, λ>1,Gk, p almost surely contains a connected component of sizec2k,c=c(λ) and it is also true that the second largest component is of sizeo(2k).
Percolation processes. I. Crystals and Mazes
- Physics
- 1957
ABSTRACT The paper studies, in a general way, how the random properties of a ‘medium’ influence the percolation of a ‘fluid’ through it. The treatment diifers from conventional diffusion theory, in…
The critical probability of bond percolation on the square lattice equals 1/2
- Mathematics
- 1980
We prove the statement in the title of the paper.
Dynamic structural percolation model of loss distribution for cyber risk of small and medium-sized enterprises for tree-based LAN topology
- Computer Science
- 2020
Random graphs
- Mathematics, Computer ScienceSODA '06
- 2006
Some of the major results in random graphs and some of the more challenging open problems are reviewed, including those related to the WWW.