Related papers: An ergodic theorem for the weighted ensemble metho…
We extend the weighted ensemble (WE) path sampling method to perform rigorous statistical sampling for systems at steady state. The straightforward steady-state implementation of WE is directly practical for simple landscapes, but not when…
The performance of deep neural networks is enhanced by ensemble methods, which average the output of several models. However, this comes at an increased cost at inference. Weight averaging methods aim at balancing the generalization of…
The switch chain is a well-known Markov chain for sampling directed graphs with a given degree sequence. While not ergodic in general, we show that it is ergodic for regular degree sequences. We then prove that the switch chain is rapidly…
In this paper we prove a sharp quantitative version of the Kendall's Theorem. The Kendal Theorem states that under some mild conditions imposed on a probability distribution on positive integers (i.e. probabilistic sequence) one can prove…
A distributional symmetry is invariance of a distribution under a group of transformations. Exchangeability and stationarity are examples. We explain that a result of ergodic theory provides a law of large numbers: If the group satisfies…
We provide a framework for studying randomly coloured point sets in a locally compact, second-countable space on which a metrisable unimodular group acts continuously and properly. We first construct and describe an appropriate dynamical…
We consider a classic two-state switching diffusion model from a single-particle tracking perspective. The mean and the variance of the time-averaged mean square displacement (TAMSD) are computed exactly. When the measurement time (i.e.,…
We utilize an ergodic theory framework to explore sublinear expectation theory. Specifically, we investigate the pointwise Birkhoff's ergodic theorem for invariant sublinear expectation systems. By further assuming that these sublinear…
Graph Sampling provides an efficient yet inexpensive solution for analyzing large graphs. While extracting small representative subgraphs from large graphs, the challenge is to capture the properties of the original graph. Several sampling…
Based on multiple simulation trajectories, which started from dispersively selected initial conformations, the weighted ensemble dynamics method is designed to robustly and systematically explore the hierarchical structure of complex…
In this paper, we study the complicated dynamics of Anosov systems driven by an external force in the context of geometric theory (an abundance of random periodic points and random horseshoes) and smooth ergodic theory (random periodic…
For an isolated generic quantum system out of equilibrium, the long time average of observables is given by the diagonal ensemble, i.e. the mixed state with the same probability for energy eigenstates as the initial state but without…
The convergence rate of a Markov chain to its stationary distribution is typically assessed using the concept of total variation mixing time. However, this worst-case measure often yields pessimistic estimates and is challenging to infer…
Let $a_n$ be the random increasing sequence of natural numbers which takes each value independently with decreasing probability of order $n^{-\alpha}$, $0 < \alpha < 1/2$. We prove that, almost surely, for every measure-preserving system…
Graphs are used to model interactions in a variety of contexts, and there is a growing need to quickly assess the structure of a graph. Some of the most useful graph metrics, especially those measuring social cohesion, are based on…
We establish a simple variance inequality for U-statistics whose underlying sequence of random variables is an ergodic Markov Chain. The constants in this inequality are explicit and depend on computable bounds on the mixing rate of the…
In biomolecular systems (especially all-atom models) with many degrees of freedom such as proteins and nucleic acids, there exist an astronomically large number of local-minimum-energy states. Conventional simulations in the canonical…
We introduce an extension to the Weighted Ensemble (WE) path sampling method to restrict sampling to a one dimensional path through a high dimensional phase space. Our method, which is based on the finite-temperature string method, permits…
We study here weighted polynomial multiple ergodic averages. A sequence of weights is called universally good if any polynomial multiple ergodic average with this sequence of weights converges in $L^{2}$. We find a necessary condition and…
A method for obtaining simple criteria for instabilities in kinetic theory is described and outlined, specifically for the relativistic Vlasov-Maxwell system. An important ingredient of the method is an analysis of a parametrized set of…