Related papers: Mapping functions and critical behavior of percola…

We present an "ultimate" proof of Cardy's formula for the critical percolation on the hexagonal lattice \cite{Smirnov01criticalpercolation}, showing the existence of the universal and conformally invariant scaling limit of crossing…

Criticality is traditionally regarded as an unstable, fine-tuned fixed point of the renormalization group. We introduce an iterative bicolored percolation process in two dimensions and show that it can both preserve criticality and…

Let $d\ge 3$ be a fixed integer, $p\in (0,1)$, and let $n\geq 1$ be a positive integer such that $dn$ is even. Let $\mathbb{G}(n, d, p)$ be a (random) graph on $n$ vertices obtained by drawing uniformly at random a $d$-regular (simple)…

The relation between the jump length probability distribution function and the spectral line profile in resonance atomic radiation trapping is considered for Partial Frequency Redistribution (PFR) between absorbed and reemitted radiation.…

Resonances of the time evolution (Frobenius-Perron) operator P for phase space densities have recently been shown to play a key role for the interrelations of classical, semiclassical and quantum dynamics. Efficient methods to determine…

Following H. Tomita and C. Murakami we propose an analytical model to predict critical probability of percolation. It is based on the excursion set theory which allows us to consider N-dimensional bounded regions. Details are given for the…

We show analytically that the $[0,1]$, $[1,1]$ and $[2,1]$ Pad{\'e} approximants of the mean cluster number $S(p)$ for site and bond percolation on general $d$-dimensional lattices are upper bounds on this quantity in any Euclidean…

Using finite-size scaling methods we measure the thermal and magnetic exponents of the site percolation in four dimensions, obtaining a value for the anomalous dimension very different from the results found in the literature. We also…

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…

We consider independent edge percolation models on Z, with edge occupation probabilities p_<x,y> = p if |x-y| = 1, 1 - exp{- beta / |x-y|^2} otherwise. We prove that oriented percolation occurs when beta > 1 provided p is chosen…

We estimate density and regression functions for weak dependant datas. Using an exponential inequality obtained by Dedecker and Prieur and in a previous article of the author, we control the deviation between the estimator and the function…

The goal of this note is to announce certain results in orbit equivalence theory, especially concerning the approximation of p.m.p. standard equivalence relations by increasing sequence of sub-relations, with applications to the behavior of…

By means of numerical simulations we investigate the geometric properties of loops on hypercubic lattice graphs in dimensions d=2 through 7, where edge weights are drawn from a distribution that allows for positive and negative weights. We…

We consider a percolation process in which $k$ points separated by a distance proportional to system size $L$ simultaneously connect together ($k>1$), or a single point at the center of a system connects to the boundary ($k=1$), through…

Langlands et al. considered two crossing probabilities, pi_h and pi_{hv}, in their extensive numerical investigations of critical percolation in two dimensions. Cardy was able to find the exact form of pi_h by treating it as a correlation…

There exists a Lipschitz embedding of a d-dimensional comb graph (consisting of infinitely many parallel copies of Z^{d-1} joined by a perpendicular copy) into the open set of site percolation on Z^d, whenever the parameter p is close…

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…

Majority bootstrap percolation on the random graph $G_{n,p}$ is a process of spread of "activation" on a given realisation of the graph with a given number of initially active nodes. At each step those vertices which have more active…

Majority bootstrap percolation on a graph $G$ is an epidemic process defined in the following manner. Firstly, an initially infected set of vertices is selected. Then step by step the vertices that have more infected than non-infected…

Eulerian percolation on Z 2 with parameter p is the classical Bernoulli bond percolation with parameter p conditioned on the fact that every site has an even degree. We first explain why Eulerian percolation with parameter p coincides with…