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

We consider Erd\H{o}s-R\'enyi graphs $G(n,p)$ for $0 < p < 1$ fixed and $n \rightarrow \infty$ and study the expected number of steps, $H_{wv}$, that a random walk started in $w$ needs to first arrive in $v$. A natural guess is that an…

We lift important results about universally typical sets, typically sampled sets, and empirical entropy estimation in the theory of samplings of discrete ergodic information sources from the usual one-dimensional discrete-time setting to a…

We study a generalisation of the random recursive tree (RRT) model and its multigraph counterpart, the uniform directed acyclic graph (DAG). Here, vertices are equipped with a random vertex-weight representing initial inhomogeneities in the…

Assuming that a reflected Ornstein-Uhlenbeck state process is observed at discrete time instants, we propose generalized moment estimators to estimate all drift and diffusion parameters via the celebrated ergodic theorem. With the sampling…

Consider a connected graph $G=(E,V)$ with $N=|V|$ vertices. The main purpose of this paper is to explore the question of uniform sampling of a subtree of $G$ with $n$ nodes, for some $n\leq N$ (the spanning tree case correspond to $n=N$,…

We study generic $d$-dimensional rigidity in sparse random graphs. Our main result is that for every $d\ge 2$, the Erd\H{o}s--R\'enyi random graph $G\sim G(n,c/n)$ undergoes a $d$-rigidity phase transition at the known, explicit,…

In this paper, we investigate ergodic and fractal properties of the sets $$\Lambda_y:=\Big\{n\in\mathbb{N}:\ \{u_ny\}\in I_n\Big\},$$ where $\{\cdot\}$ denotes the fractional part function, $(u_n)_{n\in\mathbb{N}}$ is an increasing sequence…

A graph is said to be $\mathcal{H}(n, \Delta)$-universal if it contains every graph on $n$ vertices with maximum degree at most $\Delta$. Using a `matching-based' embedding technique introduced by Alon and F\"uredi, Dellamonica, Kohayakawa,…

Let $(\xi_n)_{n=0}^\infty$ be a nonhomogeneous Markov chain taking values from finite state-space of $\mathbf{X}=\{1,2,\ldots,b\}$. In this paper, we will study the generalized entropy ergodic theorem with almost-everywhere and…

Necessary and sufficient conditions for a Markov chain to be ergodic are that the chain is irreducible and aperiodic. This result is manifest in the case of random walks on finite groups by a statement about the support of the driving…

We consider a random walk in a stationary ergodic environment in $\mathbb Z$, with unbounded jumps. In addition to uniform ellipticity and a bound on the tails of the possible jumps, we assume a condition of strong transience to the right…

We study pointwise convergence of entangled averages of the form \[ \frac{1}{N^k}\sum_{1\leq n_1,\ldots, n_k\leq N} T_m^{n_{\alpha(m)}}A_{m-1}T^{n_{\alpha(m-1)}}_{m-1}\ldots A_2T_2^{n_{\alpha(2)}}A_1T_1^{n_{\alpha(1)}} f, \] where $f\in…

We consider the normalized adjacency matrix of a random $d$-regular graph on $N$ vertices with any fixed degree $d\geq 3$ and denote its eigenvalues as $\lambda_1=d/\sqrt{d-1}\geq \lambda_2\geq\lambda_3\cdots\geq \lambda_N$. We establish…

We consider the range of random walks up to time n, R_n, on graphs satisfying a uniform condition. This condition is characterized by potential theory. Not only all vertex transitive graphs but also many non-regular graphs satisfy the…

For a class of locally (but not necessarily uniformly) Lipschitz continuous $d$-dimensional observables over a Gibbs-Markov system, we show that convergence of (suitably normalized and centered) ergodic sums to a non-Gaussian stable vector…

We consider a time varying analogue of the Erd{\H o}s-R{\' e}nyi graph and study the topological variations of its associated clique complex. The dynamics of the graph are stationary and are determined by the edges, which evolve…

In the study of the observability of the wave equation (here on $(0,T)\times \mathbb{T}^d$, where $\mathbb{T}^d$ is the d-dimensional torus), a condition naturally emerges as a sufficient observability condition. This condition, which…

We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a…

We study attracting graphs of step skew products from the topological and ergodic points of view where the usual contracting-like assumptions of the fiber dynamics are replaced by weaker merely topological conditions. In this context, we…

The aim of our work is to study vertex-reinforced jump processes with super-linear weight function $w(t) = t^\alpha$ , for some $\alpha>1$. On any complete graph $G = (V, E)$, we prove that there is one vertex $v \in V$ such that the total…