Related papers: Intersection exponents for biased random walks on …
We consider biased random walks in a one-dimensional percolation model. This model goes back to Axelson-Fisk and H\"aggstr\"om and exhibits the same phase transition as biased random walk on the infinite cluster of supercritical Bernoulli…
Conditions are provided under which an endomorphism on quasisymmetric functions gives rise to a left random walk on the descent algebra which is also a lumping of a left random walk on permutations. Spectral results are also obtained.…
The extremes of a stationary time series typically occur in clusters. A primary measure for this phenomenon is the extremal index, representing the reciprocal of the expected cluster size. Both a disjoint and a sliding blocks estimator for…
We consider the simple random walk on Z^d evolving in a potential of independent and identically distributed random variables taking values in [0, + \infty]. We give optimal conditions for the existence of the quenched point-to-point…
This article shows how coupled Markov chains that meet exactly after a random number of iterations can be used to generate unbiased estimators of the solutions of the Poisson equation. Through this connection, we re-derive known unbiased…
In this paper we complete the analysis begun by two of the authors in a previous work on the discrete quantum walk on the line [J. Phys. A 36:8775-8795 (2003) quant-ph/0303105 ]. We obtain uniformly convergent asymptotics for the…
Random walks on expanders play a crucial role in Markov Chain Monte Carlo algorithms, derandomization, graph theory, and distributed computing. A desirable property is that they are rapidly mixing, which is equivalent to having a spectral…
We investigate reflected random walks in the quarter plane, with particular emphasis on the time spent along the reflection boundary axes. Assuming the drift of the random walk lies within the cone, the local time converges -- without the…
Extreme value functionals of stochastic processes are inverse functionals of the first passage time -- a connection that renders their probability distribution functions equivalent. Here, we deepen this link and establish a framework for…
We show that the hitting time of the discrete time quantum random walk on the n-bit hypercube from one corner to its opposite is polynomial in n. This gives the first exponential quantum-classical gap in the hitting time of discrete quantum…
We study the behaviour of a sequence of biased random walks X(i), i>=0 on a sequence of random graphs, where the initial graph is Zd and otherwise the graph for the i-th walk is the trace of the (i - 1)-st walk. The sequence of bias vectors…
Motivated by random walks on subsets of the hypercube, we prove two discrete functional inequalities on the hypercube. First, we give a short, elementary proof of the Poincar\'e inequality on increasing subsets of the cube recently…
In a recent paper, K. Raschel and R. Garbit proved that the exponential decreasing rate of the probability that a random walk (with all exponential moments) stays in a $d$-dimensional orthant is given by the minimum on this orthant of the…
Let X be a smooth subvariety of CP^N. We study a flow, called balancing flow, on the space of projectively equivalent embeddings of X, which attempts to deform the given embedding into a balanced one. If L->X is an ample line bundle,…
We consider the simple random walk in i.i.d. nonnegative potentials on the $d$-dimensional cubic lattice $\mathbb{Z}^d$ ($d \geq 1$). In this model, the so-called Lyapunov exponent describes the cost of traveling for the simple random walk…
We prove a complete class theorem that characterizes \emph{all} stationary time reversible Markov processes whose finite dimensional marginal distributions (of all orders) are infinitely divisible. Aside from two degenerate cases (iid and…
Pesin's identity provides a profound connection between entropy $h_{KS}$ (statistical mechanics) and the Lyapunov exponent $\lambda$ (chaos theory). It is well known that many systems exhibit sub-exponential separation of nearby…
We consider random walks on the infinite cluster of a conditional bond percolation model on the infinite ladder graph. In a companion paper, we have shown that if the random walk is pulled to the right by a positive bias $\lambda > 0$, then…
We derive a quenched invariance principle for random walks in random environments whose transition probabilities are defined in terms of weighted cycles of bounded length. To this end, we adapt the proof for random walks among random…
We show connection between Dyck paths with peaks of bounded height and random walks. The correspondence between a certain class of random walks and such Dyck paths allows us to develop a probabilistic perspective on Chebyshev polynomials.