Related papers: Repeated Block Averages: entropic time and mixing …
We construct a family of trees on which a lazy simple random walk exhibits total variation cutoff. The main idea behind the construction is that hitting times of large sets should be concentrated around their means. For this sequence of…
Random walks on expander graphs were thoroughly studied, with the important motivation that, under some natural conditions, these walks mix quickly and provide an efficient method of sampling the vertices of a graph. Alon, Benjamini,…
Define the non-overlapping return time of a random process to be the number of blocks that we wait before a particular block reappears. We prove a Central Limit Theorem based on these return times. This result has applications to entropy…
The generalised random graph contains $n$ vertices with positive i.i.d. weights. The probability of adding an edge between two vertices is increasing in their weights. We require the weight distribution to have finite second moments and…
We consider random walk with bounded jumps on a hypercubic lattice of arbitrary dimension in a dynamic random environment. The environment is temporally independent and spatially translation invariant. We study the rate functions of the…
We study regular graphs in which the random walks starting from a positive fraction of vertices have small mixing time. We prove that any such graph is virtually an expander and has no small separator. This answers a question of Pak [SODA,…
Twisted hypercubes are generalizations of the Boolean hypercube, obtained by iteratively connecting two instances of a graph by a uniformly random perfect matching. Dudek et al. showed that when the two instances are independent, these…
Breakup of small aggregates in fully developed turbulence is studied by means of direct numerical simulations in a series of typical bounded and unbounded flow configurations, such as a turbulent channel flow, a developing boundary layer…
We study a discrete-time consensus model in which agents iteratively update their states through interactions on a dynamic social network. At each step, a single agent is selected asynchronously and averages the values of its current…
We consider uniformly random set partitions of size $n$ with exactly $k$ blocks, and uniformly random permutations of size $n$ with exactly $k$ cycles, under the regime where $n-k \sim t\sqrt{n}$, $t>0$. In this regime, there is a simple…
The perceived randomness in the time evolution of "chaotic" dynamical systems can be characterized by universal probabilistic limit laws, which do not depend on the fine features of the individual system. One important example is the…
We study the large space and time scale behavior of a totally asymmetric, nearest-neighbor exclusion process in one dimension with random jump rates attached to the particles. When slow particles are sufficiently rare the system has a phase…
We describe the asymptotic behaviour of large degrees in random hyperbolic graphs, for all values of the curvature parameter $ \alpha$. We prove that, with high probability, the node degrees satisfy the following ordering property: the…
We deal with a random graph model where at each step, a vertex is chosen uniformly at random, and it is either duplicated or its edges are deleted. Duplication has a given probability. We analyse the limit distribution of the degree of a…
We prove that the mixing time of driven-dissipative activated random walk on an interval of length $n$ with uniform or central driving exhibits cutoff at $n$ times the critical density for activated random walk on the integers. The proof…
We study the basic statistical problem of testing whether normally distributed $n$-dimensional data has been truncated, i.e. altered by only retaining points that lie in some unknown truncation set $S \subseteq \mathbb{R}^n$. As our main…
We prove that the distributional limit of the normalised number of returns to small neighbourhoods of periodic points of non-uniformly hyperbolic dynamical systems is compound Poisson. The returns to small balls around a fixed point in the…
Consider symmetric simple exclusion processes, with or without Glauber dynamics on the boundary set, on a sequence of connected unweighted graphs $G_N=(V_N,E_N)$ which converge geometrically and spectrally to a compact connected metric…
We study the popular distributed consensus method over networks composed of a number of densely connected clusters with a sparse connection between them. In these cluster networks, the method often constitutes two-time-scale dynamics, where…
Limiting distributions are derived for the sparse connected components that are present when a random graph on $n$ vertices has approximately $\half n$ edges. In particular, we show that such a graph consists entirely of trees, unicyclic…