Related papers: Universality of trap models in the ergodic time sc…

We consider the statistics of the extreme eigenvalues of sparse random matrices, a class of random matrices that includes the normalized adjacency matrices of the Erd{\H o}s-R{\'e}nyi graph $G(N,p)$. Recently, it was shown by Lee, up to an…

The purpose of this paper is to study ergodic averages with deterministic weights. More precisely we study the convergence of the ergodic averages of the type $\frac{1}{N} \sum_{k=0}^{N-1} \theta (k) f \circ T^{u_k}$ where $\theta = (\theta…

We consider random graphs on the set of $N^2$ vertices placed on the discrete $2$-dimensional torus. The edges between pairs of vertices are independent, and their probabilities decay with the distance $\rho$ between these vertices as…

In the classical Erd\"os-R\'enyi random graph G(n,p) there are n vertices and each of the possible edges is independently present with probability p. The random graph G(n,p) is homogeneous in the sense that all vertices have the same…

In this paper, we consider a one-dimensional random geometric graph process with the inter-nodal gaps evolving according to an exponential AR(1) process, which may serve as a mobile wireless network model. The transition probability matrix…

The purpose of this paper is to study the time average behavior of Markov chains with transition probabilities being kernels of completely continuous operators, and therefore to provide a sufficient condition for a class of Markov chains…

There are few known exponential speedups for quantum algorithms and these tend to fall into even fewer families. One speedup that has mostly resisted generalization is the use of quantum walks to traverse the welded-tree graph, due to…

Motivated by Sarnak's conjecture on M\"obius orthogonality, we investigate the general problem of orthogonality for a bounded sequence to topological models of characteristic classes of measure-preserving automorphisms. Our main observation…

We give several quantum dynamical analogs of the classical Kronecker-Weyl theorem, which says that the trajectory of free motion on the torus along almost every direction tends to equidistribute. As a quantum analog, we study the quantum…

We consider random temporal graphs, a version of the classical Erd\H{o}s--R\'enyi random graph G(n,p) where additionally, each edge has a distinct random time stamp, and connectivity is constrained to sequences of edges with increasing time…

For a finite graph $G=(V,E)$ let $G^*$ be obtained by considering a random perfect matching of $V$ and adding the corresponding edges to $G$ with weight $\varepsilon$, while assigning weight 1 to the original edges of $G$. We consider…

We pose a new and intriguing question motivated by distributed computing regarding random walks on graphs: How long does it take for several independent random walks, starting from the same vertex, to cover an entire graph? We study the…

In this paper we prove the following result, useful and often needed in the study of the ergodic properties of hard ball systems: In any such system, for any phase point x with a non-singular forward trajectory and infinitely many connected…

A finite ergodic Markov chain exhibits cutoff if its distance to equilibrium remains close to its initial value over a certain number of iterations and then abruptly drops to near 0 on a much shorter time scale. Originally discovered in the…

The spread in time of a mutation through a population is studied analytically and computationally in fully-connected networks and on spatial lattices. The time, t_*, for a favourable mutation to dominate scales with population size N as…

Motivated by the well-known phase-space portrait of the nonlinear pendulum, the purpose of this paper is to obtain convergence rates in the ergodic theorem for flows in the plane that have arbitrarily slow trajectories. Considering bounded…

We consider a nonstationary random walk on a compact metrizable abelian group. Under a classical strict aperiodicity assumption we establish a weak-* convergence to the Haar measure, Ergodic Theorem and Large Deviation Type Estimate.

We consider a Metropolis--Hastings method with proposal $\mathcal{N}(x, hG(x)^{-1})$, where $x$ is the current state, and study its ergodicity properties. We show that suitable choices of $G(x)$ can change these compared to the Random Walk…

We study a one-parameter family of interval maps $\{T_\alpha\}_{\alpha\in[1,\beta]}$, with $\beta$ the golden mean, defined on $[-1,1]$ by $T_\alpha(x)=\beta^{1+|t|}x-t\beta\alpha$ where $t\in\{-1,0,1\}$. For each $T_\alpha,\ \alpha>1$, we…

We establish an inclusion relation between two uniform models of random $k$-graphs (for constant $k \ge 2$) on $n$ labeled vertices: $\mathbb G^{(k)}(n,m)$, the random $k$-graph with $m$ edges, and $\mathbb R^{(k)}(n,d)$, the random…