Entropy: the Markov ordering approach (Q657470): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57384860, #quickstatements; #temporary_batch_1710858552373 |
Set OpenAlex properties. |
||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3099322555 / rank | |||
Normal rank |
Revision as of 03:07, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Entropy: the Markov ordering approach |
scientific article |
Statements
Entropy: the Markov ordering approach (English)
0 references
9 January 2012
0 references
Summary: The focus of this article is on entropy and Markov processes. We study the properties of functionals which are invariant with respect to monotonic transformations and analyze two invariant ``additivity'' properties: (i) existence of a monotonic transformation which makes the functional additive with respect to the joining of independent systems and (ii) existence of a monotonic transformation which makes the functional additive with respect to the partitioning of the space of states. All Lyapunov functionals for Markov chains which have properties (i) and (ii) are derived. We describe the most general ordering of the distribution space, with respect to which all continuous-time Markov processes are monotonic (the Markov order). The solution differs significantly from the ordering given by the inequality of entropy growth. For inference, this approach results in a convex compact set of conditionally ``most random'' distributions.
0 references
Markov process
0 references
Lyapunov function
0 references
entropy functionals
0 references
attainable region
0 references
maxent
0 references
inference
0 references