English
Related papers

Related papers: Exceptional Times for the Dynamical Discrete Web

200 papers

In \cite{SzT}, D. Sz\'asz and A. Telcs have shown that for the diffusively scaled, simple symmetric random walk, weak convergence to the Brownian motion holds even in the case of local impurities if $d \ge 2$. The extension of their result…

Probability · Mathematics 2015-05-20 Daniel Paulin , Domokos Szász

We consider a random walk in an i.i.d. random environment on Zd and study properties of its large deviation rate function at the origin. It was proved by Comets, Gantert and Zeitouni in dimension d = 1 in 1999 and later by Varadhan in…

Probability · Mathematics 2024-11-22 Alexander Drewitz , Alejandro F. Ramírez , Santiago Saglietti , Zhicheng Zheng

We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…

Probability · Mathematics 2019-03-05 Thomas Sauerwald , Luca Zanetti

We introduce the Peierls substitution to a two-dimensional discrete-time quantum walk on a square lattice to examine the spreading dynamics and the coin-position entanglement in the presence of an artificial gauge field. We use the ratio of…

Quantum Physics · Physics 2015-10-28 İ. Yalçınkaya , Z. Gedik

We study downward deviations of the maximum local time of the discrete-time simple random walk on $\mathbb{Z}^d$, $d\ge 3$. In our previous paper \cite{li2026ldmaxlocal}, the corresponding upper bound was established, while the matching…

Probability · Mathematics 2026-05-26 Xinyi Li , Yushu Zheng

Higher order random walks (HD-walks) on high dimensional expanders (HDX) have seen an incredible amount of study and application since their introduction by Kaufman and Mass [KM16], yet their broader combinatorial and spectral properties…

Computational Complexity · Computer Science 2021-07-20 Mitali Bafna , Max Hopkins , Tali Kaufman , Shachar Lovett

The characterization of the "most connected" nodes in static or slowly evolving complex networks has helped in understanding and predicting the behavior of social, biological, and technological networked systems, including their robustness…

Physics and Society · Physics 2010-10-21 Scott A. Hill , Dan Braha

A discrete time quantum walker is considered in one dimension, where at each step, the translation can be more than one unit length chosen randomly. In the simplest case, the probability that the distance travelled is $\ell$ is taken as…

Quantum Physics · Physics 2018-10-17 Parongama Sen

A new family of discrete-time quantum walks (DTQWs) on the line with an exact discrete $U(N)$ gauge invariance is introduced. It is shown that the continuous limit of these DTQWs, when it exists, coincides with the dynamics of a Dirac…

Quantum Physics · Physics 2025-02-28 Pablo Arnault , Giuseppe Di Molfetta , Marc Brachet , Fabrice Debbasch

A discrete-time quantum walk (QW) is essentially a unitary operator driving the evolution of a single particle on the lattice. Some QWs have familiar physics PDEs as their continuum limit. Some slight generalization of them (allowing for…

Quantum Physics · Physics 2018-08-22 Pablo Arrighi , Giuseppe Di Molfetta , Stefano Facchini

Quantum random walks are shown to have non-intuitive dynamics which makes them an attractive area of study for devising quantum algorithms for long-standing open problems as well as those arising in the field of quantum computing. In the…

Quantum Physics · Physics 2009-11-13 K. Manouchehri , J. B. Wang

We consider a model of a random height function with long-range constraints on a discrete segment. This model was suggested by Benjamini, Yadin and Yehudayoff and is a generalization of simple random walk. The random function is uniformly…

Probability · Mathematics 2017-03-14 Ron Peled , Yinon Spinka

How does removal of sites by a random walk lead to blockage of percolation? To study this problem of correlated site percolation, we consider a random walk (RW) of $N=uL^d$ steps on a $d$-dimensional hypercubic lattice of size $L^d$ (with…

Statistical Mechanics · Physics 2019-08-22 Yacov Kantor , Mehran Kardar

We study a symmetric random walk (RW) in one spatial dimension in environment, formed by several zones of finite width, where the probability of transition between two neighboring points and corresponding diffusion coefficient are…

Statistical Mechanics · Physics 2017-04-03 A. V. Nazarenko , V. Blavatska

In a recent Letter Ciftci and Cakmak [EPL 87, 60003 (2009)] showed that the two dimensional random walk in a bounded domain, where walkers which cross the boundary return to a base curve near origin with deterministic rules, can produce…

Statistical Mechanics · Physics 2010-09-03 Mahashweta Basu , P. K. Mohanty

We consider the problem of performing a random walk in a distributed network. Given bandwidth constraints, the goal of the problem is to minimize the number of rounds required to obtain a random walk sample. Das Sarma et al. [PODC'10] show…

Distributed, Parallel, and Cluster Computing · Computer Science 2011-10-18 Danupon Nanongkai , Atish Das Sarma , Gopal Pandurangan

We consider a discrete-time branching random walk in the boundary case, where the associated random walk is in the domain of attraction of an $\alpha$-stable law with $1<\alpha<2$. We prove that the derivative martingale $D_n$ converges to…

Probability · Mathematics 2016-10-13 Hui He , Jingning Liu , Mei Zhang

A discrete-time Quantum Walk (QW) is essentially a unitary operator driving the evolution of a single particle on the lattice. Some QWs admit a continuum limit, leading to familiar PDEs (e.g. the Dirac equation). In this paper, we study the…

Quantum Physics · Physics 2016-04-29 Pablo Arrighi , Stefano Facchini , Marcelo Forets

We study random walks on the integers driven by a sample of time-dependent nearest-neighbor conductances that are bounded but are permitted to vanish over time intervals of positive Lebesgue-length. Assuming only ergodicity of the…

Probability · Mathematics 2024-03-05 Marek Biskup , Minghao Pan

We consider three kinds of discrete-time arrival processes: transient, intermediate and recurrent, characterized by a finite, possibly finite and infinite number of events, respectively. In this context, we study renewal processes which are…

‹ Prev 1 4 5 6 7 8 10 Next ›