Related papers: Dull cut off for circulants

We resolve the long-standing problem of elucidating the cutoff phenomenon for a vast and important class of Markov processes, namely Markov diffusions with non-negative Bakry-\'Emery curvature. More precisely, we prove that any sequence of…

We study a generalization of strongly regular graphs. We call a graph strongly walk-regular if there is an $\ell >1$ such that the number of walks of length $\ell$ from a vertex to another vertex depends only on whether the two vertices are…

We study the cut-off phenomenon for a family of stochastic small perturbations of a one dimensional dynamical system. We will focus in a semi-flow of a deterministic differential equation which is perturbed by adding to the dynamics a white…

One major open conjecture in the area of critical random graphs, formulated by statistical physicists, and supported by a large amount of numerical evidence over the last decade [23, 24, 28, 63] is as follows: for a wide array of random…

In the past few decades, quantum algorithms have become a popular research area of both mathematicians and engineers. Among them, uniform mixing provides a uniform probability distribution of quantum information over time which attracts a…

In this article we study a small random perturbation of a linear recurrence equation. If all the roots of its corresponding characteristic equation have modulus strictly less than one, the random linear recurrence goes exponentially fast to…

We study continuous-time quantum walks on normal Cayley graphs of certain non-abelian groups, called extraspecial groups. By applying general results for graphs in association schemes we determine the precise conditions for perfect state…

We construct a bounded degree graph $G$, such that a simple random walk on it is transient but the random walk path (i.e., the subgraph of all the edges the random walk has crossed) has only finitely many cutpoints, almost surely. We also…

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…

Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…

Large graphs are sometimes studied through their degree sequences (power law or regular graphs). We study graphs that are uniformly chosen with a given degree sequence. Under mild conditions, it is shown that sequences of such graphs have…

Coalescing random walks is a fundamental stochastic process, where a set of particles perform independent discrete-time random walks on an undirected graph. Whenever two or more particles meet at a given node, they merge and continue as a…

The Aldous--Broder algorithm provides a way of sampling a uniformly random spanning tree for finite connected graphs using simple random walk. Namely, start a simple random walk on a connected graph and stop at the cover time. The tree…

We study a discrete-time duplication-deletion random graph model and analyse its asymptotic degree distribution. The random graphs consists of disjoint cliques. In each time step either a new vertex is brought in with probability $0<p<1$…

A recently fertile strand of research in Group Theory is developing non-abelian analogues of classical combinatorial results for arithmetic Cayley graphs, describing properties such as growth, expansion, mixing, diameter, etc. We consider…

We present a new family of graphs with remarkable properties. They are obtained by connecting the points of a random walk when their distance is smaller than a given scale. Their degree (number of neighbors) does not depend on the graph's…

We prove a general large sieve statement in the context of random walks on subgraphs of a given graph. This can be seen as a generalization of previously known results where one performs a random walk on a group enjoying a strong spectral…

We consider random partitions of the vertex set of a given finite graph that can be sampled by means of loop-erased random walks stopped at a random exponential time of parameter $q>0$. The related random blocks tend to cluster nodes…

We deal with a random graph model evolving in discrete time steps by duplicating and deleting the edges of randomly chosen vertices. We prove the existence of an a.s. asymptotic degree distribution, with streched exponential decay; more…

This paper explores the mixing time of the random transposition walk on permutations with one-sided interval restrictions. In particular, we're interested in the notion of cutoff, a phenomenon which occurs when mixing occurs in a window of…