Understanding frequency distributions of path-dependent processes with non-multinomial maximum entropy approaches
From MaRDI portal
Abstract: Path-dependent stochastic processes are often non-ergodic and observables can no longer be computed within the ensemble picture. The resulting mathematical difficulties pose severe limits to the analytical understanding of path-dependent processes. Their statistics is typically non-multinomial in the sense that the multiplicities of the occurrence of states is not a multinomial factor. The maximum entropy principle is tightly related to multinomial processes, non-interacting systems, and to the ensemble picture; It loses its meaning for path-dependent processes. Here we show that an equivalent to the ensemble picture exists for path-dependent processes, such that the non-multinomial statistics of the underlying dynamical process, by construction, is captured correctly in a functional that plays the role of a relative entropy. We demonstrate this for self-reinforcing P'olya urn processes, which explicitly generalise multinomial statistics. We demonstrate the adequacy of this constructive approach towards non-multinomial pendants of entropy by computing frequency and rank distributions of P'olya urn processes. We show how microscopic update rules of a path-dependent process allow us to explicitly construct a non-multinomial entropy functional, that, when maximized, predicts the time-dependent distribution function.
Recommendations
- A maximum entropy framework for nonexponential distributions
- scientific article; zbMATH DE number 3988588
- Maximum-entropy distributions of nonnegative random variables with conditional-additive structure
- A PATHWAY MODEL OF MITTAG-LEFFLER DISTRIBUTIONS AND RELATED PROCESSES
- scientific article; zbMATH DE number 492878
- Maximum entropy modeling of periodically correlated processes
- Maximum Entropy Density Estimation from Fractional Moments
- A class of maximum-entropy multivariate distributions
Cites work
- A Mathematical Theory of Communication
- Asymptotic Normality in the Generalized Polya–Eggenberger Urn Model, with an Application to Computer Data Structures
- Central limit theorems for urn models
- Functional limit theorems for multitype branching processes and generalized Pólya urns.
- scientific article; zbMATH DE number 3143967 (Why is no real title available?)
- scientific article; zbMATH DE number 3548141 (Why is no real title available?)
- Interval estimation for response adaptive clinical trials
- Inventing new signals
- Martingale functional central limit theorems for a generalized Pólya urn
- On generalized Pólya urn models
- On Information and Sufficiency
- Partition structures, Polya urns, the Ewens sampling formula, and the ages of alleles
- Prior Probabilities
- Pólya-like urns and the Ewens' sampling formula
- The equalization probability of the Pólya urn
- The Pólya information divergence
- The time resolution of the St. Petersburg paradox
This page was built for publication: Understanding frequency distributions of path-dependent processes with non-multinomial maximum entropy approaches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6100602)