Results 1 to 10 of about 24 (24)
Conformal loop ensembles (CLEs) are random collections of loops in a simply connected domain, whose laws are characterized by a natural conformal invariance property.
JASON MILLER +2 more
doaj +1 more source
Counting minimal cutsets and $p_c<1$
We prove two results concerning percolation on general graphs. • We establish the converse of the classical Peierls argument: if the critical parameter for (uniform) percolation satisfies ...
Philip Easo +2 more
doaj +1 more source
Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs
One-dependent first passage percolation is a spreading process on a graph where the transmission time through each edge depends on the direct surroundings of the edge. In particular, the classical i.i.d. transmission time $L_{xy}$ is multiplied by
Júlia Komjáthy +3 more
doaj +1 more source
RIGID GRAPH COMPRESSION: MOTIF-BASED RIGIDITY ANALYSIS FOR DISORDERED FIBER NETWORKS. [PDF]
Heroy S +4 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Hölder regularity and dimension bounds for random curves
Duke Mathematical Journal, 1999Michael Aizenman, Almut Burchard
exaly
One-Arm Exponent for Critical 2D Percolation
Electronic Journal of Probability, 2002Oded Schramm, Wendelin Werner
exaly
Subdiffusive concentration in first passage percolation
Electronic Journal of Probability, 2014Michael Damron, Jack Hanson
exaly
On the chemical distance for supercritical Bernoulli percolation
Annals of Probability, 1996Agoston Pisztora
exaly
Subcritical regimes in the Poisson Boolean model of continuum percolation
Annals of Probability, 2008Jean-Baptiste Gouère
exaly
On Long Range Percolation with Heavy Tails
Electronic Communications in Probability, 2004Vladas Sidoravicius
exaly

