Login / Signup
An Information-Theoretic Proof of a Bound on the Number of Independent Sets in Bipartite Graphs.
Igal Sason
Published in:
CoRR (2020)
Keyphrases
</>
information theoretic
bipartite graph
mutual information
information theory
theoretic framework
log likelihood
kullback leibler divergence
information theoretic measures
machine learning
graph clustering
minimum description length
information bottleneck
jensen shannon divergence