On the difficulty of learning power law graphical models

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2013, Pages 2493-2497

  Tandon, Rashish ^a   Ravikumar, Pradeep ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DEGREE DISTRIBUTIONS; GRAPHICAL MODEL; INFORMATION-THEORETIC LOWER BOUNDS; MARKOV GRAPH; POWER-LAW; POWER-LAW GRAPH; SAMPLE COMPLEXITY; STATE OF THE ART;

GRAPHIC METHODS; INFORMATION THEORY;

GRAPH THEORY;

EID: 84890384486     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2013.6620675     Document Type: Conference Paper

References (19)

1. A. Barabasi and R. Albert, "Emergence of scaling in random networks," Science, vol. 286, no. 5439, pp. 509-512, 1999.
2. F. Chung and L. Lu, Complex Graphs and Networks. American Mathematical Society, Aug. 2006.
3. M. Faloutsos, P. Faloutsos, and C. Faloutsos, "On power-law relationships of the internet topology," SIGCOMM Comput. Commun. Rev., vol. 29, no. 4, pp. 251-262, Aug. 1999.
4. S. N. Dorogovtsev and J. F. F. Mendes, "Scaling properties of scale-free evolving networks: continuous approach," Phys. Rev. E, vol. 63, Apr 2001.
5. D. J. Watts and S. H. Strogatz, "Collective dynamics of 'small-world' networks," Nature, vol. 393, no. 6684, pp. 440-442, Jun. 1998.
6. P. Ravikumar, M. J. Wainwright, and J. Lafferty, "High-dimensional ising model selection using -1-regularized logistic regression," Annals of Statistics, vol. 38, no. 3, pp. 1287-1319, 2010.
7. A. Jalali, C. C. Johnson, and P. K. Ravikumar, "On learning discrete graphical models using greedy methods," in Advances in Neural Information Processing Systems 24, 2011, pp. 1935-1943.
8. N. Meinshausen and P. Buhlmann, "High-dimensional graphs and variable selection with the Lasso," Annals of Statistics, vol. 34, pp. 1436-1462, 2006.
9. A. Anandkumar, V. Y. F. Tan, and A. Willsky, "High-Dimensional Structure Learning of Ising Models : Local Separation Criterion," Preprint, June 2011.
10. Q. Liu and A. T. Ihler, "Learning scale free networks by reweighted l1 regularization," Journal of Machine Learning Research-Proceedings Track, vol. 15, pp. 40-48, 2011.
11. A. Defazio and T. Caetano, "A convex formulation for learning scale-free networks via submodular relaxation," in Advances in Neural Information Processing Systems 24, 2012.
12. F. Chung and L. Lu, "Connected components in random graphs with given expected degree sequences," Annals of Combinatorics, vol. 6, no. 2, pp. 125-145, 2002.
13. W. Aiello, F. Chung, and L. Lu, "A random graph model for power law graphs," Experimental Math, vol. 10, pp. 53-66, 2000.
14. B. Bollobas, Random Graphs, W. Fulton, A. Katok, F. Kirwan, P. Sarnak, B. Simon, and B. Totaro, Eds. Cambridge University Press, 2001.
15. P. Erdos and A. Renyi, "On the evolution of random graphs," Evolution, vol. 5, no. 1, pp. 17-61, 1960.
16. R. Tandon and P. Ravikumar, "On the difficulty of learning power law graphical models : Proofs." [Online]. Available: http://www.cs.utexas.edu/ -rashish/plgm-proofs.pdf
17. G. Bresler, E. Mossel, and A. Sly, "Reconstruction of markov random fields from samples: Some observations and algorithms," in APPROX. Springer-Verlag, 2008, pp. 343-356.
18. B. D. McKay and N. C. Wormald, "Asymptotic enumeration by degree sequence of graphs with degress o(n1/2)," Combinatorica, vol. 11, no. 4, pp. 369-382, 1991.
19. T. M. Cover and J. A. Thomas, Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing). Wiley-Interscience, 2006