Related papers: An improved decoupling inequality for random inter…

We consider continuous-time random interlacements on Z^d, d greater or equal to 3, and investigate the percolation model where a site x of Z^d is occupied if the total amount of time spent at x by all the trajectories of the interlacement…

In this work, which is the first part of a series of two papers, we study the random walk loop soup in dimension two. More specifically, we estimate the probability that two large connected components of loops come close to each other, in…

We consider large random graphs with prescribed degrees, such as those generated by the configuration model. In the regime where the empirical degree distribution approaches a limit $\mu$ with finite mean, we establish the systematic…

We prove that a suitably de-biased version of Chatterjee's rank correlation based on i.i.d. copies of a random vector $(X,Y)$ is asymptotically normal whenever $Y$ is not almost surely constant. No further conditions on the joint…

Let {(Z_i,W_i):i=1,...,n} be uniformly distributed in [0,1]^d * G(k,d), where G(k,d) denotes the space of k-dimensional linear subspaces of R^d. For a differentiable function f from [0,1]^k to [0,1]^d we say that f interpolates (z,w) in…

In this paper, we study the order of the largest connected component of a random graph having two sources of randomness: first, the graph is chosen randomly from all graphs with a given degree sequence, and then bond percolation is applied.…

We establish a sprinkled decoupling inequality for increasing events of Gaussian vectors with an error that depends only on the maximum pairwise correlation. As an application we prove the non-triviality of the percolation phase transition…

In this paper we establish a strong decoupling inequality for the cylinder's percolation process introduced by Tykesson and Windisch in arXiv:1010.5338 . This model features a very strong dependency structure, making it difficult to study,…

We consider $Z^d$, with d bigger or equal to three. We investigate the vacant set of random interlacements in the strongly percolative regime, the vacant set of the simple random walk, and the excursion set above a given level of the…

We prove decoupling inequalities for the Gaussian free field on $\mathbb{Z}^d$, $d\geq 3$. As an application, we obtain exponential decay (with logarithmic correction for $d=3$) of the connectivity function of excursion sets for large…

We consider the model of Branching Interlacements, introduced by Zhu, which is a natural analogue of Sznitman's Random Interlacements model, where the random walk trajectories are replaced by ranges of some suitable tree-indexed random…

We study the trajectory of a simple random walk on a d-regular graph with d>2 and locally tree-like structure as the number n of vertices grows. Examples of such graphs include random d-regular graphs and large girth expanders. For these…

A powerful statistical interpolating concept, which we call \emph{fully lifted} (fl), is introduced and presented while establishing a connection between bilinearly indexed random processes and their corresponding fully decoupled (linearly…

We consider a family of percolation models in which geometry and connectivity are defined by two independent random processes. Such models merge characteristics of discrete and continuous percolation. We develop an algorithm allowing…

One of the most important properties of high dimensional expanders is that high dimensional random walks converge rapidly. This property has proven to be extremely useful in variety of fields in the theory of computer science from agreement…

We consider a general enough set-up and obtain a refinement of the coupling between the Gaussian free field and random interlacements recently constructed by Titus Lupu in arXiv:1402.0298. We apply our results to level-set percolation of…

Let $(Z_n)_{n\in\N}$ be a $d$-dimensional {\it random walk in random scenery}, i.e., $Z_n=\sum_{k=0}^{n-1}Y(S_k)$ with $(S_k)_{k\in\N_0}$ a random walk in $\Z^d$ and $(Y(z))_{z\in\Z^d}$ an i.i.d. scenery, independent of the walk. The…

We investigate random interlacements on Z^d, d bigger or equal to 3. This model recently introduced in arXiv:0704.2560 corresponds to a Poisson cloud on the space of doubly infinite trajectories modulo time-shift tending to infinity at…

A {\em maximal inequality} seeks to estimate $\mathbb{E}\max_i X_i$ in terms of properties of the $X_i$. When the latter are independent, the union bound (in its various guises) can yield tight upper bounds. If, however, the $X_i$ are…

In 2004, Kim and Vu conjectured that, when $d=\omega(\log n)$, the random $d$-regular graph $G_d(n)$ can be sandwiched with high probability between two random binomial graphs $G(n,p)$ with edge probabilities asymptotically equal to…