Information theoretic comparison of stochastic graph models: Some experiments

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5427 LNCS, Issue , 2009, Pages 1-12

  Lang, Kevin J ^a  

^a YAHOO RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER STRUCTURES; COMMUNITY STRUCTURES; COMPLEX NETWORKS; DEGREE DISTRIBUTIONS; LARGE-SCALE EXPERIMENTS; Q MEASURES; RANDOM GRAPHS; SKEWED DEGREE DISTRIBUTIONS; STOCHASTIC GRAPHS;

EXPERIMENTS; GRAPH THEORY; INFORMATION THEORY; RANDOM PROCESSES;

STOCHASTIC MODELS;

EID: 61649092880     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-95995-3_1     Document Type: Conference Paper

References (11)

1. Chung, F., Lu, L.: Complex Graphs and Networks (Cbms Regional Conference Series in Mathematics). American Mathematical Society (August 2006)
2. Bezáková, I., Kalai, A., Santhanam, R.: Graph model selection using maximum like-lihood. In: ICML 2006: Proceedings of the 23rd international conference on Machine learning, pp. 105-112. ACM, New York (2006)
3. Rissanen, J.: Modelling by the shortest data description. Automatica 14, 465-471 (1978)
4. Chakrabarti, D., Papadimitriou, S., Modha, D.S., Faloutsos, C.: Fully automatic cross-associations. In: KDD 2004: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 79-88. ACM, New York (2004)
5. Rosvall, M., Bergstrom, C.T.: An information-theoretic framework for resolving community structure in complex networks. Proc. Natl. Acad. Sci. USA 104(18), 7327-7331 (2007)
6. Newman, M.E. J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69, 026113 (2004)
7. Guimera, R., Sales-Pardo, M., Amaral, L.A.N.: Modularity from fluctuations in random graphs and complex networks. Physical Review E 70, 025101 (2004)
8. Hofman, J.M., Wiggins, C.H.: A bayesian approach to network modularity. Physical Review Letters 100, 258701 (2008)
9. Boldi, P., Vigna, S.: The webgraph framework i: compression techniques. In: WWW 2004: Proceedings of the 13th international conference on World Wide Web, pp. 595-602. ACM, New York (2004)
10. Dhillon, I.S., Guan, Y., Kulis, B.: Weighted graph cuts without eigenvectors a multilevel approach. IEEE Trans. Pattern Anal. Mach. Intell. 29(11) (2007)
11. Blitzstein, J., Diaconis, P.: A sequential importance sampling algorithm for generating random graphs with prescribed degrees. Technical report, Stanford (2005)