Related papers: Ergodic Theory on Stationary Random Graphs
We study stationary stable processes related to periodic and cyclic flows in the sense of Rosinski [Ann. Probab. 23 (1995) 1163-1187]. These processes are not ergodic. We provide their canonical representations, consider examples and show…
We study the ergodic theory of stationary directed nearest-neighbor polymer models on $\mathbb Z^2$, with i.i.d. weights. Such models are equivalent to specifying a stationary distribution on the space of weights and correctors that satisfy…
We prove an ergodic theorem for Markov chains indexed by the Ulam-Harris-Neveu tree over large subsets with arbitrary shape under two assumptions: with high probability, two vertices in the large subset are far from each other and have…
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…
This brief pedagogical note re-proves a simple theorem on the convergence, in $L_2$ and in probability, of time averages of non-stationary time series to the mean of expectation values. The basic condition is that the sum of covariances…
The M\"obius disjointness conjecture of Sarnak states that the M\"obius function does not correlate with any bounded sequence of complex numbers arising from a topological dynamical system with zero topological entropy. We verify the…
A novel Markovian network evolution model is introduced and analysed by means of information theory. It will be proved that the model, called Network Evolution Chain, is a stationary and ergodic stochastic process. Therefore, the Asymptotic…
Polygonal slap maps are piecewise affine expanding maps of the interval obtained by projecting the sides of a polygon along their normals onto the perimeter of the polygon. These maps arise in the study of polygonal billiards with…
Inferring graph structure from observations on the nodes is an important and popular network science task. Departing from the more common inference of a single graph and motivated by social and biological networks, we study the problem of…
We consider non-ergodic class of stationary real harmonizable symmetric $\alpha$-stable processes $X=\left\{X(t):t\in\mathbb{R}\right\}$ with a finite symmetric and absolutely continuous control measure. We refer to its density function as…
A popular approach to semi-supervised learning proceeds by endowing the input data with a graph structure in order to extract geometric information and incorporate it into a Bayesian framework. We introduce new theory that gives appropriate…
We study diffusion-type equations supported on structures that are randomly varying in time. After settling the issue of well-posedness, we focus on the asymptotic behavior of solutions: our main result gives sufficient conditions for…
Computing the embedding distribution of a given graph is a fundamental question in topological graph theory. In this article, we extend our viewpoint to a sequence of graphs and consider their asymptotic embedding distributions, which are…
We examine the stationary distribution of random walks on directed graphs. In particular, we focus on the {\em principal ratio}, which is the ratio of maximum to minimum values of vertices in the stationary distribution. We give an upper…
Exponential family Random Graph Models (ERGMs) can be viewed as expressing a probability distribution on graphs arising from the action of competing social forces that make ties more or less likely, depending on the state of the rest of the…
From the point of view of discrete geometry, the class of locally finite transitive graphs is a wide and important one. The subclass of Cayley graphs is of particular interest, as testifies the development of geometric group theory. Recall…
Statistical properties of evolving random graphs are analyzed using kinetic theory. Treating the linking process dynamically, structural characteristics such as links, paths, cycles, and components are obtained analytically using the rate…
There is only one fully supported ergodic invariant probability measure for the adic transformation on the space of infinite paths in the graph that underlies the Eulerian numbers. This result may partially justify a frequent assumption…
In this paper, we study Random Dynamical Systems (RDSs) of homeomorphisms on the circle without a finite orbit. We characterize the topological dynamics of the associated semigroup by identifying the existence of invariant sets which are…
This article is concerned with sampling from Gibbs distributions $\pi(x)\propto e^{-U(x)}$ using Markov chain Monte Carlo methods. In particular, we investigate Langevin dynamics in the continuous- and the discrete-time setting for such…