On the number of graphs with a given histogram

DOI10.1109/TIT.2023.3296827MaRDI QIDQ6575528zbMATH OpenFDO

Authors Shahar Stein Ioushua, Ofer Shayevitz

Publication date 21 July 2024

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2023.3296827

zbMATH Keywords

empirical distributionKolmogorov-Smirnov distancemaximum entropy problem on random graphsnumber of graphsupper and lower bounds

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Measures of information, entropy (94A17)

This page was built for publication: On the number of graphs with a given histogram

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575528)