Modeling Bipartite Graphs Using Hierarchical Structures

Bipartite networks are often used to capture the relationships between different classes of objects. To model the structure of bipartite networks, we propose a new hierarchical model based on a hierarchical random graph model originally designed for one-mode networks. The new model can better preserve the network fidelity as well as the assortative and disassortative structures of bipartite networks. We apply the proposed model on some paper-author networks in DBLP to find their optimal hierarchical structures. Using the optimal bipartite hierarchical structure, we regenerate networks that exhibit the similar network properties and degree distribution as the observed networks.

[1]  Garry Robins,et al.  Small Worlds Among Interlocking Directors: Network Structure and Distance in Bipartite Graphs , 2004, Comput. Math. Organ. Theory.

[2]  A. Rollett,et al.  The Monte Carlo Method , 2004 .

[3]  W. K. Hastings,et al.  Monte Carlo Sampling Methods Using Markov Chains and Their Applications , 1970 .

[4]  Jelena Grujic,et al.  Movies Recommendation Networks as Bipartite Graphs , 2008, ICCS.

[5]  Jon M. Kleinberg,et al.  The Web as a Graph: Measurements, Models, and Methods , 1999, COCOON.

[6]  M. Barber Modularity and community detection in bipartite networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  M E J Newman Assortative mixing in networks. , 2002, Physical review letters.

[8]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Inderjit S. Dhillon,et al.  Co-clustering documents and words using bipartite spectral graph partitioning , 2001, KDD '01.

[10]  M. Newman,et al.  Hierarchical structure and the prediction of missing links in networks , 2008, Nature.

[11]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[12]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[13]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .

[14]  Chris H. Q. Ding,et al.  Bipartite graph partitioning and data clustering , 2001, CIKM '01.

[15]  Duncan J. Watts,et al.  Six Degrees: The Science of a Connected Age , 2003 .

[16]  Jon M. Kleinberg,et al.  Feedback effects between similarity and social influence in online communities , 2008, KDD.

[17]  S. Chib,et al.  Understanding the Metropolis-Hastings Algorithm , 1995 .

[18]  Jure Leskovec,et al.  Statistical properties of community structure in large social and information networks , 2008, WWW.

[19]  Cristopher Moore,et al.  Structural Inference of Hierarchies in Networks , 2006, SNA@ICML.