Ergodicity in Stationary Graph Processes: A Weak Law of Large Numbers
For stationary signals in time the weak law of large numbers (WLLN) states that ensemble and realization averages are within e of each other with a probability of order O(1/Ne^2) when considering N signal components. The graph WLLN introduced in this paper shows that the same is essentially true for signals supported on graphs. However, the notions of stationarity, ensemble mean, and realization mean are different. Recent papers have defined graph stationary signals as those that satisfy a form of invariance with respect to graph diffusion. The ensemble mean of a graph stationary signal is not a constant but a node-varying signal whose structure depends on the spectral properties of the graph. The realization average of a graph signal is defined here as an average of successive weighted averages of local signal values with signal values of neighboring nodes. The graph WLLN shows that this two node-varying signals are within e of each other with probability of order O(1/Ne^2) in at least some nodes. In stationary time signals, the realization average is not only a consistent estimator of the ensemble mean but also optimal in terms of mean squared error (MSE). This is not true of graph signals. Optimal MSE graph filter designs are also presented. An example problem concerning the estimation of the mean of a Gaussian random field is presented.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Universally Consistent Online Learning with Arbitrarily Dependent Responses
This work provides an online learning rule that is universally consistent under processes on (X,Y) pairs, under conditions only on the X process. As a special case, the conditions admit all processes on (X,Y) such that t…
Regret Analysis of Average-Reward Unichain MDPs via an Actor-Critic Approach
Actor-Critic methods are widely used for their scalability, yet existing theoretical guarantees for infinite-horizon average-reward Markov Decision Processes (MDPs) often rely on restrictive ergodicity assumptions. We pr…
TARvalidSignatures of Infinity: Nonergodicity and Resource Scaling in Prediction, Complexity, and Learning
We introduce a simple analysis of the structural complexity of infinite-memory processes built from random samples of stationary, ergodic finite-memory component processes. Such processes are familiar from the well known…
Affine Jump-Diffusions: Stochastic Stability and Limit Theorems
Affine jump-diffusions constitute a large class of continuous-time stochastic models that are particularly popular in finance and economics due to their analytical tractability. Methods for parameter estimation for such …
parameter estimationErgodic characterization of non-ergodic anomalous diffusion processes
Canonical characterization techniques that rely upon mean squared displacement ($\mathrm{MSD}$) break down for non-ergodic processes, making it challenging to characterize anomalous diffusion from an individual time-seri…
Time SeriesTime Series Analysis