Hypergraphs, entropy, and inequalities
From MaRDI portal
Publication:3563750
DOI10.2307/4145187zbMATH Open1187.94017OpenAlexW4245652633MaRDI QIDQ3563750FDOQ3563750
Publication date: 1 June 2010
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/4145187
Recommendations
Measures of information, entropy (94A17) Inequalities for sums, series and integrals (26D15) General histories, source books (01A05)
Cited In (28)
- Functional analysis on hypergraphs: density and zeta functions -- applications to molecular graphs and image analysis
- An entropic proof of cutoff on Ramanujan graphs
- On replica symmetry of large deviations in random graphs
- Limit theorems for additive functionals of stationary fields, under integrability assumptions on the higher order spectral densities
- The number of independent sets in an irregular graph
- Matchings and independent sets of a fixed size in regular graphs
- An Entropy-Based Proof for the Moore Bound for Irregular Graphs
- A fourth‐moment phenomenon for asymptotic normality of monochromatic subgraphs
- A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure
- On the Inequalities of Projected Volumes and the Constructible Region
- Graph properties, graph limits, and entropy
- Diversities and the Geometry of Hypergraphs
- On a Szegö type limit theorem, the Hölder-Young-Brascamp-Lieb inequality, and the asymptotic theory of integrals and quadratic forms of stationary fields
- Proof of a hypercontractive estimate via entropy
- Randomly colouring graphs (a combinatorial view)
- A tail bound for read-kfamilies of functions
- Normal approximation and fourth moment theorems for monochromatic triangles
- Entropy and isoperimetry for linear and non-linear group actions.
- Extremal Regular Graphs: Independent Sets and Graph Homomorphisms
- Entropy and set cardinality inequalities for partition-determined functions
- The homomorphism domination exponent
- Entropy production in nonlinear recombination models
- Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function
- LOW-DEGREE BOOLEAN FUNCTIONS ON , WITH AN APPLICATION TO ISOPERIMETRY
- Geometric stability via information theory
- On the Shannon entropy of the number of vertices with zero in-degree in randomly oriented hypergraphs
- Extremality of graph entropy based on degrees of uniform hypergraphs with few edges
- Entropy of Digraphs and Infinite Networks
This page was built for publication: Hypergraphs, entropy, and inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3563750)
