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

We consider symmetric trap models in the d-dimensional hypercube whose ordered mean waiting times, seen as weights of a measure in the natural numbers, converge to a finite measure as d diverges, and show that the models suitably…

We consider trap models on Z^d, namely continuous time Markov jump process on Z^d with embedded chain given by a generic discrete time random walk, and whose mean waiting time at x is given by tau_x, with tau = (tau_x, x in Z^d) a family of…

Random walk models, such as the trap model, continuous time random walks, and comb models exhibit weak ergodicity breaking, when the average waiting time is infinite. The open question is: what statistical mechanical theory replaces the…

Consider deterministic random walks F: I x Z -> I x Z, defined by F(x,n)=(f(x), K(x)+n), where f is an expanding Markov map on the interval I and K: I->Z. We study the universality (stability) of ergodic (for instance, recurrence and…

Consider the random process that starts with $n$ vertices and no edges, where the edges of $K_n$ are added one at a time in a uniformly chosen random order $e_1, e_2,\ldots, e_{\binom{n}{2}}$. Let $T$ be the earliest time at which $e_1$…

A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…

We investigate continuous time random walks with truncated $\alpha$-stable trapping times. We prove distributional ergodicity for a class of observables; namely, the time-averaged observables follow the probability density function called…

We address the question of understanding the effect of the underlying network topology on the spread of a virus and the dissemination of information when users are mobile performing independent random walks on a graph. To this end we…

We introduce the concepts of Baire Ergodicity and Ergodic Formalism, employing them to study topological and statistical attractors. Specifically, we establish the existence and finiteness of such attractors and provide applications for…

Let $a_n$ be the random increasing sequence of natural numbers which takes each value independently with decreasing probability of order $n^{-\alpha}$, $0 < \alpha < 1/2$. We prove that, almost surely, for every measure-preserving system…

We introduce a new class of sparse sequences that are ergodic and pointwise universally $L^2$-good for ergodic averages. That is, sequences along which the ergodic averages converge almost surely to the projection to invariant functions.…

We provide an explicit formula for the global mean first-passage time (GMFPT) for random walks in a general graph with a perfect trap fixed at an arbitrary node, where GMFPT is the average of mean first-passage time to the trap over all…

Despite the recently exhibited importance of higher-order interactions for various processes, few flexible (null) models are available. In particular, most studies on hypergraphs focus on a small set of theoretical models. Here, we…

Convergence properties of random ergodic averages have been extensively studied in the literature. In these notes, we exploit a uniform estimate by Cohen \& Cuny who showed convergence of a series along randomly perturbed times for…

Let $(X, \mathcal{A},\mu)$ be a probability space and let $T$ be a contraction on $L^2(\mu)$. We provide suitable conditions over sequences $(w_k)$, $(u_k)$ and $(A_k)$ in such a way that the weighted ergodic limit…

We consider the coherent exciton transport, modeled by continuous-time quantum walks, on Erd\"{o}s-R\'{e}ny graphs in the presence of a random distribution of traps. The role of trap concentration and of the substrate dilution is deepened…

We propose the following model of a random graph on n vertices. Let F be a distribution in R_+^{n(n-1)/2} with a coordinate for every pair i$ with 1 \le i,j \le n. Then G_{F,p} is the distribution on graphs with n vertices obtained by…

We consider continuous-time random walk models described by arbitrary sojourn time probability density functions. We find a general expression for the distribution of time-averaged observables for such systems, generalizing some recent…

We apply here methods of inhomogeneous random graphs to a class of random distance graphs. This provides an example outside of the rank 1 models which is still solvable as long as the largest connected component is concerned. In particular,…

In this paper, for a discontinuous skew-product transformation with the integrable observation function, we obtain uniform ergodic theorem and semi-uniform ergodic theorem. The main assumptions are that discontinuity sets of transformation…