Entropy and expansion (Q2028943): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 1811.09560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Processes on unimodular random networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gibbs measures over locally tree-like graphs and percolative entropy over infinite regular trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy inequalities for factors of IID / rank
 
Normal rank
Property / cites work
 
Property / cites work: On large‐girth regular graphs and random processes on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the almost eigenvectors of random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral measures of factor of i.i.d. processes on vertex-transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cubic graphs with small independence ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Independence Ratio of Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A measure-conjugacy invariant for free group actions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ergodic theory of free group actions: entropy and the \(f\)-invariant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some intersection theorems for ordered sets and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invariant Gaussian processes and independent sets on regular graphs of large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independence and chromatic numbers of random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits of local algorithms over sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mutual information decay for factors of i.i.d. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit isoperimetric constants and phase transitions in the random-cluster model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence ratio and random eigenvectors in transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isoperimetric Constants of (d,f)-Regular Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of regular graphs with large girth via local algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Replica bounds by combinatorial interpolation for diluted spin systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings as IID factors on non-amenable groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3786498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factor of IID Percolation on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local algorithms for independent sets are half-optimal / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3093486955 / rank
 
Normal rank

Latest revision as of 09:31, 30 July 2024

scientific article
Language Label Description Also known as
English
Entropy and expansion
scientific article

    Statements

    Entropy and expansion (English)
    0 references
    0 references
    0 references
    0 references
    3 June 2021
    0 references
    The well-known Shearer inequality says that the sum of joint entropies of random variables can be estimated by the total joint entropy. The authors' aim in this paper is to give an another lower bound for the same sum in terms of the individual entropies when the variables are functions of independent random seeds. This inequality involves a constant characterizing the expansion properties of the system. The results obtained generalize to entropy inequalities used in recent work in invariant settings, including the edge-vertex inequality for factor-of-IID processes, Bowen's entropy inequalities, and Bollobás's entropy bounds in random regular graphs. The method yields inequalities for other measures of randomness, including covariance. As an application, the authors also give upper bounds for independent sets in both finite and infinite graphs. The first section of the paper contains the preliminaries, the notation and also the terminology. In Section 2, entropy inequalities for a finite system of random variables are presented and proved, while in the third section the authors deal with the infinite case under the unimodularity condition. In the fourth section, possible generalizations and further perspectives are given, while in the last section some applications are discussed. For the reader's convenience they also include an Appendix with some definitions and lemmas regarding entropy and conditional entropy.
    0 references
    entropy inequality
    0 references
    expansion
    0 references
    Cheeger constant
    0 references
    graph isoperimetry
    0 references
    factor-of-IID
    0 references
    local algorithm
    0 references
    independent set
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references