Searcharxiv⌕ Search

arXiv subjects

Artem Sapozhnikov

Publications and source records attributed to Artem Sapozhnikov.

22 records · Page 2Linked to original sources

The effect of small quenched noise on connectivity properties of random interlacements

The random interlacements (at level u) is a one parameter family of random subsets of Z^d introduced by Sznitman in arXiv:0704.2560. The vacant set at level u is the complement of the random interlacement at level u. In this paper, we study the effect of small quenched noise on connectivity properties of the random interlacement and the vacant set. While the random interlacement induces a connected subgraph of Z^d for all levels u, the vacant set has a non-trivial phase transition in u, as shown in arXiv:0704.2560 and arXiv:0808.3344. For a positive epsilon, we allow each vertex of the random interlacement (referred to as occupied) to become vacant, and each vertex of the vacant set to become occupied with probability epsilon, independently of the randomness of the interlacement, and independently for different vertices. We prove that for any d>=3 and u>0, almost surely, the perturbed random interlacement percolates for small enough noise parameter epsilon. In fact, we prove the stronger statement that Bernoulli percolation on the random interlacement graph has a non-trivial phase transition in wide enough slabs. As a byproduct, we show that any electric network with i.i.d. positive resistances on the interlacement graph is transient, which strengthens our result in arXiv:1102.4758. As for the vacant set, we show that for any d>=3, there is still a non-trivial phase transition in u when the noise parameter epsilon is small enough, and we give explicit upper and lower bounds on the value of the critical threshold, when epsilon tends to 0.

math.PR↗

The incipient infinite cluster does not stochastically dominate the invasion percolation cluster in two dimensions

This note is motivated by results in arXiv:math/0608132 and arXiv:0806.2425 about global relations between the invasion percolation cluster (IPC) and the incipient infinite cluster (IIC) on regular trees and on two dimensional lattices, respectively. Namely, that the laws of the two objects are mutually singular, and, in the case of regular trees, that the IIC stochastically dominates the IPC. We prove that on two dimensional lattices, the IIC does not stochastically dominate the IPC. This is the first example showing that the relation between the IIC and IPC is significantly different on trees and in two dimensions.

math.PR↗

Upper bound on the expected size of intrinsic ball

We give a short proof of Theorem 1.2 (i) from the paper "The Alexander-Orbach conjecture holds in high dimensions" by G. Kozma and A. Nachmias. We show that the expected size of the intrinsic ball of radius r is at most Cr if the susceptibility exponent is at most 1. In particular, this result follows if the so-called triangle condition holds.

math.PR↗

Outlets of 2D invasion percolation and multiple-armed incipient infinite clusters

We study invasion percolation in two dimensions, focusing on properties of the outlets of the invasion and their relation to critical percolation and to incipient infinite clusters (IIC's). First we compute the exact decay rate of the distribution of both the weight of the kth outlet and the volume of the kth pond. Next we prove bounds for all moments of the distribution of the number of outlets in an annulus. This result leads to almost sure bounds for the number of outlets in a box B(2^n) and for the decay rate of the weight of the kth outlet to p_c. We then prove existence of multiple-armed IIC measures for any number of arms and for any color sequence which is alternating or monochromatic. We use these measures to study the invaded region near outlets and near edges in the invasion backbone far from the origin.

math.PR↗