• Corpus ID: 227253800

Cluster size in bond percolation on the Platonic solids

  title={Cluster size in bond percolation on the Platonic solids},
  author={Nicolas Lanchier and Axel La Salle},
  journal={arXiv: Probability},
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… 

Figures from this paper



Uniqueness of the infinite cluster and continuity of connectivity functions for short and long range percolation

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 ?

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

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

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

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

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

We prove the statement in the title of the paper.

Random graphs

  • A. Frieze
  • Mathematics, Computer Science
    SODA '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.