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

We study the rate of growth of ergodic sums along a sequence (a_n) of times: S_N f(x)=f(T^{a_1}x) + ... + f(T^{a_N}x). We characterize the maximal rate of growth of these ergodic sums and identify a number of sequences such as (2^n) that…

Let $d\geq 3$ be fixed and $G$ be a large random $d$-regular graph on $n$ vertices. We show that if $n$ is large enough then the entry distribution of every almost eigenvector $v$ of $G$ (with entry sum 0 and normalized to have length…

The $N$ vertices of a quantum random graph are each a circle independently punctured at Poisson points of arrivals, with parallel connections derived through for each pair of these punctured circles by yet another independent Poisson…

Let $G(N,p)=(V,E)$ be an Erd\"os-R\'enyi random graph and $(X_n)_{n \in \mathbb{N}}$ be a simple random walk on it. We study the the order of magnitude of $\sum_{i \in V} \pi_ih_{ij} $ where $\pi_i=d_i / 2|E|$ for $d_i$ the number of…

Let $(X,\mu)$ be a probability space equipped with an invertible, measure-preserving transformation $T\colon X \to X$. We exhibit a wide class of weights $w$ so that whenever $f,g \in L^{\infty}(X)$, the bilinear ergodic averages \[…

Graph vertex embeddings based on random walks have become increasingly influential in recent years, showing good performance in several tasks as they efficiently transform a graph into a more computationally digestible format while…

Let $\mathcal A$ be the adjacency matrix of a random $d$-regular graph on $N$ vertices, and we denote its eigenvalues by $\lambda_1\geq \lambda_2\cdots \geq \lambda_{N}$. For $N^{2/3}\ll d\leq N/2$, we prove optimal rigidity estimates of…

We consider the ergodicity and consensus problem for a discrete-time linear dynamic model driven by random stochastic matrices, which is equivalent to studying these concepts for the product of such matrices. Our focus is on the model where…

A classical result of Koml\'os, S\'ark\"ozy and Szemer\'edi states that every $n$-vertex graph with minimum degree at least $(1/2+ o(1))n$ contains every $n$-vertex tree with maximum degree $O(n/\log{n})$ as a subgraph, and the bounds on…

We are given an integer $d$, a graph $G=(V,E)$, and a uniformly random embedding $f : V \rightarrow \{0,1\}^d$ of the vertices. We are interested in the probability that $G$ can be "realized" by a scaled Euclidean norm on $\mathbb{R}^d$, in…

Heterogeneous diffusion processes can be well described by an overdamped Langevin equation with space-dependent diffusivity $D(x)$. We investigate the ergodic and non-ergodic behavior of these processes in an arbitrary potential well $U(x)$…

This paper considers generalised network, intended as networks where (a) the edges connecting the nodes are nonlinear, and (b) stochastic processes are continuously indexed over both vertices and edges. Such topological structures are…

We propose a novel exact algorithm for generating connected Erdos-Renyi random graphs $G(n,p)$. The method couples the graph exploration process to an inhomogeneous Poisson random walk, which yields an exact sampler that runs in $O(n)$ time…

We analyze how the transient dynamics of large dynamical systems in the vicinity of a stationary point, modeled by a set of randomly coupled linear differential equations, depends on the network topology. We characterize the transient…

Random walk based distributed algorithms make use of a token that circulates in the system according to a random walk scheme to achieve their goal. To study their efficiency and compare it to one of the deterministic solutions, one is led…

A tuple $(G_1,\dots,G_n)$ of graphs on the same vertex set of size $n$ is said to be Hamilton-universal if for every map $\chi: [n]\to[n]$ there exists a Hamilton cycle whose $i$-th edge comes from $G_{\chi(i)}$. Bowtell, Morris, Pehova and…

Let $G=(V,E)$ be a $d$-regular graph on $n$ vertices and let $\mu_0$ be a probability measure on $V$. The act of moving to a randomly chosen neighbor leads to a sequence of probability measures supported on $V$ given by $\mu_{k+1} = A…

The effects of spatial confinements and smooth cutoffs of the waiting time distribution in continuous-time random walks (CTRWs) are studied analytically. We also investigate dependences of ergodic properties on initial ensembles (i.e.,…

We prove a general result that if a Metropolis--Hastings algorithm has a proposal that is not geometrically ergodic and the acceptance rate approaches unity at a suitable rate as the state variable becomes large, then the Metropolised chain…

The goal is to show that an edge-reinforced random walk on a graph of bounded degree, with reinforcement weight function $W$ taken from a general class of reciprocally summable reinforcement weight functions, traverses a random attracting…