Cover Image

The Sharma-Mittal Entropy is Subadditive and Supermodular on the Majorization Lattice

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bruno, Roberto, Vaccaro, Ugo
Format:	Preprint
Published:	2026
Subjects:	Information Theory Combinatorics Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Geometry of Rényi Entropy on the Majorization Lattice
by: Yadav, Anuj Kumar, et al.
Published: (2026)

A Note on Equivalent Conditions for Majorization
by: Bruno, Roberto, et al.
Published: (2024)

Bernoulli sums and Rényi entropy inequalities
by: Madiman, Mokshay, et al.
Published: (2021)

Information Inequalities for Joint Distributions, with Interpretations and Applications
by: Madiman, Mokshay, et al.
Published: (2008)

Individual testing is optimal for nonadaptive group testing in the linear regime
by: Aldridge, Matthew
Published: (2018)

Equal Requests are Asymptotically Hardest for Data Recovery
by: Lember, Jüri, et al.
Published: (2024)

Subadditivity of the log-Sobolev constant on convolutions
by: Courtade, Thomas A., et al.
Published: (2025)

Entropic Bounds on the Average Length of Codes with a Space
by: Bruno, Roberto, et al.
Published: (2024)

Quantifying Multivariate Graph Dependencies: Theory and Estimation for Multiplex Graphs
by: Skeja, Anda, et al.
Published: (2024)

Partial and Exact Recovery of a Random Hypergraph from its Graph Projection
by: Bresler, Guy, et al.
Published: (2025)

Talagrand-Type Correlation Inequalities for Submodular and Supermodular Functions on the Hypercube
by: Chang, Fan, et al.
Published: (2025)

Weak recovery, hypothesis testing, and mutual information in stochastic block models and planted factor graphs
by: Mossel, Elchanan, et al.
Published: (2024)

Recoverable systems and the maximal hard-core model on the triangular lattice
by: Wang, Geyang, et al.
Published: (2026)

Graphs of Joint Types, Noninteractive Simulation, and Stronger Hypercontractivity
by: Yu, Lei, et al.
Published: (2021)

Parsings of Stationary Processes, Stopping Times and the Fundamental Pointwise Convergence Theorems of Ergodic Theory
by: Tal, Matan
Published: (2025)

Smoothed Analysis of the Komlós Conjecture: Rademacher Noise
by: Aigner-Horev, Elad, et al.
Published: (2023)

Sample Complexity of Low-rank Tensor Recovery from Uniformly Random Entries
by: Hamaguchi, Hiroki, et al.
Published: (2024)

Rényi--Sobolev Inequalities and Connections to Spectral Graph Theory
by: Yu, Lei, et al.
Published: (2023)

The maximal hard-core model as a recoverable system: Gibbs measures and phase coexistence
by: Wang, Geyang, et al.
Published: (2025)

Resilience of Rademacher chaos of low degree
by: Aigner-Horev, Elad, et al.
Published: (2024)

Randomstrasse101: Open Problems of 2025
by: Bandeira, Afonso S., et al.
Published: (2026)

Randomstrasse101: Open Problems of 2024
by: Bandeira, Afonso S., et al.
Published: (2025)

The Fundamental Limits of Recovering Planted Subgraphs
by: Lee, Daniel, et al.
Published: (2025)

Detecting Arbitrary Planted Subgraphs in Random Graphs
by: Elimelech, Dor, et al.
Published: (2025)

A Quantitative Entropy Power Inequality for Dependent Random Vectors
by: Madiman, Mokshay, et al.
Published: (2025)

The Random Subsequence Model and Uniform Codes for the Deletion Channel
by: Jeong, Ryan, et al.
Published: (2026)

Old and New Results on Alphabetic Codes
by: Bruno, Roberto, et al.
Published: (2025)

Optimal Binary Variable-Length Codes with a Bounded Number of 1's per Codeword: Design, Analysis, and Applications
by: Bruno, Roberto, et al.
Published: (2025)

A Method for Generating Connected Erdos-Renyi Random Graphs
by: Chinyaev, Boris
Published: (2025)

Multiplexons: Limits of Multiplex Networks
by: Ganguly, Ankan, et al.
Published: (2025)

Similarity-Sensitive Entropy under Representation Change and Inference
by: Miller, Joseph Samuel
Published: (2026)

Modularity and partially observed graphs
by: McDiarmid, Colin, et al.
Published: (2021)

Whitney Numbers of Rank-Metric Lattices and Code Enumeration
by: Cotardo, Giuseppe, et al.
Published: (2024)

Entropy Jump and Entropic Central Limit Theorem for Independent Sum
by: Yao, Liuquan, et al.
Published: (2024)

Matroidal Entropy Functions: Constructions, Characterizations and Representations
by: Chen, Qi, et al.
Published: (2023)

Majority-Logic Decoding of Binary Locally Recoverable Codes: A Probabilistic Analysis
by: Ly, Hoang, et al.
Published: (2026)

Entropy of Exchangeable Random Graphs
by: Skeja, Anda, et al.
Published: (2023)

Entropy and Distributed Source Coding of Connected Soft Random Geometric Graphs
by: Baker, Oliver, et al.
Published: (2026)

Entropy Contractions in Markov Chains: Half-Step, Full-Step and Continuous-Time
by: Caputo, Pietro, et al.
Published: (2024)

Majority dynamics on finite trees
by: Benjamini, Itai, et al.
Published: (2025)