相关论文: A path-transformation for random walks and the Rob…

Augmenting the unitary transformation which generates a quantum walk by a generalized phase gate G is a symmetry for both noisy and noiseless quantum walk on a line, in the sense that it leaves the position probability distribution…

We offer an alternative viewpoint on Dyson's original paper regarding the application of Brownian motion to random matrix theory (RMT). In particular we show how one may use the same approach in order to study the stochastic motion in the…

Let $G$ be a finite tree with root $r$ and associate to the internal vertices of $G$ a collection of transition probabilities for a simple nondegenerate Markov chain. Embedd $G$ into a graph $G^\prime$ constructed by gluing finite linear…

The involution walk is the random walk on $S_n$ generated by involutions with a binomially distributed with parameter $1-p$ number of $2$-cycles. This is a parallelization of the transposition walk. The involution walk is shown in this…

We prove structure theorems for o-minimal definable subsets $S\subset G$ of definable groups containing large multiplicative structures, and show definable groups do not have bounded torsion arbitrarily close to the identity. As an…

In O'Connell-Pei(2013) a q-weighted version of the Robinson-Schensted algorithm was introduced. In this paper we show that this algorithm has a symmetry property analogous to the well known symmetry property of the normal Robinson-Schensted…

We define two families of Poissonian soups of bidirectional trajectories on $\mathbb{Z}^2$, which can be seen to adequately describe the local picture of the trace left by a random walk on the two-dimensional torus $(\mathbb{Z}/N…

In recent years, studies have demonstrated that the grain boundary (GB) migration is a three-dimensional (3D) process, characterized by a 3D mobility tensor. In this study, we develop a 3D interface random walk theory to extract the GB…

A reinforcement algorithm introduced by H.A. Simon \cite{Simon} produces a sequence of uniform random variables with memory as follows. At each step, with a fixed probability $p\in(0,1)$, $\hat U_{n+1}$ is sampled uniformly from $\hat U_1,…

We consider a class of Gaussian Free Fields denoted by $(g_x)_{x \in {\cal V}_N}$, where $ {\cal V}_N = \{0,1\}^N$ and $N\in \mathbb{Z}_+$. These fields are related to a general class of $N$-dimensional random walks on the hypercube, which…

In this paper we present a new and flexible method to show that, in one dimension, various self-repellent random walks converge to self-repellent Brownian motion in the limit of weak interaction after appropriate space-time scaling. Our…

The conditions $(T)_\gamma,$ $\gamma \in (0,1),$ which have been introduced by Sznitman in 2002, have had a significant impact on research in random walk in random environment. Among others, these conditions entail a ballistic behaviour as…

Let G be a countable group which acts by isometries on a separable, but not necessarily proper, Gromov hyperbolic space X. We say the action of G is weakly hyperbolic if G contains two independent hyperbolic isometries. We show that a…

We introduce a method for studying monotonicity of the speed of excited random walks in high dimensions, based on a formula for the speed obtained via cut-times and Girsanov's transform. While the method gives rise to similar results as…

We propose a model of random walks on weighted graphs where the weights are interval valued, and connect it to reversible imprecise Markov chains. While the theory of imprecise Markov chains is now well established, this is a first attempt…

We study rare transitions in Markovian open quantum systems driven with Gaussian noise, applying transition path and interface sampling methods to trajectories generated by stochastic Schr\"odinger dynamics. Interface and path sampling…

This paper investigates the large deviation problem in the sample path space of the nearest-neighbor random walks on regular trees. We establish the sample path large deviation principle for the law of the distance from a nearest random…

We study the persistence exponent for the first passage time of a random walk below the trajectory of another random walk. More precisely, let $\{B_n\}$ and $\{W_n\}$ be two centered, weakly dependent random walks. We establish that…

We initiate the study of a fundamental combinatorial problem: Given a capacitated graph $G=(V,E)$, find a shortest walk ("route") from a source $s\in V$ to a destination $t\in V$ that includes all vertices specified by a set…

We consider a random walk $\{S_n\}_{n\in \mathbb{N}}$ in time-inhomogeneous random environment $\xi$. For almost each realization of $\xi$, we formulate a quenched harmonic function, based on which we can define the random walk in random…