Related papers: Mixing time of PageRank surfers on sparse random d…

Mixing of finite time-homogeneous Markov chains is well understood nowadays, with a rich set of techniques to estimate their mixing time. In this paper, we study the mixing time of random walks in dynamic random environments. To that end,…

We solve a model of sluggish stochastic motion in which a Brownian particle diffuses with a diffusion coefficient that decays algebraically with the distance to the origin, as $|x|^{-\alpha}$. Additionally, the particle resets with a…

We study analytically the order statistics of a time series generated by the successive positions of a symmetric random walk of n steps with step lengths of finite variance \sigma^2. We show that the statistics of the gap d_{k,n}=M_{k,n}…

In [4], we examined the use of coupling to obtain bounds on the mixing time of statistics on Markov chains. In the present paper, we consider the same general problem, but using strong stationary times rather than coupling. We discuss…

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…

We give refined estimates for the discrete time and continuous time versions of some basic random walks on the symmetric and alternating groups $S_n$ and $A_n$. We consider the following models: random transposition, transpose top with…

We analyze maximum entropy random graph ensembles with constrained degrees, drawn from arbitrary degree distributions, and a tuneable number of 3-loops (triangles). We find that such ensembles generally exhibit two transitions, a clustering…

Recently, random walks on dynamic graphs have been studied because of their adaptivity to the time-varying structure of real-world networks. In general, there is a tremendous gap between static and dynamic graph settings for the lazy simple…

Consider the random Cayley graph of a finite group $G$ with respect to $k$ generators chosen uniformly at random, with $1 \ll \log k \ll \log |G|$ (ie $1 \ll k = |G|^{o(1)}$). A conjecture of Aldous and Diaconis (1985) asserts, for…

We present a general approach to study the flooding time (a measure of how fast information spreads) in dynamic graphs (graphs whose topology changes with time according to a random process). We consider arbitrary converging Markovian…

The main paradigm of smoothed analysis on graphs suggests that for any large graph $G$ in a certain class of graphs, perturbing slightly the edges of $G$ at random (usually adding few random edges to $G$) typically results in a graph having…

We study a natural random walk over the upper triangular matrices, with entries in the field $\Z_2$, generated by steps which add row $i+1$ to row $i$. We show that the mixing time of the lazy random walk is $O(n^2)$ which is optimal up to…

We initiate the study of property testing in arbitrary planar graphs. We prove that bipartiteness can be tested in constant time, improving on the previous bound of $\tilde{O}(\sqrt{n})$ for graphs on $n$ vertices. The constant-time…

Families of symmetric simple random walks on Cayley graphs of Abelian groups with a bound on the number of generators are shown to never have sharp cut off in the sense of [1], [3], or [5]. Here convergence to the stationary distribution is…

Mixing properties of discrete-time quantum walks on two-dimensional grids with torus-like boundary conditions are analyzed, focusing on their connection to the complexity of the corresponding abstract search algorithm. In particular, an…

Random walks are used for modeling various dynamics in, for example, physical, biological, and social contexts. Furthermore, their characteristics provide us with useful information on the phase transition and critical phenomena of even…

This article introduces a model for interacting vertex-reinforced random walks, each taking values on a complete sub-graph of a locally finite undirected graph. The transition probability for a walk to a given vertex depends on the…

Sampling uniform simple graphs with power-law degree distributions with degree exponent $\tau\in(2,3)$ is a non-trivial problem. We propose a method to sample uniform simple graphs that uses a constrained version of the configuration model…

Given a connected graph $G$ with some subset of its vertices excited and a fixed target vertex, in the geodesic-biased random walk on $G$, a random walker moves as follows: from an unexcited vertex, she moves to a uniformly random…

For a discrete time quantum walk (QW) on the $N$-cycle, allowing for decoherence on the coin, we derive a number of new results, including an explicit formula for the position probability distribution. For a QW of this type, we show that…