Related papers: Exact critical exponent for the shortest-path scal…
We study the phase diagram and critical behavior of the one-dimensional pair contact process (PCP) with a particle source using cluster approximations and extensive simulations. The source creates isolated particles only, not pairs, and so…
A new algorithm for the derivation of low-density expansions has been used to greatly extend the series for moments of the pair-connectedness on the directed square lattice near an impenetrable wall. Analysis of the series yields very…
We consider long-range percolation in dimension $d\geq 1$, where distinct sites $x$ and $y$ are connected with probability $p_{x,y}\in[0,1]$. Assuming that $p_{x,y}$ is translation invariant and that $p_{x,y}=\|x-y\|^{-s+o(1)}$ with $s>2d$,…
We investigate the effect of sequentiallydisrupting the shortest path of percolation clusters at criticality by comparing it with the shortest alternative path. We measure the difference in length and the enclosed area between the two…
We study the pair contact process with diffusion (PCPD) using Monte Carlo simulations, and concentrate on the decay of the particle density $\rho$ with time, near its critical point, which is assumed to follow $\rho(t) \approx ct^{-\delta}…
We propose a simple yet very predictive form, based on a Poisson's equation, for the functional dependence of the cost from the density of points in the Euclidean bipartite matching problem. This leads, for quadratic costs, to the analytic…
We develop a method of constructing percolation clusters that allows us to build very large clusters using very little computer memory by limiting the maximum number of sites for which we maintain state information to a number of the order…
Our study concerns the large scale geometry of the excursion set of planar random fields: E ${\ell}$ = {x $\in$ R 2 |f (x) $\ge$-${\ell}$}, where ${\ell}$ $\in$ R is a real parameter and f is a continuous, stationary, centered, planar…
Consider nearest-neighbor oriented percolation in $d+1$ space-time dimensions. Let $\rho,\eta,\nu$ be the critical exponents for the survival probability up to time $t$, the expected number of vertices at time $t$ connected from the…
We study the asymptotics of correlations and nearest neighbor spacings between zeros and holomorphic critical points of $p_N$, a degree N Hermitian Gaussian random polynomial in the sense of Shiffman and Zeldtich, as N goes to infinity. By…
Percolation refers to the emergence of a giant connected cluster in a disordered system when the number of connections between nodes exceeds a critical value. The percolation phase transitions were believed to be continuous until recently…
The two-dimensional site percolation problem is studied by transfer-matrix methods on finite-width strips with free boundary conditions. The relationship between correlation-length amplitudes and critical indices, predicted by conformal…
We derive exact formulae for three basic annulus crossing events for the critical planar Bernoulli percolation in the continuum limit. The first is for the probability that there is an open path connecting the two boundaries of an annulus…
It is argued that in relativistic heavy ion collisions, due to limited size of the formed matter, the reliable criterion of critical point is finite-size scaling, rather than non-monotonous behavior of observable. How to locate critical…
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…
We have exploited a variety of techniques to study the universality and stability of the scaling properties of Harper's equation, the equation for a particle moving on a tight-binding square lattice in the presence of a gauge field, when…
We consider i.i.d. first-passage percolation (FPP) on the two-dimensional square lattice, in the critical case where edge-weights take the value zero with probability $\tfrac{1}{2}$. Critical FPP is unique in that the Euclidean lengths of…
A 1/L-expansion for percolation problems is proposed, where L is the lattice finite length. The square lattice with 27 different sizes L = 18, 22 ... 1594 is considered. Certain spanning probabilities were determined by Monte Carlo…
We derive an estimate for the distance, measured in lattice spacings, inside two-dimensional critical percolation clusters from the origin to the boundary of the box of side length $2n$, conditioned on the existence of an open connection.…
In a recent breakthrough work, Chatterjee [Ann. of Math. (2) 177 (2013) 663-697] proved a long standing conjecture that relates the transversal exponent $\xi$ and the fluctuation exponent $\chi$ in first-passage percolation on…