English
Related papers

Related papers: Percolations on random maps I: half-plane models

200 papers

We prove Tsirelson's conjecture that any scaling limit of the critical planar percolation is a black noise. Our theorems apply to a number of percolation models, including site percolation on the triangular grid and any subsequential…

Probability · Mathematics 2011-12-30 Stanislav Smirnov , Oded Schramm

The problem of percolation along sites of square lattice is studied. The number of contours being external boundaries for finite clusters has been estimated using geometric considerations. This estimation makes it possible to determine more…

Mathematical Physics · Physics 2007-05-23 Yu. P. Virchenko , Yu. A. Tolmacheva

We present a method of general applicability for finding exact or accurate approximations to bond percolation thresholds for a wide class of lattices. To every lattice we sytematically associate a polynomial, the root of which in $[0,1]$ is…

Statistical Mechanics · Physics 2015-05-14 Christian R. Scullard , Robert M. Ziff

A general method is proposed for predicting the asymptotic percolation threshold of networks with bottlenecks, in the limit that the sub-net mesh size goes to zero. The validity of this method is tested for bond percolation on filled…

Statistical Mechanics · Physics 2009-11-13 Amir Haji-Akbari , Robert M. Ziff

We study a spatial network model with exponentially distributed link-lengths on an underlying grid of points, undergoing a structural crossover from a random, Erd\H{o}s--R\'enyi graph to a $2D$ lattice at the characteristic interaction…

Physics and Society · Physics 2019-08-28 Ivan Bonamassa , Bnaya Gross , Michael M. Danziger , Shlomo Havlin

We consider Bernoulli hyper-edge percolation on $\mathbb{Z}^d$. This model is a generalization of Bernoulli bond percolation. An edge connects exactly two vertices and a hyper-edge connects more than two vertices. As in the classical…

Probability · Mathematics 2022-02-14 Yinshan Chang

We obtain new lower bounds on the critical points for various models of oriented percolation. The method is to provide a stochastic domination of the percolation processes by multitype Galton-Watson trees. This can be apply to the classical…

Probability · Mathematics 2023-08-23 Olivier Couronné

We determine the asymptotic law for the fluctuations of the total number of critical points of random Gaussian spherical harmonics in the high degree limit. Our results have implications on the sophistication degree of an appropriate…

Probability · Mathematics 2018-01-09 Valentina Cammarota , Igor Wigman

In the bond percolation model on a lattice, we colour vertices with $n_c$ colours independently at random according to Bernoulli distributions. A vertex can receive multiple colours and each of these colours is individually observable. The…

Statistics Theory · Mathematics 2019-06-14 Felix Beck , Bence Mélykúti

In a recent paper, we have reported a universal power law for both site and bond percolation thresholds for any lattice of cubic symmetry. Extension to anisotropic lattices is discussed.

Disordered Systems and Neural Networks · Physics 2009-10-30 Serge Galam , Alain Mauger

On a locally finite, infinite tree $T$, let $p_c(T)$ denote the critical probability for Bernoulli percolation. We prove that every positively associated, finite-range dependent percolation model on $T$ with marginals $p > p_c(T)$ must…

Probability · Mathematics 2024-05-14 Laurin Köhler-Schindler , Aurelio L. Sulser

We study random coloring of the hexagons of a honeycomb lattice into $2^{n-1}$ colors (that is the standard Potts model at infinite temperature). It may be considered as a generalization of percolation to $n$ pairwise independent, but…

Mathematical Physics · Physics 2019-09-02 Mikhail Fedorov

We consider the bond percolation problem on a transient weighted graph induced by the excursion sets of the Gaussian free field on the corresponding cable system. Owing to the continuity of this setup and the strong Markov property of the…

Probability · Mathematics 2023-03-21 Alexander Drewitz , Alexis Prévost , Pierre-François Rodriguez

We consider changes in properties of a subgraph of an infinite graph resulting from the addition of open edges of Bernoulli percolation on the infinite graph to the subgraph. We give the triplet of an infinite graph, one of its subgraphs,…

Probability · Mathematics 2026-04-21 Kazuki Okamura

We consider a dilute lattice obtained from the usual $\mathbb{Z}^3$ lattice by removing independently each of its columns with probability $1-\rho$. In the remaining dilute lattice independent Bernoulli bond percolation with parameter $p$…

Probability · Mathematics 2020-05-01 Marcelo R. Hilário , Marcos Sá , Rémy Sanchis

We characterize all translation invariant half planar maps satisfying a certain natural domain Markov property. For p-angulations with p \ge 3 where all faces are simple, we show that these form a one-parameter family of measures…

Probability · Mathematics 2014-02-27 Omer Angel , Gourab Ray

We consider the percolation problem of sites on an $L\times L$ square lattice with periodic boundary conditions which were unvisited by a random walk of $N=uL^2$ steps, i.e. are vacant. Most of the results are obtained from numerical…

Statistical Mechanics · Physics 2021-03-24 Amit Federbush , Yacov Kantor

Percolation and jamming phenomena are investigated for random sequential deposition of rectangular needles on $d=2$ square lattices. Associated thresholds $p_c^{perc}$ and $p_c^{jam}$ are determined for various needle sizes. Their ratios…

Disordered Systems and Neural Networks · Physics 2009-10-31 N. Vandewalle , S. Galam , M. Kramer

We show that crossing probabilities in 2D critical site percolation on the triangular lattice in a piecewise analytic Jordan domain converge with power law rate in the mesh size to their limit given by the Cardy-Smirnov formula. We use this…

Probability · Mathematics 2014-05-05 Dana Mendelson , Asaf Nachmias , Samuel S. Watson

In this article we introduce a simple tool to derive polynomial upper bounds for the probability of observing unusually large maximal components in some models of random graphs when considered at criticality. Specifically, we apply our…

Probability · Mathematics 2022-02-01 Umberto De Ambroggio
‹ Prev 1 8 9 10 Next ›