Related papers: Elementary potential theory on the hypercube

We consider a semiclassical random walk with respect to a probability measure associated to a potential with a finite number of critical points. We recover the spectral results from [1] on the corresponding operator in a more general…

Let $G$ be a real Lie group, $\Lambda<G$ a lattice and $H<G$ a connected semisimple subgroup without compact factors and with finite center. We define the notion of $H$-expanding measures $\mu$ on $H$ and, applying recent work of…

We devise a protocol to build 1D time-dependent quantum walks in 1D maximizing the spatial spread throughout the procedure. We allow only one of the physical parameters of the coin-tossing operator to vary, i.e. the angle $\theta$, such…

We propose a general framework for quantum walks on d-dimensional spaces. We investigate asymptotic behavior of these walks. Among them, existence of limit distribution of homogeneous walks is proved. In this theorem, the support of the…

In this note, we study the potential algebra for several models arising out of quantum mechanics with generalized uncertainty principle. We first show that the eigenvalue equation corresponding to the momentum-space Hamiltonian…

The paper is concerned with a new approach for the recurrence property of the oscillating process on $\mathbb{Z}$ in Kemperman's sense. In the case when the random walk is ascending on $\mathbb{Z}^-$ and descending on $\mathbb{Z}^+$, we…

We discuss general one and two-loops banana diagrams with arbitrary masses on the de Sitter spacetime by using direct methods of dS quantum field theory in the dimensional regularization approach. In the one-loop case we also compute the…

Consider a branching random walk in which the offspring distribution and the moving law both depend on an independent and identically distributed random environment indexed by the time.For the normalised counting measure of the number of…

Hitting times provide a fundamental measure of distance in random processes, quantifying the expected number of steps for a random walk starting at node $u$ to reach node $v$. They have broad applications across domains such as network…

We define a dynamical simple symmetric random walk in one dimension, and show that there almost surely exist exceptional times at which the walk tends to infinity. This is in contrast to the usual dynamical simple symmetric random walk in…

We investigate the behavior of weak localization, conductance fluctuations, and shot noise of a chaotic scatterer in the semiclassical limit. Time resolved numerical results, obtained by truncating the time-evolution of a kicked quantum map…

An important goal in algorithm design is determining the best running time for solving a problem (approximately). For some problems, we know the optimal running time, assuming certain conditional lower bounds. In this work, we study the…

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 study Lam's reduced random walk in a hyperbolic triangle group, which we view as a random walk in the upper half-plane. We prove that this walk converges almost surely to a point on the extended real line. We devote special attention to…

We consider a variant of random walks on finite groups. At each step, we choose an element from a set of generators ("directions") uniformly, and an integer from a power law ("speed") distribution associated with the chosen direction. We…

In this paper we consider the simple random walk on $\mathbb{Z}^d$, $d \geq 3$, conditioned to stay in a large domain $D_N$ of typical diameter $N$. Considering the range up to time $t_N \geq N^{2+\delta}$ for some $\delta > 0$, we…

We establish a general framework to study the rate of convergence of a Euler type approximation scheme with decreasing time steps to the invariant measure, for a general class of stochastic systems. The error is measured in general…

We consider the persistent exclusion process in which a set of persistent random walkers interact via hard-core exclusion on a hypercubic lattice in $d$ dimensions. We work within the ballistic regime whereby particles continue to hop in…

Classical random walks on finite graphs have an underrated property: a walk from any vertex can reach every other vertex in finite time, provided they are connected. Discrete-time quantum walks on finite connected graphs however, can have…

Consider the invariance principle for a random walk with random environment (denoted by $\mu$) in time on $\bfR$ in a weak quenched sense. We show that a sequence of the random probability measures on $\bfR$ generated by a bounded Lipschitz…