Related papers: Diagrammatic bounds on the lace-expansion coeffici…
We theoretically investigate the quantum percolation problem on Lieb lattices in two and three dimensions. We study the statistics of the energy levels through random matrix theory, and determine the level spacing distributions, which, with…
We study the history-dependent percolation in two dimensions, which evolves in generations from standard bond-percolation configurations through iteratively removing occupied bonds. Extensive simulations are performed for various…
We consider independent and $m$-dependent two-dimensional oriented site percolation with open-site density close to one started from Bernoulli product measures. We show that the probability of an occupied interval in the former process…
Following the approach outlined in [18], convergence to SLE6 of the Exploration Processes for the correlated bond-triangular type models studied in [7] is established. This puts the said models in the same universality class as the standard…
We investigate expansions for connectedness functions in the random connection model of continuum percolation in powers of the intensity. Precisely, we study the pair-connectedness and the direct-connectedness functions, related to each…
We study limits of the largest connected components (viewed as metric spaces) obtained by critical percolation on uniformly chosen graphs and configuration models with heavy-tailed degrees. For rank-one inhomogeneous random graphs, such…
The purpose of this note is twofold. First, we survey the study of the percolation phase transition on the Hamming hypercube {0,1}^m obtained in the series of papers [9,10,11,24]. Secondly, we explain how this study can be performed without…
We consider the percolation problem in the high-temperature Ising model on the two-dimensional square lattice at/near critical external fields. We show that all scaling relations, except a single hyperscaling relation, hold under the power…
We study the connected components in critical percolation on the Hamming hypercube $\{0,1\}^m$. We show that their sizes rescaled by $2^{-2m/3}$ converge in distribution, and that, considered as metric measure spaces with the graph distance…
We give a new lower bound on the expansion coefficient of an edge-vertex graph of a $d$-regular graph. As a consequence, we obtain an improvement on the lower bound on relative minimum distance of the expander codes constructed by Sipser…
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…
We consider critical percolation on the triangular lattice in a bounded simply connected domain with boundary conditions that force an interface between two prescribed boundary points. We say the interface forms a "near-loop" when it comes…
We introduce a formula for translating any upper bound on the percolation threshold of a lattice \g into a lower bound on the exponential growth rate of lattice animals $a(G)$ and vice-versa. We exploit this to improve on the best known…
We study the phase transition phenomena for long-range oriented percolation and contact process. We studied a contact process in which the range of each vertex are independent, updated dynamically and given by some distribution $N$. We also…
We study the statistics of the backbone cluster between two sites separated by distance $r$ in two-dimensional percolation networks subjected to spatial long-range correlations. We find that the distribution of backbone mass follows the…
We consider the Bernoulli bond percolation process (with parameter $p$) on infinite graphs and we give a general criterion for bounded degree graphs to exhibit a non-trivial percolation threshold based either on a single isoperimetric…
Using Monte Carlo simulations on different system sizes we determine with high precision the critical thresholds of two families of directed percolation models on a square lattice. The thresholds decrease exponentially with the degree of…
Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…
We extend previous work of max-linear models on finite directed acyclic graphs to infinite graphs as well as random graphs, and investigate their relations to classical percolation theory, more particularly the impact of Bernoulli bond…
Building on the identification of the scaling limit of the critical percolation exploration process as a Schramm-Loewner Evolution, we derive a PDE characterization for the crossing probability of an annulus.