Related papers: The vacant set of two-dimensional critical random …
In the interchange process on a graph $G=(V,E)$, distinguished particles are placed on the vertices of $G$ with independent Poisson clocks on the edges. When the clock of an edge rings, the two particles on the two sides of the edge…
We prove that in any recurrent reversible random rooted graph, two independent simple random walks started at the same vertex collide infinitely often almost surely. This applies to the Uniform Infinite Planar Triangulation and…
We investigate the entanglement and nonlocality properties of two random XX spin-1/2 critical chains, in order to better understand the role of breaking translational invariance to achieve nonlocal states in critical systems. We show that…
In dynamical percolation, the status of every bond is refreshed according to an independent Poisson clock. For graphs which do not percolate at criticality, the dynamical sensitivity of this property was analyzed extensively in the last…
Activated Random Walks, on $\mathbb{Z}^d$ for any $d\geqslant 1$, is an interacting particle system, where particles can be in either of two states: active or frozen. Each active particle performs a continuous-time simple random walk during…
We analyze the dynamics of random walks with long-term memory (binary chains with long-range correlations) in the presence of an absorbing boundary. An analytically solvable model is presented, in which a dynamical phase-transition occurs…
We describe the critical window for percolation in the universality class of sparse growing random graphs. In our models, vertices arrive sequentially and connect independently to each earlier vertex $v$ with probability proportional to a…
Using combinatorial optimisation techniques we study the critical properties of the two- and the three-dimensional Ising model with uniformly distributed random antiferromagnetic couplings $(1 \le J_i \le 2)$ in the presence of a…
We consider a one-dimensional simple symmetric exclusion process in equilibrium, constituting a dynamic random environment for a nearest-neighbor random walk that on occupied/vacant sites has two different local drifts to the right. We…
The main focus of this article concerns the strongly percolative regime of the vacant set of random interlacements on $ \mathbb{Z}^d$, with $d \ge 3$. We investigate the occurrence in a large box of an excessive fraction of sites that get…
This is the second of two papers devoted to the proof of conformal invariance of the critical double random current on the square lattice. More precisely, we show convergence of loop ensembles obtained by taking the cluster boundaries in…
Intermittent dynamics is characterized by long periods of different types of dynamical characteristics, for instance almost periodic dynamics alternated by chaotic dynamics. Critical intermittency is intermittent dynamics that can occur in…
The existence (or not) of infinite clusters is explored for two stochastic models of intersecting line segments in $d \ge 2$ dimensions. Salient features of the phase diagram are established in each case. The models are based on site…
We consider the cardinality of supercritical oriented bond percolation in two dimensions. We show that, whenever the origin is conditioned to percolate, the process appropriately normalized converges asymptotically in distribution to the…
The spatial coverage produced by a single discrete-time random walk, with asymmetric jump probability $p\neq 1/2$ and non-uniform steps, moving on an infinite one-dimensional lattice is investigated. Analytical calculations are complemented…
We study the distribution of dynamical quantities in various one-dimensional, disordered models the critical behavior of which is described by an infinite randomness fixed point. In the {\it disordered contact process}, the quenched…
This paper is a sequel to Chaika and Krishnan [arXiv:1612.00434]. We again consider translation invariant measures on families of nearest-neighbor semi-infinite walks on the integer lattice Z^d. We assume that once walks meet, they…
We provide an explicit algorithm for sampling a uniform simple connected random graph with a given degree sequence. By products of this central result include: (i) continuum scaling limits of uniform simple connected graphs with given…
Entanglement entropies have revealed, in the last years, to be a powerful tool to extract information about the physics of condensed-matter systems. In the first part of this thesis, we show how to extract essential details about the…
A transient stochastic process is considered strongly transient if conditioned on returning to the starting location, the expected time it takes to return the the starting location is finite. We characterize strong transience for a…