Signed Network Modeling Based on Structural Balance Theory

The modeling of networks, specifically generative models, has been shown to provide a plethora of information about the underlying network structures, as well as many other benefits behind their construction. There has been a considerable increase in interest for the better understanding and modeling of networks, and the vast majority of existing work has been for unsigned networks. However, many networks can have positive and negative links (or signed networks), especially in online social media. It is evident from recent work that signed networks present unique properties and principles from unsigned networks due to the added complexity, which pose tremendous challenges on existing unsigned network models. Hence, in this paper, we investigate the problem of modeling signed networks. In particular, we provide a principled approach to capture important properties and principles of signed networks and propose a novel signed network model guided by Structural Balance Theory. Empirical experiments on three real-world signed networks demonstrate the effectiveness of the proposed model.

[1]  Razvan Pascanu,et al.  Learning Deep Generative Models of Graphs , 2018, ICLR 2018.

[2]  Riste Skrekovski,et al.  Modeling acquaintance networks based on balance theory , 2014, Int. J. Appl. Math. Comput. Sci..

[3]  Peter Abell,et al.  An evolutionary model of social networks , 2007 .

[4]  F. Heider.  Attitudes and cognitive organization. , 1946, The Journal of psychology.

[5]  Charu C. Aggarwal,et al.  Signed Network Embedding in Social Media , 2017, SDM.

[6]  Huan Liu,et al.  Is distrust the negation of trust?: the value of distrust in social media , 2014, HT.

[7]  F. Harary,et al.  STRUCTURAL BALANCE: A GENERALIZATION OF HEIDER'S THEORY1 , 1977 .

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

[9]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[10]  Ghazaleh Beigi,et al.  Signed Link Analysis in Social Media Networks , 2016, ICWSM.

[11]  Mohammad Malekzadeh,et al.  Social balance and signed network formation games , 2011 .

[12]  L. Meyers,et al.  Susceptible–infected–recovered epidemics in dynamic contact networks , 2007, Proceedings of the Royal Society B: Biological Sciences.

[13]  Jure Leskovec,et al.  Predicting positive and negative links in online social networks , 2010, WWW '10.

[14]  Jure Leskovec,et al.  Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters , 2008, Internet Math..

[15]  Christos Faloutsos,et al.  Edge Weight Prediction in Weighted Signed Networks , 2016, 2016 IEEE 16th International Conference on Data Mining (ICDM).

[16]  A. Barabasi,et al.  Network biology: understanding the cell's functional organization , 2004, Nature Reviews Genetics.

[17]  Jure Leskovec,et al.  Signed networks in social media , 2010, CHI.

[18]  Charu C. Aggarwal,et al.  A Survey of Signed Network Mining in Social Media , 2015, ACM Comput. Surv..

[19]  Jiliang Tang,et al.  Signed Graph Convolutional Network , 2018, ArXiv.

[20]  Jure Leskovec,et al.  Learning to Discover Social Circles in Ego Networks , 2012, NIPS.

[21]  Christos Faloutsos,et al.  Kronecker Graphs: An Approach to Modeling Networks , 2008, J. Mach. Learn. Res..

[22]  Jure Leskovec,et al.  GraphRNN: A Deep Generative Model for Graphs , 2018, ICML 2018.

[23]  Christos Faloutsos,et al.  Graphs over time: densification laws, shrinking diameters and possible explanations , 2005, KDD '05.

[24]  F. Chung,et al.  The average distances in random graphs with given expected degrees , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[25]  Michael Szell,et al.  Multirelational organization of large-scale social networks in an online world , 2010, Proceedings of the National Academy of Sciences.

[26]  Nicola De Cao,et al.  MolGAN: An implicit generative model for small molecular graphs , 2018, ArXiv.

[27]  Wei Chen,et al.  Influence diffusion dynamics and influence maximization in social networks with friend and foe relationships , 2011, WSDM.

[28]  Jennifer Neville,et al.  Incorporating Assortativity and Degree Dependence into Scalable Network Models , 2015, AAAI.

[29]  Jiliang Tang,et al.  Link and interaction polarity predictions in signed networks , 2018, Social Network Analysis and Mining.

[30]  Tamara G. Kolda,et al.  Community structure and scale-free collections of Erdös-Rényi graphs , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[31]  Tyler Derr.  Relevance Measurements in Online Signed Social Networks , 2018 .

[32]  Stefano Ermon,et al.  Graphite: Iterative Generative Modeling of Graphs , 2018, ICML.

[33]  Minyi Guo,et al.  SHINE: Signed Heterogeneous Information Network Embedding for Sentiment Link Prediction , 2017, WSDM.

[34]  Beom Jun Kim,et al.  Growing scale-free networks with tunable clustering. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[36]  Dorothea Wagner,et al.  Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study , 2005, WEA.

[37]  Tamara G. Kolda,et al.  The Similarity Between Stochastic Kronecker and Chung-Lu Graph Models , 2011, SDM.

[38]  Jennifer Neville,et al.  Fast Generation of Large Scale Social Networks While Incorporating Transitive Closures , 2012, 2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing.