Gaussian estimates for symmetric simple exclusion processes
We consider a strong Markov process with killing and prove an approximation method for the distribution of the process conditioned not to be killed when it is observed. The method is based on a Fleming−Viot type particle system with rebirths, whose particles evolve as independent copies of the original strong Markov process and jump onto each others instead of being killed. Our only assumption is that the number of rebirths of the Fleming−Viot type system doesn’t explode in finite time almost surely...
We prove several facts concerning Lipschitz percolation, including the following. The critical probability pL for the existence of an open Lipschitz surface in site percolation on ℤd with d ≥ 2 satisfies the improved bound pL ≤ 1 − 1/[8(d − 1)]. Whenever p > pL, the height of the lowest Lipschitz surface above the origin has an exponentially decaying tail. For p sufficiently close to 1, the connected regions of ℤd−1 above which the surface has height 2 or more exhibit stretched-exponential...
We consider random walk on a discrete torus of side-length , in sufficiently high dimension . We investigate the percolative properties of the vacant set corresponding to the collection of sites which have not been visited by the walk up to time . We show that when is chosen small, as tends to infinity, there is with overwhelming probability a unique connected component in the vacant set which contains segments of length const . Moreover, this connected component occupies a non-degenerate...
In this paper we study homogeneous Gibbs measures on a Cayley tree, subjected to an infinite-temperature Glauber evolution, and consider their (non-)Gibbsian properties. We show that the intermediate Gibbs state (which in zero field is the free-boundary-condition Gibbs state) behaves differently from the plus and the minus state. E.g. at large times, all configurations are bad for the intermediate state, whereas the plus configuration never is bad for the plus state. Moreover, we show that for each...