Related papers: Sharp asymptotics for arm probabilities in critica…
We provide precise asymptotic estimates for the number of several classes of labelled cubic planar graphs, and we analyze properties of such random graphs under the uniform distribution. This model was first analyzed by Bodirsky et al.…
We study site and bond percolation on directed simple random graphs with a given degree distribution and derive the expressions for the critical value of the percolation probability above which the giant strongly connected component emerges…
A rigorous theory of diffraction scattering from extended objects is proposed. The present theory is based on a multiple asymptotic expansion of an integral equation for the exact wave function in terms of the large parameters of the…
We investigate oriented bond-site percolation on the planar lattice in which entire columns are stretched. Generalising recent results by Hil\'ario et al., we establish non-trivial percolation under a $(1+\varepsilon)$-th moment condition…
We prove a Central Limit Theorem for the Critical Points of Random Spherical Harmonics, in the High-Energy Limit. The result is a consequence of a deeper characterizations of the total number of critical points, which are shown to be…
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 give an asymptotic probabilistic real Riemann-Hurwitz formula computing the expected real ramification index of a random covering over the Riemann sphere. More generally, we study the asymptotic expected number and distribution of…
Consider the critical long-range percolation on $\mathbb{Z}$, where an edge connects $i$ and $j$ independently with probability $1-\exp\{-\beta\int_i^{i+1}\int_j^{j+1}|u-v|^{-2}d ud v\}$ for $|i-j|>1$ for some fixed $\beta>0$ and with…
We consider a directed percolation process on an ${\cal M}$ x ${\cal N}$ rectangular lattice whose vertical edges are directed upward with an occupation probability y and horizontal edges directed toward the right with occupation…
Asymptotic theory for approximate martingale estimating functions is generalised to diffusions with finite-activity jumps, when the sampling frequency and terminal sampling time go to infinity. Rate optimality and efficiency are of…
Using a recently developed method to simulate percolation on large clusters of distributed machines [N. R. Moloney and G. Pruessner, Phys. Rev. E 67, 037701 (2003)], we have numerically calculated crossing, spanning and wrapping…
We consider the random walk loop soup on the discrete half-plane and study the percolation problem, i.e. the existence of an infinite cluster of loops. We show that the critical value of the intensity is equal to 1/2. The absence of…
We consider supercritical long-range percolation on transitive graphs of polynomial growth. In this model, any two vertices $x$ and $y$ of the underlying graph $G$ connect by a direct edge with probability $1-\exp(-\beta J(x,y))$, where…
We obtain an asymptotic normality result that reveals the precise asymptotic behavior of the maximum likelihood estimators of parameters for a very general class of linear mixed models containing cross random effects. In achieving the…
In recent years, important progress has been made in the field of two-dimensional statistical physics. One of the most striking achievements is the proof of the Cardy-Smirnov formula. This theorem, together with the introduction of…
We consider Bernoulli percolation on transitive graphs of polynomial growth. In the subcritical regime ($p<p_c$), it is well known that the connection probabilities decay exponentially fast. In the present paper, we study the supercritical…
We make use of the recent proof that the critical probability for percolation on random Voronoi tessellations is 1/2 to prove the corresponding result for random Johnson-Mehl tessellations, as well as for two-dimensional slices of higher…
We derive three critical exponents for Bernoulli site percolation on the on the Uniform Infinite Planar Triangulation (UIPT). First we compute explicitly the probability that the root cluster is infinite. As a consequence, we show that the…
Despite great progress in the study of critical percolation on $\mathbb{Z}^d$ for $d$ large, properties of critical clusters in high-dimensional fractional spaces and boxes remain poorly understood, unlike the situation in two dimensions.…
We use isoperimetric inequalities combined with a new technique to prove upper bounds for the site percolation threshold of plane graphs with given minimum degree conditions. In the process we prove tight new isoperimetric bounds for…