English
Related papers

Related papers: Poisson approximation for non-backtracking random …

200 papers

Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…

Probability · Mathematics 2018-10-09 Ruojun Huang

The quantum walk dynamics obey the laws of quantum mechanics with an extra locality constraint, which demands that the evolution operator is local in the sense that the walker must visit the neighboring locations before endeavoring to…

Quantum Physics · Physics 2023-05-23 Caue F. T. Silva , Daniel Posner , Renato Portugal

We introduce the notion of a "random basic walk" on an infinite graph, give numerous examples, list potential applications, and provide detailed comparisons between the random basic walk and existing generalizations of simple random walks.…

Discrete Mathematics · Computer Science 2013-08-06 David White

We study random walks on the giant component of Hyperbolic Random Graphs (HRGs), in the regime when the degree distribution obeys a power law with exponent in the range $(2,3)$. In particular, we first focus on the expected time for a…

Probability · Mathematics 2026-02-10 Marcos Kiwi , Markus Schepers , John Sylvester

We study random walk on complex networks with transition probabilities which depend on the current and previously visited nodes. By using an absorbing Markov chain we derive an exact expression for the mean first passage time between pairs…

Physics and Society · Physics 2024-11-14 Lasko Basnarkov , Miroslav Mirchev , Ljupco Kocarev

We describe a model for $m$ vertex reinforced interacting random walks on complete graphs with $d\geq 2$ vertices. The transition probability of a random walk to a given vertex depends exponentially on the proportion of visits made by all…

Probability · Mathematics 2022-03-22 Benito Pires , Fernando P. A. Prado , Rafael A. Rosales

We study regular graphs in which the random walks starting from a positive fraction of vertices have small mixing time. We prove that any such graph is virtually an expander and has no small separator. This answers a question of Pak [SODA,…

Combinatorics · Mathematics 2024-02-09 Debsoumya Chakraborti , Jaehoon Kim , Jinha Kim , Minki Kim , Hong Liu

We consider two random walks evolving synchronously on a random out-regular graph of $n$ vertices with bounded out-degree $r\ge 2$, also known as a random Deterministic Finite Automaton (DFA). We show that, with high probability with…

Probability · Mathematics 2023-11-30 Matteo Quattropani , Federico Sau

The first passage statistics of a continuous time random walker with Poisson distributed jumps on one and two dimensional infinite lattices is investigated. An exact expression for the probability of first return to the origin in one…

Statistical Mechanics · Physics 2022-06-13 Stephy Jose

In this article it is shown that the Brownian motion on the continuum random tree is the scaling limit of the simple random walks on any family of discrete $n$-vertex ordered graph trees whose search-depth functions converge to the Brownian…

Probability · Mathematics 2012-10-24 David Croydon

We present analytical results for the distribution of first-passage (FP) times of random walks (RWs) on random regular graphs that consist of $N$ nodes of degree $c \ge 3$. Starting from a random initial node at time $t=0$, at each time…

Statistical Mechanics · Physics 2022-11-28 Ido Tishby , Ofer Biham , Eytan Katzav

We study the entropy of the distribution of the set R_n of vertices visited by a simple random walk on a graph with bounded degrees in its first n steps. It is shown that this quantity grows linearly in the expected size of R_n if the graph…

Probability · Mathematics 2010-07-13 David Windisch

We treat a quantum walk model with in- and out- flows at every time step from the outside. We show that this quantum walk can find the marked vertex of the complete graph with a high probability in the stationary state. In exchange of the…

Mathematical Physics · Physics 2022-07-22 Yusuke Higuchi , Mohamed Sabri , Etsuo Segawa

For any given vertices $u$ and $v$ in a graph, the hitting time of a random walk on a finite graph is the number of steps it takes for a random walk to reach vertex $v$ starting at vertex $u$. The expected value of the hitting time is the…

Combinatorics · Mathematics 2026-05-13 Aida Abiad , Yusaku Nishimura

We investigate the first passage statistics of active continuous time random walks with Poissonian waiting time distribution on a one dimensional infinite lattice and a two dimensional infinite square lattice. We study the small and large…

Statistical Mechanics · Physics 2024-02-27 Stephy Jose

We prove an upper bound for the $\varepsilon$-mixing time of the symmetric exclusion process on any graph G, with any feasible number of particles. Our estimate is proportional to $\mathsf{T}_{\mathsf{RW}(G)}\ln(|V|/\varepsilon)$, where |V|…

Probability · Mathematics 2013-03-18 Roberto Imbuzeiro Oliveira

Convergence of order $O(1/\sqrt{n})$ is obtained for the distance in total variation between the Poisson distribution and the distribution of the number of fixed size cycles in generalized random graphs with random vertex weights. The…

Probability · Mathematics 2024-05-31 Sergey G. Bobkov , Maria A. Danshina , Vladimir V. Ulyanov

The $N$-step random walk, elongated in the vicinity of a disc (in 2D) or a sphere (in 3D) of radius $R$, demonstrates a non-algebraic stretched exponential decay $P_N\sim \exp\left(-{\rm const}\, N^{1/3}\right)$ for the first return…

Statistical Mechanics · Physics 2026-01-06 Daniil Fedotov , Sergei Nechaev

We study a model of multi-excited random walk with non-nearest neighbour steps on $\mathbb Z$, in which the walk can jump from a vertex $x$ to either $x+1$ or $x-i$ with $i\in \{1,2,\dots,L\}$, $L\ge 1$. We first point out the multi-type…

Probability · Mathematics 2022-05-12 Tuan-Minh Nguyen

We are interested in the biased random walk on a supercritical Galton--Watson tree in the sense of Lyons, Pemantle and Peres, and study a phenomenon of slow movement. In order to observe such a slow movement, the bias needs to be random;…

Probability · Mathematics 2015-03-13 Gabriel Faraud , Yueyun Hu , Zhan Shi
‹ Prev 1 3 4 5 6 7 10 Next ›