Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2210.08235

Comparative analysis of time irreversibility and amplitude irreversibility based on joint permutation

Wenpo Yao·Wenli Yao·Rongshuang Xu·Jun Wang
View original source ↗Read source document ↗Export metadata ↓

Abstract

Although time irreversibility (TIR) and amplitude irreversibility (AIR) are relevant concepts for nonequilibrium analysis, their association has received little attention. This paper conducts a systematic comparative analysis of the relationship between TIR and AIR based on statistical descriptions and numerical simulations. To simplify the quantification of TIR and AIR, the amplitude permutation and global information of the associated vector are combined to produce a joint probability estimation. Chaotic logistic, Henon, and Lorenz series are generated to evaluate TIR and AIR according to surrogate theory, and the distributions of joint permutations for these model series are measured to compare the degree of TIR and AIR. The joint permutation TIR and AIR are then used to investigate nonequilibrium pathological features in epileptic electroencephalography data. Test results suggest that epileptic brain electrical activities, particular those during the onset of seizure, manifest higher nonequilibrium characteristics. According to the statistical definitions and targeted pairs of joint permutations in the chaotic model data, TIR and AIR are fundamentally different nonequilibrium descriptors from time- and amplitude-reversibility, respectively, and thus require different forms of numerical analysis. At the same time, TIR and AIR both provide measures for fluctuation theorems associated with nonequilibrium processes, and have similar probabilistic differences in the pairs of joint permutations and consistent outcomes when used to analyze both the model series and real-world signals. Overall, comparative analysis of TIR and AIR contributes to our understanding of nonequilibrium features and broadens the scope of quantitative nonequilibrium measures. Additionally, the construction of joint permutations contributes to the development of symbolic time series analysis.

Explore related subjects

stat.COnlin.CD

Keep this discovery

BibTeXRIS

Wenpo Yao, Wenli Yao, Rongshuang Xu, Jun Wang. 2022-10-15. Comparative analysis of time irreversibility and amplitude irreversibility based on joint permutation. https://doi.org/10.1016/j.cnsns.2022.106925

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO↗
arXiv2026

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO↗