English
Related papers

Related papers: Random Walks in I.I.D. Random Environment on Cayle…

200 papers

We introduce the discrete affine group of a regular tree as a finitely generated subgroup of the affine group. We describe the Poisson boundary of random walks on it as a space of configurations. We compute isoperimetric profile and Hilbert…

Group Theory · Mathematics 2017-10-27 Jérémie Brieussel , Ryokichi Tanaka , Tianyi Zheng

We consider a recurrent random walk (RW) in random environment (RE) on a strip. We prove that if the RE is i. i. d. and its distribution is not supported by an algebraic subsurface in the space of parameters defining the RE then the RW…

Probability · Mathematics 2009-11-13 Erwin Bolthausen , Ilya Goldsheid

We give a sufficient condition for the existence of the harmonic measure from infinity of transient random walks on weighted graphs. In particular, this condition is verified by the random conductance model on $\Z^d$, $d\geq 3$, when the…

Probability · Mathematics 2012-02-16 Daniel Boivin , Clément Rau

In this paper we study continuous-time quantum walks on Cayley graphs of the symmetric group, and prove various facts concerning such walks that demonstrate significant differences from their classical analogues. In particular, we show that…

Quantum Physics · Physics 2007-05-23 Heath Gerhardt , John Watrous

In this paper, we are interested in the asymptotic behaviour of the sequence of processes $(W_n(s,t))_{s,t\in[0,1]}$ with \begin{equation*} W_n(s,t):=\sum_{k=1}^{\lfloor nt\rfloor}\big(1_{\{\xi_{S_k}\leq s\}}-s\big) \end{equation*} where…

Probability · Mathematics 2019-12-17 Nadine Guillotin-Plantard , Francoise Pene , Martin Wendler

We prove that any non-amenable Cayley graph admits a factor of IID perfect matching. We also show that any connected d-regular vertex tran- sitive graph admits a perfect matching. The two results together imply that every Cayley graph…

Combinatorics · Mathematics 2012-11-13 Endre Csoka , Gabor Lippner

The simple random walk on $\mathbb{Z}^p$ shows two drastically different behaviours depending on the value of $p$: it is recurrent when $p\in\{1,2\}$ while it escapes (with a rate increasing with $p$) as soon as $p\geq3$. This classical…

Data Structures and Algorithms · Computer Science 2023-08-22 Farah Ben Naoum , Christophe Godin , Romain Azaïs

This paper considers 1-dimensional generalized random walks in random scenery. That is, the steps of the walk are generated by an arbitrary stationary process, and also the scenery is a priori arbitrary stationary. Under an ergodicity…

Dynamical Systems · Mathematics 2007-05-23 F. M. Dekking , P. Liardet

We define and analyze random quantum walks on homogeneous trees of degree $q\geq 3$. Such walks describe the discrete time evolution of a quantum particle with internal degree of freedom in $\C^q$ hopping on the neighboring sites of the…

Mathematical Physics · Physics 2014-07-08 Eman Hamza , Alain Joye

We prove that the dimension drop phenomenon holds for the harmonic measure associated to a transient random walk in a random environment (as defined by R. Lyons and R. Pemantle in 1992 and generalized by G. Faraud in 2011) on an infinite…

Probability · Mathematics 2017-11-22 Pierre Rousselin

We study a class of nearest-neighbor discrete time integer random walks introduced by Zerner, the so called multi-excited random walks. The jump probabilities for such random walker have a drift to the right whose intensity depends on a…

Probability · Mathematics 2011-08-15 Thomas Mountford , Leandro P. R. Pimentel , Glauco Valle

A Random walk labeling of a graph $G$ is any labeling of $G$ that could have been obtained by performing a random walk on $G$. Continuing two recent works, we calculate the number of random walk labelings of perfect trees, combs, and double…

Combinatorics · Mathematics 2023-08-02 Sela Fried , Toufik Mansour

Techniques of `dynamic renormalization', developed earlier for undirected percolation and the contact model, are adapted to the setting of directed percolation, thereby obtaining solutions of several problems for directed percolation on…

Probability · Mathematics 2007-05-23 Geoffrey Grimmett , Philipp Hiemer

We prove results for random walks in dynamic random environments which do not require the strong uniform mixing assumptions present in the literature. We focus on the "environment seen from the walker"-process and in particular its…

Probability · Mathematics 2016-10-06 Stein Andreas Bethuelsen , Florian Völlering

A transient stochastic process is considered strongly transient if conditioned on returning to the starting location, the expected time it takes to return the the starting location is finite. We characterize strong transience for a…

Probability · Mathematics 2016-06-14 Jonathon Peterson

In a \emph{rotor walk} the exits from each vertex follow a prescribed periodic sequence. On an infinite Eulerian graph embedded periodically in $\R^d$, we show that any simple rotor walk, regardless of rotor mechanism or initial rotor…

Probability · Mathematics 2014-08-26 Laura Florescu , Lionel Levine , Yuval Peres

We consider a random walk on a multidimensional integer lattice with random bounds on local times, conditioned on the event that it hits a high level before its death. We introduce an auxiliary "core" process that has a regenerative…

Probability · Mathematics 2021-05-19 Sergey Foss , Alexander Sakhanenko

We consider the Grover walk on infinite trees from the view point of spectral analysis. From the previous works, infinite regular trees provide localization. In this paper, we give the complete characterization of the eigenspace of this…

Quantum Physics · Physics 2018-02-14 Yusuke Higuchi , Etsuo Segawa

Random walks provide a simple conventional model to describe various transport processes, for example propagation of heat or diffusion of matter through a medium. However, in many practical cases the medium is highly irregular due to…

Probability · Mathematics 2019-06-10 L. V. Bogachev

We focus on recurrent random walks in random environment (RWRE) on Galton-Watson trees. The range of these walks, that is the number of sites visited at some fixed time, has been studied in three different papers [AC18], [AdR17] and [dR16].…

Probability · Mathematics 2018-12-21 Pierre Andreoletti , Roland Diel
‹ Prev 1 8 9 10 Next ›