Related papers: Tightness for interlacing geometric random walk br…
We study line ensembles arising naturally in symmetrized/half-space geometric last passage percolation (LPP) on the $N \times N$ square. The weights of the model are geometrically distributed with parameter $q^2$ off the diagonal and $cq$…
We study certain self-interacting walks on the set of integers, that choose to jump to the right or to the left randomly but influenced by the number of times they have previously jumped along the edges in the finite neighbourhood of their…
Arratia, and later T\'oth and Werner, constructed random processes that formally correspond to coalescing one-dimensional Brownian motions starting from every space-time point. We extend their work by constructing and characterizing what we…
We give conditions for the exactness of Rokhlin endomorphisms, apply these to random walks on locally compact, second countable topological groups and obtain that the action on the Poisson boundary of an adapted random walk on such a group…
Restrictions to molecular motion by barriers (membranes) are ubiquitous in biological tissues, porous media and composite materials. A major challenge is to characterize the microstructure of a material or an organism nondestructively using…
Families of symmetric simple random walks on Cayley graphs of Abelian groups with a bound on the number of generators are shown to never have sharp cut off in the sense of [1], [3], or [5]. Here convergence to the stationary distribution is…
We show that the edges crossed by a random walk in a network form a recurrent graph a.s. In fact, the same is true when those edges are weighted by the number of crossings.
We introduce a family of complex-valued edge weights on a finite simple graph $\G$ arising from a continuous-time quantum walk on the line graph $\ell\G$, packaged as the \emph{Schur state}: an $n \times n$ Hermitian matrix encoding the…
In this paper, we study a variation of a conjecture of Debarre on positivity of cotangent bundles of complete intersections. We establish the ampleness of Schur powers of cotangent bundles of generic complete intersections in projective…
We consider certain noncolliding interacting particle systems driven by Brownian noise. A key example is drifted Brownian motions conditioned not to intersect and related models of eigenvalues of Hermitian random matrices. We establish…
We establish recurrence and transience criteria for critical branching processes in random environment with immigration. These results are then applied to discuss recurrence and transience of a recurrent random walk in a random environment…
We study an approximation by time-discretized geodesic random walks of a diffusion process associated with a family of time-dependent metrics on manifolds. The condition we assume on the metrics is a natural time-inhomogeneous extension of…
We prove strong invariance principle between a transient Bessel process and a certain nearest neighbor (NN) random walk that is constructed from the former by using stopping times. It is also shown that their local times are close enough to…
Coalescing simple random walks in the plane form an infinite tree. A natural directed distance on this tree is given by the number of jumps between branches when one is only allowed to move in one direction. The Brownian web distance is the…
Consider a family of random ordered graph trees $(T_n)_{n\geq 1}$, where $T_n$ has $n$ vertices. It has previously been established that if the associated search-depth processes converge to the normalised Brownian excursion when rescaled…
We define the Ricci curvature of Markov chains on metric spaces as a local contraction coefficient of the random walk acting on the space of probability measures equipped with a Wasserstein transportation distance. For Brownian motion on a…
We show that there is an hierarchy of intersection rigidity properties of sets in a closed symplectic manifold: some sets cannot be displaced by symplectomorphisms from more sets than the others. We also find new examples of rigidity of…
For $d\ge 3$ we construct a new coupling of the trace left by a random walk on a large $d$-dimensional discrete torus with the random interlacements on $\mathbb Z^d$. This coupling has the advantage of working up to macroscopic subsets of…
A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…
We introduce a new self-interacting random walk on the integers in a dynamic random environment and show that it converges to a pure diffusion in the scaling limit. We also find a lower bound on the diffusion coefficient in some special…