Related papers: Green functions and Martin compactification for ki…
In this paper, a new proof of the Positive Mass Theorem is established through a newly discovered monotonicity formula, holding along the level sets of the Green's function of an asymptotically flat $3$-manifold. In the same context and for…
This paper is concerned with the continuous-time quantum walk on Z, Z^d, and infinite homogeneous trees. By using the generating function method, we compute the limit of the average probability distribution for the general isotropic walk on…
We study the occupation measure of various sets for a symmetric transient random walk in $Z^d$ with finite variances. Let $\mu^X_n(A)$ denote the occupation time of the set $A$ up to time $n$. It is shown that $\sup_{x\in…
We compute the generating function of random planar quadrangulations with three marked vertices at prescribed pairwise distances. In the scaling limit of large quadrangulations, this discrete three-point function converges to a simple…
We define quantization scheme for discrete-time random walks on the half-line consistent with Szegedy's quantization of finite Markov chains. Motivated by the Karlin and McGregor description of discrete-time random walks in terms of…
We prove that if $(X_n)_{n\geq 0}$ is a random walk on a transient graph such that the Green's function decays at least polynomially along the random walk, then $(X_n)_{n\geq 0}$ has infinitely many cut times almost surely. This condition…
Transport in biological systems often occurs in complex spatial environments involving random structures. Motivated by such applications, we investigate an idealised model for solute transport past an array of point sinks, randomly…
In this paper we establish an exact relationship between the asymptotic probability distributions $\nu_0$ and $\nu_2$ of the multiple point range of the planar random walk and the proper functions $\Gamma^{[0]}$ and $\Gamma^{[2]}$…
The number of steps until termination of a probabilistic program is a random variable. Probabilistic program termination therefore requires qualitative analysis via almost-sure termination (AST), while also providing quantitative answers…
In operator algebra, the linearization trick is a technique that reduces the study of a non-commutative polynomial evaluated at elements of an algebra A to the study of a polynomial of degree one, evaluated on the enlarged algebra A x M r…
We consider random walks on marked simple point processes with symmetric jump rates and unbounded jump range. We prove homogenization properties of the associated Markov generators. As an application, we derive the hydrodynamic limit of the…
We study coined Random Quantum Walks on the hexagonal lattice, where the strength of disorder is monitored by the coin matrix. Each lattice site is equipped with an i.i.d. random variable that is uniformly distributed on the torus and acts…
We provide a decomposition of the trace of the Brownian motion into a simple path and an independent Brownian soup of loops that intersect the simple path. More precisely, we prove that any subsequential scaling limit of the loop erased…
We establish a local Harnack inequality in a neighborhood of an indecomposable singular point of a stationary integral varifold. Extending the method of Gr\"uter and Widman \cite{gruter1982green}, we construct the Green function on a…
We consider random walks on the support of a random purely atomic measure on $\mathbb{R}^d$ with random jump probability rates. The jump range can be unbounded. The purely atomic measure is reversible for the random walk and stationary for…
By introducing a new measure for the infinite Galton-Watson process and providing estimates for (discrete) Green's functions on trees, we establish the asymptotic behavior of the capacity of critical branching random walks: in high…
We consider the totally asymmetric simple exclusion process (TASEP) in discrete time with the sublattice parallel dynamics describing particles moving to the right on the one-dimensional infinite chain with equal hoping probabilities. Using…
A constructive proof is given to the fact that any ergodic Markov chain can be realized as a random walk subject to a synchronizing road coloring. Redundancy (ratio of extra entropy) in such a realization is also studied.
We construct the conditional version of $k$ independent and identically distributed random walks on $\R$ given that they stay in strict order at all times. This is a generalisation of so-called non-colliding or non-intersecting random…
We consider the discrete time quantum random walks on a Sierpinski gasket. We study the hitting probability as the level of fractal goes to infinity in terms of their localization exponents $\beta_w$ , total variation exponents $\delta_w$…