相关论文: Discrepancy convergence for the drunkard's walk on…

Planar run-and-tumble walks with orthogonal directions of motion are considered. After formulating the problem with generic transition probabilities among the orientational states, we focus on the symmetric case, giving general expressions…

We study a 2-D disordered time-discrete quantum walk based on 1-D `generalized elephant quantum walk' where an entangling coin operator is assumed and which paves the way to a new set of properties. We show that considering a given disorder…

We study biased random walks on dynamical percolation in $\mathbb{Z}^d$, which were recently introduced by Andres et al. We provide a second order expansion for the asymptotic speed and show for $d \ge 2$ that the speed of the biased random…

In this article, we investigate the convergence behavior of two classes of gathering protocols with fixed circulant topologies using tools from dynamical systems. Given a fixed number of mobile entities moving in the Euclidean plane, we…

In this paper, we find a natural four dimensional analog of the moderate deviation results for the capacity of the random walk, which corresponds to Bass, Chen and Rosen \cite{BCR} concerning the volume of the random walk range for $d=2$.…

We study whether the probability distribution of a discrete quantum walk can get arbitrarily close to uniform, given that the walk starts with a uniform superposition of the outgoing arcs of some vertex. We establish a characterization of…

We obtain upper bounds for the rates of convergence for the simple random walk Green's function in the domains $D_\alpha = D_{\alpha}(n)=\{re^{i\theta}\in \mathbb{C}:0 <\theta<2\pi-\alpha, 0<r<2n\}-z_0,$ where $z_0\in\mathbb{Z}^2$ is a…

We prove that the Beta random walk has second order cubic fluctuations from the large deviation principle of the GUE Tracy-Widom type for arbitrary values $\upalpha>0$ and $\upbeta>0$ of the parameters of the Beta distribution, removing…

We consider a random walk on a homogeneous space $G/\Lambda$ where $G$ is a non-compact simple Lie group and $\Lambda$ is a lattice. The walk is driven by a probability measure $\mu$ on $G$ whose support generates a Zariski-dense subgroup.…

We consider random walks in a random environment that is given by i.i.d. Dirichlet distributions at each vertex of Z^d or, equivalently, oriented edge reinforced random walks on Z^d. The parameters of the distribution are a 2d-uplet of…

We study the mixing time of random walks on small-world networks modelled as follows: starting with the 2-dimensional periodic grid, each pair of vertices $\{u,v\}$ with distance $d>1$ is added as a "long-range" edge with probability…

Multifractal properties of the distribution of topological invariants for a model of trajectories randomly entangled with a nonsymmetric lattice of obstacles are investigated. Using the equivalence of the model to random walks on a locally…

We investigate the time averaged squared displacement (TASD) of continuous time random walks with respect to the number of steps $N$, which the random walker performed during the data acquisition time $T$. We prove that the TASD, and as…

Successfully achieving bipedal locomotion remains challenging due to real-world factors such as model uncertainty, random disturbances, and imperfect state estimation. In this work, we propose a novel metric for locomotive robustness -- the…

We construct a new random probability measure on the sphere and on the unit interval which in both cases has a Gibbs structure with the relative entropy functional as Hamiltonian. It satisfies a quasi-invariance formula with respect to the…

We propose random walks on suitably defined graphs as a framework for finescale modeling of particle motion in an obstructed environment where the particle may have interactions with the obstructions and the mean path length of the particle…

In this paper we study the asymptotic behavior of the Random-Walk Metropolis algorithm on probability densities with two different `scales', where most of the probability mass is distributed along certain key directions with the…

A random walk with counterbalanced steps is a process of partial sums $\check S(n)=\check X_1+ \cdots + \check X_n$ whose steps $\check X_n$ are given recursively as follows. For each $n\geq 2$, with a fixed probability $p$, $\check X_n$ is…

In this note, we compute the probability that a two-dimensional symmetric random walk visits more vertices than expected, for deviations on scales between the mean behavior and linear growth.

Quantum walks constitute a versatile platform for simulating transport phenomena on discrete graphs including topological material properties while providing a high control over the relevant parameters at the same time. To experimentally…