Related papers: An ergodic theorem for the weighted ensemble metho…
Many data-driven algorithms in dynamical systems rely on ergodic averages that converge painfully slowly. One simple idea changes this: taper the ends. Weighted Birkhoff averages can converge much faster (sometimes superpolynomially, even…
We strengthen the maximal ergodic theorem for actions of groups of polynomial growth to a form involving jump quantity, which is the sharpest result among the family of variational or maximal ergodic theorems. As a consequence, we deduce in…
The most efficient MC weights for the calculation of physical, canonical expectation values are not necessarily those of the canonical ensemble. The use of suitably generalized ensembles can lead to a much faster convergence of the…
These notes are based on a course for a general audience given at the Centro de Modeliamento Matem\'atico of the University of Chile, in December 2004. We study the mean convergence of multiple ergodic averages, that is, averages of a…
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…
With the increasing volume of data in the world, the best approach for learning from this data is to exploit an online learning algorithm. Online ensemble methods are online algorithms which take advantage of an ensemble of classifiers to…
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…
We prove weighted and vector-valued variational estimates for ergodic averages on $\mathbb{R}^d$. The weighted square function estimate relating ergodic averages to the dyadic martingale is obtained using an $\ell^r$ version of a reverse…
The Birkhoff Ergodic Theorem asserts under mild conditions that Birkhoff averages (i.e. time averages computed along a trajectory) converge to the space average. For sufficiently smooth systems, our small modification of numerical Birkhoff…
In view of the node importance in weighted networks, weighted expected method (WEM), was proposed in this paper, which take an advantages of uncertain graph algorithm. First, a weight processing method is proposed based on the relationship…
Assuming that a threshold Ornstein-Uhlenbeck process is observed at discrete time instants, we propose generalized moment estimators to estimate the parameters. Our theoretical basis is the celebrated ergodic theorem. To use this theorem we…
The paper is a sketch of systematic presentation of distributional limit theorems and their refinements for compound sums. When analyzing, e.g., ergodic semi-Markov systems with discrete or continuous time, this allows us to separate those…
We prove strengthenings of the Birkhoff Ergodic Theorem for weakly mixing and strongly mixing measure preserving systems. We show that our pointwise theorem for weakly mixing systems is strictly stronger than the Wiener-Wintner Theorem. We…
Approximate inference algorithm is one of the fundamental research fields in machine learning. The two dominant theoretical inference frameworks in machine learning are variational inference (VI) and Markov chain Monte Carlo (MCMC).…
In Markov Chain Monte Carlo (MCMC) simulations, the thermal equilibria quantities are estimated by ensemble average over a sample set containing a large number of correlated samples. These samples are selected in accordance with the…
A sequence $(s_n)$ of integers is good for the mean ergodic theorem if for each invertible measure preserving system $(X,\mathcal{B},\mu,T)$ and any bounded measurable function $f$, the averages $ \frac1N \sum_{n=1}^N f(T^{s_n}x)$ converge…
For a differential equation with interaction, we investigate its ergodic properties. We apply the obtained results to study the limiting behavior of braid invariants associated with the flow of solutions.
The generic behavior of quantum systems has long been of theoretical and practical interest. Any quantum process is represented by a sequence of quantum channels. We consider general ergodic sequences of stochastic channels with arbitrary…
We study ergodic properties of nonlinear Markov chains and stochastic McKean-Vlasov equations. For nonlinear Markov chains we obtain sufficient conditions for existence and uniqueness of an invariant measure and uniform ergodicity. We also…
We show that a $k$-linear pointwise ergodic theorem on an ergodic measure-preserving system implies a uniform $k$-linear nilsequence Wiener-Wintner theorem on that system. The assumption is known to hold for arbitrary systems and $k=2$ (due…