相关论文: Finite-size left-passage probability in percolatio…
We propose a novel finite size scaling analysis for percolation transition observed in complex networks. While it is known that cooperative systems in growing networks often undergo an infinite order transition with inverted…
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 derive an exact, simple relation between the average number of clusters and the wrapping probabilities for two-dimensional percolation. The relation holds for periodic lattices of any size. It generalizes a classical result of Sykes and…
Following the recent investigations of Baik and Suidan in \cite{baik2005gcl} and Bodineau and Martin in \cite{bodineau2005upl}, we prove large deviation properties for a last-passage percolation model in $\mathbb{Z}^{2}_{+}$ whose paths are…
We study directed last-passage percolation on the planar square lattice whose weights have general distributions, or equivalently, queues in series with general service distributions. Each row of the last passage model has its own randomly…
A approach of finite size scaling theory for discontinous percolation with multiple giant clusters is developed in this paper. The percolation in generalized Bohman-Frieze-Wormald (BFW) model has already been proved to be discontinuous…
We provide a pedagogical review of CFT techniques to compute certain Schramm-Loewner Evolution (SLE) observables in the upper half-plane. The approach relies on the ability to express the observables as bulk-boundary correlation functions…
In Poisson percolation each edge becomes open after an independent exponentially distributed time with rate that decreases in the distance from the origin. As a sequel to our work on the square lattice, we describe the limiting shape of the…
Critical phenomena on scale-free networks with a degree distribution $p_k \sim k^{-\lambda}$ exhibit rich finite-size effects due to its structural heterogeneity. We systematically study the finite-size scaling of percolation and identify…
The universality of the crossing probability $\pi_{hs}$ of a system to percolate only in the horizontal direction, was investigated numerically by using a cluster Monte-Carlo algorithm for the $q$-state Potts model for $q=2,3,4$ and for…
We consider directed last-passage percolation on the random graph G = (V,E) where V = Z and each edge (i,j), for i < j, is present in E independently with some probability 0 < p <= 1. To every present edge (i,j) we attach i.i.d. random…
We study the two-dimensional domain morphology of twisted nematic liquid crystals during their phase-ordering kinetics [R. A. L. Almeida, Phys. Rev. Lett. 131 (2023) 268101], which is a physical candidate to self-generate critical clusters…
The scaling of the tails of the probability of a system to percolate only in the horizontal direction $\pi_{hs}$ was investigated numerically for correlated site-bond percolation model for $q=1,2,3,4$.We have to demonstrate that the tails…
In this paper, we obtain optimal uniform lower tail estimates for the probability distribution of the properly scaled length of the longest up/right path of the last passage site percolation model considered by Johansson in [12]. The…
We have found analytical expressions (polynomials) of the percolation probability for site percolation on a square lattice of size $L \times L$ sites when considering a plane (the crossing probability in a given direction), a cylinder…
We analyze site percolation on directed and undirected graphs with site-dependent open-site probabilities. We construct upper bounds on cluster susceptibilities, vertex connectivity functions, and the expected number of simple open cycles…
We obtain the harmonic measure of the hulls of critical percolation clusters and Ising-model Fortuin-Kastelyn clusters using a biased random-walk sampling technique which allows us to measure probabilities as small as 10^{-300}. We find the…
A wide variety of methods have been used to compute percolation thresholds. In lattice percolation, the most powerful of these methods consists of microcanonical simulations using the union-find algorithm to efficiently determine the…
A bounded random walk exhibits strong correlations between collisions with a boundary. For an one-dimensional walk, we obtain the full statistical distribution of the number of such collisions in a time t. In the large t limit, the…
We establish the sharpness of the percolation phase transition for a class of infinite-range weighted random connection models. The vertex set is given by a marked Poisson point process on $\mathbb{R}^d$ with intensity $\lambda>0$, where…