2000
DOI: 10.1007/978-94-015-9496-7
|View full text |Cite
|
Sign up to set email alerts
|

Maximum Entropy, Information Without Probability and Complex Fractals

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
55
0
1

Year Published

2003
2003
2021
2021

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 47 publications
(56 citation statements)
references
References 0 publications
0
55
0
1
Order By: Relevance
“…This ensemble differs from the GOE and from the other known ensembles of the random matrix theory. This new ensemble is constructed using the maximum entropy principle [31][32][33][34] which allows the probability distribution of positive symmetric real random matrices to be constructed using only the available information. In order to improve the readability of this paper, one recalls fundamentals of the non-parametric model of random uncertainties introduced in the papers mentioned above.…”
Section: Introductionmentioning
confidence: 99%
“…This ensemble differs from the GOE and from the other known ensembles of the random matrix theory. This new ensemble is constructed using the maximum entropy principle [31][32][33][34] which allows the probability distribution of positive symmetric real random matrices to be constructed using only the available information. In order to improve the readability of this paper, one recalls fundamentals of the non-parametric model of random uncertainties introduced in the papers mentioned above.…”
Section: Introductionmentioning
confidence: 99%
“…It suffices to start out with a general divergence function on X ⊗ Y in order for the construction to make sense. When the construction is based on a general divergence function D, we refer to (14) as the updating triple generated by D and with y 0 as prior. For these updating triples, we take y 0 as the only certain belief instance.…”
Section: Relativization Updatingmentioning
confidence: 99%
“…To emphasize this, we introduce, based only on a general divergence function D, the effort-based information triple associated with (14) as the triple…”
Section: Relativization Updatingmentioning
confidence: 99%
See 1 more Smart Citation
“…In Refs. [74,75,81], we introduced the ensemble SG + of the random matrices [G n ], defined on a probability space (Θ, T , P ) with values in Å + n (Ê), whose probability distribution was constructed by using the entropy optimization principle [65,34,36,37] C. Soize -CMAME -revised version December 2004 with the constraints defined by the following available information: [G n ] is a symmetric positivedefinite real random matrix whose mean value is the identity matrix and for which the second-order moment of the random variable [G n ] −1 F is finite. The probability distribution P [G n ] on Å + n (Ê) of such a random matrix [G n ] was explicitly constructed and depends only on dimension n and a positive real parameter δ independent of n and allowing the dispersion of random matrix [G n ] to be controlled.…”
Section: Principle Of the Constructionmentioning
confidence: 99%