2015
DOI: 10.3390/e17031273
|View full text |Cite
|
Sign up to set email alerts
|

Symmetry, Probabiliy, Entropy: Synopsis of the Lecture at MAXENT 2014

Abstract: Abstract:In this discussion, we indicate possibilities for (homological and non-homological) linearization of basic notions of the probability theory and also for replacing the real numbers as values of probabilities by objects of suitable combinatorial categories.Keywords: entropy; Bernoulli approximation; homology measuresThe success of the probability theory decisively, albeit often invisibly, depends on symmetries of systems this theory applies to. For instance:• The symmetry group of a single round of gam… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 10 publications
(9 reference statements)
0
4
0
Order By: Relevance
“…We underline that no stationarity, ergodicity or Markovian (and all the more iid memoryless processes) assumptions have been made in the formalism. Altogether, the formalization of information paths provides an elementary setting to tackle the problematics raised by Gromov on symmetry, probability, entropy [124]. Question: recently Baez and Fong published a Noether Theorem for Markov Processes [125]; can we derive a Noether theorem for random discrete processes in general, that is for all the symmetric group S n using the present construction?…”
Section: Information Paths Are Random Processes: Topological 2nd Law mentioning
confidence: 98%
“…We underline that no stationarity, ergodicity or Markovian (and all the more iid memoryless processes) assumptions have been made in the formalism. Altogether, the formalization of information paths provides an elementary setting to tackle the problematics raised by Gromov on symmetry, probability, entropy [124]. Question: recently Baez and Fong published a Noether Theorem for Markov Processes [125]; can we derive a Noether theorem for random discrete processes in general, that is for all the symmetric group S n using the present construction?…”
Section: Information Paths Are Random Processes: Topological 2nd Law mentioning
confidence: 98%
“…We recall that a statistical manifold is a quadruple (M, g, ∇, ∇) such that ∇ and ∇ + are dual connections with respect to the metric g which are both torsion-free. These structures are of the utmost importance in information geometry [10,11], and are named after their appearance in statistical problems [12].…”
Section: Statistical Manifoldsmentioning
confidence: 99%
“…An important difference of all these treatments with the current one, is that as in the case of modern Algebraic Geometry (see, for instance, [18]) following pioneering ideas and proposals of A. Grothendieck, one has to allow for changes of the underlying field in all constructions, thus needing definitions which are "covariant" in a categorical sense. Indeed, there is suspicion that categorical constructions can be at the core of the formulation, and may play a considerable role in establishing and illuminating properties of the BGS entropy pertinent to physical systems [19,20].…”
Section: The τ Q -Fourier Transform: Motivation and Definitionmentioning
confidence: 99%
“…In (20), τ * q is the induced map from τ q to the topological dual space of R with respect to the Fourier pairing, the dual being also R. Notice that diagram ( 20) is heuristic; its role is to convey the idea of the τ q -Fourier transform versus the usual Fourier transform F, rather than being precise. In a more careful treatment, as in Subsection 3.2 below, let S q and S ′ q indicate the spaces of Schwartz functions and of tempered distributions over R q respectively.…”
Section: Introductionmentioning
confidence: 99%