Bounding Extremal Degrees of Edge-Independent Random Graphs Using Relative Entropy.

Published in: Entropy (2016)

Keyphrases

relative entropy
random graphs
undirected graph
information theoretic
information theory
graph theoretic
mutual information
log likelihood
covariance matrix
phase transition
graph theory
bregman divergences
upper bound
edge detection
kullback leibler divergence
mahalanobis distance
weighted graph
directed graph