English
Related papers

Related papers: Directed random walk on the backbone of an oriente…

200 papers

We consider a class of discrete-time random walks with directed unit steps on the integer line. The direction of the steps is reversed at the time instants of events in a discrete-time renewal process and is maintained at uneventful time…

Probability · Mathematics 2023-01-04 Thomas M. Michelitsch , Federico Polito , Alejandro P. Riascos

Quantum walks on graphs can model physical processes and serve as efficient tools in quantum information theory. Once we admit random variations in the connectivity of the underlying graph, we arrive at the problem of percolation, where the…

Quantum Physics · Physics 2014-02-12 Bálint Kollár , Jaroslav Novotný , Tamás Kiss , Igor Jex

Let T be a rooted supercritical multi-type Galton-Watson (MGW) tree with types coming from a finite alphabet, conditioned to non-extinction. The lambda-biased random walk (X_t, t>=0) on T is the nearest-neighbor random walk which, when at a…

Probability · Mathematics 2012-05-08 Amir Dembo , Nike Sun

We derive an annealed large deviation principle (LDP) for the normalised and rescaled local times of a continuous-time random walk among random conductances (RWRC) in a time-dependent, growing box in $\Z^d$. We work in the interesting case…

Probability · Mathematics 2013-08-22 Wolfgang König , Tilman Wolff

We prove error bounds in a central limit theorem for solutions of certain convolution equations. The main motivation for investigating these equations stems from applications to lace expansions, in particular to weakly self-avoiding random…

Probability · Mathematics 2014-04-11 Luca Avena , Erwin Bolthausen , Christine Ritzmann

First, we prove a \emph{local almost sure central limit theorem} for lattice random walks in the plane. The corresponding version for random walks in the line was considered by the author in \cite{5}. This gives us a quantitative version of…

Probability · Mathematics 2014-05-13 Nuno Luzia

This thesis examines linearly edge-reinforced random walks on infinite trees. In particular, recurrence and transience of such random walks on general (fixed) trees as well as on Galton-Watson trees (i.e. random trees) is characterized, and…

Probability · Mathematics 2023-09-01 Fabian Michel

We consider self-avoiding walk on a tree with random conductances. It is proven that in the weak disorder regime, the quenched critical point is equal to the annealed one, and that in the strong disorder regime, these critical points are…

Probability · Mathematics 2016-08-24 Yuki Chino

We base ourselves on the construction of the two-dimensional random interlacements [12] to define the one-dimensional version of the process. For this constructions we consider simple random walks conditioned on never hitting the origin,…

Probability · Mathematics 2016-08-04 Darcy Camargo , Serguei Popov

We consider the nearest-neighbor simple random walk on $\Z^d$, $d\ge2$, driven by a field of i.i.d. random nearest-neighbor conductances $\omega_{xy}\in[0,1]$. Apart from the requirement that the bonds with positive conductances percolate,…

Probability · Mathematics 2007-10-30 Marek Biskup , Timothy M. Prescott

We study the long-time behavior of the probability density associated with the decoupled continuous-time random walk which is characterized by a superheavy-tailed distribution of waiting times. It is shown that if the random walk is…

Statistical Mechanics · Physics 2011-05-02 S. I. Denisov , H. Kantz

In this article we focus on a general model of random walk on random marked trees. We prove a recurrence criterion, analogue to the recurrence criterion proved by R. Lyons and Robin Pemantle (1992) in a slightly different model. In the…

Probability · Mathematics 2011-09-02 Gabriel Faraud

We investigate percolation on a randomly directed lattice, an intermediate between standard percolation and directed percolation, focusing on the isotropic case in which bonds on opposite directions occur with the same probability. We…

Disordered Systems and Neural Networks · Physics 2018-12-19 Aurelio W. T. de Noronha , André A. Moreira , André P. Vieira , Hans J. Herrmann , José S. Andrade , Humberto A. Carmona

We consider Bernoulli bond percolation on a large scale-free tree in the supercritical regime, meaning informally that there exists a giant cluster with high probability. We obtain a weak limit theorem for the sizes of the next largest…

Probability · Mathematics 2016-03-04 Jean Bertoin , Geronimo Uribe Bravo

Unlike classical simple random walks, one-dimensional random walks in random environments (RWRE) are known to have a wide array of potential limiting distributions. Under certain assumptions, however, it is known that CLT-like limiting…

Probability · Mathematics 2017-04-12 Sung Won Ahn , Jonathon Peterson

We consider simple random walks on Delaunay triangulations generated by point processes in $\mathbb{R}^d$. Under suitable assumptions on the point processes, we show that the random walk satisfies an almost sure (or quenched) invariance…

Probability · Mathematics 2014-12-17 Arnaud Rousselle

In this article, local limit theorems for sequences of simple random walks on graphs are established. The results formulated are motivated by a variety of random graph models, and explanations are provided as to how they apply to…

Probability · Mathematics 2012-10-24 D. A. Croydon , B. M. Hambly

We establish annealed and quenched invariance principles for random walks in random conductances lifted to the p-variation rough path topology, allowing for degenerate environments and long-range jumps. Our proof is based on a unified…

Probability · Mathematics 2026-04-17 Johannes Bäumler , Noam Berger , Tal Orenshtein , Martin Slowik

We establish a quenched local central limit theorem for the dynamic random conductance model on $\mathbb{Z}^d$ only assuming ergodicity with respect to space-time shifts and a moment condition. As a key analytic ingredient we show H\"older…

Probability · Mathematics 2021-05-28 Sebastian Andres , Alberto Chiarini , Martin Slowik

We consider a continuous-time random walk on a regular tree of finite depth and study its favorite points among the leaf vertices. For the walk started from a leaf vertex and stopped upon hitting the root we prove that, in the limit as as…

Probability · Mathematics 2024-06-27 Marek Biskup , Oren Louidor