Related papers: Loop-erased walks and random matrices
Okada and Stembridge's Pfaffian formula for the enumeration of families of nonintersecting paths with fixed starting points and unfixed ending points has been widely used to resolve many challenging problems in enumerative combinatorics. In…
We consider random partitions of the vertex set of a given finite graph that can be sampled by means of loop-erased random walks stopped at a random exponential time of parameter $q>0$. The related random blocks tend to cluster nodes…
Excursion reflected Brownian motion (ERBM) is a strong Markov process defined in a finitely connected domain $D \subset \C$ that behaves like a Brownian motion away from the boundary of $D$ and picks a point according to harmonic measure…
We introduce and study a noncommutative two-parameter family of noncommutative Brownian motions in the free Fock space. They are associated with Kesten laws and give a continuous interpolation between Brownian motions in free probability…
We consider certain questions pertaining to noncommutative generalized Brownian motions with multiple processes. We establish a framework for generalized Brownian motion with multiple processes similar to that defined by Guta and prove…
We study the asymptotic distribution of random walks on $\mathbb Z^d$ ($d\ge1$) in deterministic reversible environments defined by an assignment of a positive conductance to each edge of $\mathbb Z^d$. We identify a deterministic set of…
Interacting particle systems can often be constructed from a graphical representation, by applying local maps at the times of associated Poisson processes. This leads to a natural coupling of systems started in different initial states. We…
We prove a general noncommutative law of large numbers. This applies in particular to random walks on any locally finite homogeneous graph, as well as to Brownian motion on Riemannian manifolds which admit a compact quotient. It also…
Consider $a$ particles performing simple, symmetric, non-intersecting random walks, starting at points $2(j-1)$, $1\le j\le a$ at time 0 and ending at $2(j-1)+c-b$ at time $b+c$. This can also be interpreted as a random rhombus tiling of an…
A free non-relativistic particle moving in two dimensions on a half-plane can be described by self-adjoint Hamiltonians characterized by boundary conditions imposed on the systems. The most general boundary condition is parameterized in…
Cubical complexes are metric spaces constructed by gluing together unit cubes in an analogous way to the construction of simplicial complexes. We construct Brownian motion on such spaces, define random walks, and prove that the transition…
Excursion reflected Brownian motion (ERBM) is a strong Markov process defined in a finitely connected domain $D \subset \mathbb{C}$ that behaves like a Brownian motion away from the boundary of $D$ and picks a point according to harmonic…
We study an exactly solvable random walk model with long-range memory on arbitrary networks. The walker performs unbiased random steps to nearest-neighbor nodes and intermittently resets to previously visited nodes in a preferential way,…
We study random walks on the integers driven by a sample of time-dependent nearest-neighbor conductances that are bounded but are permitted to vanish over time intervals of positive Lebesgue-length. Assuming only ergodicity of the…
A noncolliding diffusion process is a conditional process of $N$ independent one-dimensional diffusion processes such that the particles never collide with each other. This process realizes an interacting particle system with long-ranged…
We use a random walk in the ensemble of impurity configurations to generate a Brownian motion model for energy levels in disordered conductors. Treating arc-length along the random walk as fictitous time, the resulting Langevin equation…
Vicious Brownian motion is a diffusion scaling limit of Fisher's vicious walk model, which is a system of Brownian particles in one dimension such that if two of them meet they kill each other. We consider the vicious Brownian motion…
Let $\xi$ n , n $\in$ N be a sequence of i.i.d. random variables with values in Z. The associated random walk on Z is S(n) = $\xi$ 1 + $\times$ $\times$ $\times$ + $\xi$ n+1 and the corresponding "reflected walk" on N 0 is the Markov chain…
We consider the use of random walks as an approach to obtain connection coefficients for higher-order Bernoulli and Euler polynomials. In particular, we consider the cases of a $1$-dimensional linear reflected Brownian motion and of a…
We investigate a special case of infinite urn schemes first considered by Karlin (1967), especially its occupancy and odd-occupancy processes. We first propose a natural randomization of these two processes and their decompositions. We then…