Related papers: Pivotal, cluster and interface measures for critic…
We prove that in the scaling limit, the crossing probabilities of multiple interfaces in the critical planar Ising model with alternating boundary conditions are conformally invariant expressions given by the pure partition functions of…
Recently it has been demonstrated that the connectivity transition from microscopic connectivity to macroscopic connectedness, known as percolation, is generically announced by a cascade of microtransitions of the percolation order…
We study the percolation phase transition on preferential attachment models, in which vertices enter with $m$ edges and attach proportionally to their degree plus $\delta$. We identify the critical percolation threshold as…
We study constrained percolation models on planar lattices including the $[m,4,n,4]$ lattice and the square tilings of the hyperbolic plane, satisfying certain local constraints on faces of degree 4, and investigate the existence of…
We study infinite ``$+$'' or ``$-$'' clusters for an Ising model on an connected, transitive, non-amenable, planar, one-ended graph $G$ with finite vertex degree. If the critical percolation probability $p_c^{site}$ for the i.i.d.~Bernoulli…
The concept of midpoint percolation has recently been applied to characterize the double percolation transitions in negatively curved structures. Regular $d$-dimensional hypercubic lattices are in the present work investigated using the…
Percolation clusters are probably the simplest example for scale--invariant structures which either are governed by isotropic scaling--laws (``self--similarity'') or --- as in the case of directed percolation --- may display anisotropic…
Lawler, Schramm and Werner showed that the scaling limit of the loop-erased random walk on $\mathbb{Z}^2$ is $\mathrm{SLE}_2$. We consider scaling limits of the loop-erasure of random walks on other planar graphs (graphs embedded into…
We describe the critical window for percolation in the universality class of sparse growing random graphs. In our models, vertices arrive sequentially and connect independently to each earlier vertex $v$ with probability proportional to a…
The main purpose of percolation theory is to model phase transitions in a variety of random systems, which is highly valuable in fields related to materials physics, biology, or otherwise unrelated areas like oil extraction or even quantum…
We study oriented percolation on random causal triangulations, those are random planar graphs obtained roughly speaking by adding horizontal connections between vertices of an infinite tree. When the underlying tree is a geometric…
To reach a deeper understanding of fluid interfaces it is necessary to identify a meaningful coarse-graining length that separates intrinsic fluctuations from capillary ones, given the lack of a proper statistical mechanical definition of…
We show that there exists a unique (up to multiplication by constants) and natural measure on simple loops in the plane and on each Riemann surface, such that the measure is conformally invariant and also invariant under restriction (i.e.…
Motivated by recent experiments, we investigate the scattering properties of percolation clusters generated by numerical simulations on a three dimensional cubic lattice. Individual clusters of given size are shown to present a fractal…
We use invasion percolation to compute numerical values for bond and site percolation thresholds $p_c$ (existence of an infinite cluster) and $p_u$ (uniqueness of the infinite cluster) of tesselations $\{P,Q\}$ of the hyperbolic plane,…
The aim of the paper is to present numerical results supporting the presence of conformal invariance in three dimensional statistical mechanics models at criticality and to elucidate the geometric aspects of universality. As a case study we…
We present a detailed description of the idea and procedure for the newly proposed Monte Carlo algorithm of tuning the critical point automatically, which is called the probability-changing cluster (PCC) algorithm [Y. Tomita and Y. Okabe,…
We prove the existence of scaling limits for the projection on the backbone of the random walks on the Incipient Infinite Cluster and the Invasion Percolation Cluster on a regular tree. We treat these projected random walks as randomly…
We study intersection properties of two or more independent tree-like random graphs. Our setting encompasses critical, possibly long range, Bernoulli percolation clusters, incipient infinite clusters, as well as critical branching random…
We develop a general universality technique for establishing metric scaling limits of critical random discrete structures exhibiting mean-field behavior that requires four ingredients: (i) from the barely subcritical regime to the critical…