Related papers: Best Ergodic Averages via Optimal Graph Filters in…
The Birkhoff Ergodic Theorem concludes that time averages, that is, Birkhoff averages, $\Sigma_{n=1}^N f(x_n)/N$ of a function $f$ along an ergodic trajectory $(x_n)$ of a function $T$ converges to the space average $\int f d\mu$, where…
Using the renewal approach we prove Bernstein-like inequalities for additive functionals of geometrically ergodic Markov chains, thus obtaining counterparts of inequalities for sums of independent random variables. The coefficient in the…
Randomising networks using a naive `accept-all' edge-swap algorithm is generally biased. Building on recent results for nondirected graphs, we construct an ergodic detailed balance Markov chain with non-trivial acceptance probabilities for…
We design a deterministic algorithm that, given $n$ points in a \emph{typical} constant degree regular~graph, queries $O(n)$ distances to output a constant factor approximation to the average distance among those points, thus answering a…
The classical Bakry-\'Emery calculus is extended to study, for degenerated (non-elliptic, non-reversible, or non-diffusive) Markov processes, questions such as hypoellipticity, hypocoercivity, functional inequalities or Wasserstein…
Graph filters are one of the core tools in graph signal processing. A central aspect of them is their direct distributed implementation. However, the filtering performance is often traded with distributed communication and computational…
We study a simple Markov chain, the switch chain, on the set of all perfect matchings in a bipartite graph. This Markov chain was proposed by Diaconis, Graham and Holmes as a possible approach to a sampling problem arising in Statistics. We…
One of the cornerstones of the field of signal processing on graphs are graph filters, direct analogues of classical filters, but intended for signals defined on graphs. This work brings forth new insights on the distributed graph filtering…
A common tool in the practice of Markov Chain Monte Carlo is to use approximating transition kernels to speed up computation when the desired kernel is slow to evaluate or intractable. A limited set of quantitative tools exist to assess the…
After a brief review of the key theorems concerning recurrent sequences, we give an explicit computation of the inverse of the Vandermonde matrix. This will then be used to derive sub-exponential decay error terms in the ergodic theorem of…
Birkhoff's theorem states that for an ergodic automorphism, the time averages converge to the space average. Given sequence $\psi(n)\to+0$, U. Krengel proved that for any ergodic automorphism there is an indicator such that the…
In the past decade, several multi-resolution representation theories for graph signals have been proposed. Bipartite filter-banks stand out as the most natural extension of time domain filter-banks, in part because perfect reconstruction,…
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…
We obtain pointwise ergodic theorems with rate under conditions expressed in terms of the convergence of series involving $\|\sum_{k=1} ^nf\circ \theta^k\|_2$, improving previous results. Then, using known results on martingale…
For an ergodic flow, a range of rates of convergence of Birkhoff averages from the maximum rate to an arbitrarily slow rate is realized by choosing the averaging function. For torus windings, the continuity of the averaging functions is…
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…
Markov chains are one of the well-known tools for modeling and analyzing stochastic systems. At the same time, they are used for constructing random walks that can achieve a given stationary distribution. This paper is concerned with…
Cohesive subgraph mining is a fundamental problem in bipartite graph analysis. In reality, relationships between two types of entities often occur at some specific timestamps, which can be modeled as a temporal bipartite graph. However, the…
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…
Many representative graph neural networks, e.g., GPR-GNN and ChebNet, approximate graph convolutions with graph spectral filters. However, existing work either applies predefined filter weights or learns them without necessary constraints,…