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

Edge-independent random graphs are a model of random graphs in which each potential edge appears independently with an individual probability. Based on the relative entropy method, we determine the upper and lower bounds for the extremal vertex degrees using the edge probability matrix and its largest eigenvalue. Moreover, an application to random graphs with given expected degree sequences is presented.

[1]  A. Rinaldo,et al.  Consistency of spectral clustering in stochastic block models , 2013, 1312.2050.

[2]  Qing Zhou,et al.  Consensus and synchronization problems on small-world networks , 2010 .

[3]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[4]  F. Chung,et al.  Connected Components in Random Graphs with Given Expected Degree Sequences , 2002 .

[5]  Yilun Shang.  A Note on the Warmth of Random Graphs with Given Expected Degrees , 2014, Int. J. Math. Math. Sci..

[6]  Yilun Shang.  Non-Hyperbolicity of Random Graphs with Given Expected Degrees , 2013 .

[7]  Karl-Heinz Hoffmann,et al.  Time Evolution of Relative Entropies for Anomalous Diffusion , 2013, Entropy.

[8]  Y. Shang,et al.  A sharp threshold for rainbow connection in small-world networks , 2012 .

[9]  Béla Bollobás,et al.  Random Graphs , 1985 .

[10]  Ling-Yan Hung,et al.  Relative entropy and holography , 2013, 1305.3182.

[11]  Shan Gao,et al.  A Pilot Directional Protection for HVDC Transmission Line Based on Relative Entropy of Wavelet Energy , 2015, Entropy.

[12]  V. Vedral.  The role of relative entropy in quantum information theory , 2001, quant-ph/0102094.

[13]  Lawrence S. Schulman,et al.  Relative Entropy, Interaction Energy and the Nature of Dissipation , 2014, Entropy.

[14]  Can M. Le,et al.  Concentration and regularization of random graphs , 2015, Random Struct. Algorithms.

[15]  Ali Mohammad-Djafari,et al.  Entropy, Information Theory, Information Geometry and Bayesian Inference in Data, Signal and Image Processing and Inverse Problems , 2015, Entropy.

[16]  Anup Rao,et al.  Stochastic Block Model and Community Detection in Sparse Graphs: A spectral algorithm with optimal rate of recovery , 2015, COLT.

[17]  Emmanuel Abbe,et al.  Community Detection in General Stochastic Block models: Fundamental Limits and Efficient Algorithms for Recovery , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[18]  Franck Vermet,et al.  Capacity of an associative memory model on random graph architectures , 2013, 1303.4542.

[19]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[20]  F. Chung,et al.  Complex Graphs and Networks , 2006 .

[21]  Linyuan Lu,et al.  Spectra of Edge-Independent Random Graphs , 2012, Electron. J. Comb..

[22]  Yilun Shang,et al.  Estrada and L-Estrada Indices of Edge-Independent Random Graphs , 2015, Symmetry.

[23]  Bertrand Lods,et al.  Information Geometry Formalism for the Spatially Homogeneous Boltzmann Equation , 2015, Entropy.