Projecting signed two-mode networks

References

• Abelson, R. P., & Rosenberg, M. J. (1958). Symbolic psycho-logic: A model of attitudinal cognition. Behavioral Science, 3(1), 1–13. doi:10.1002/bs.3830030102
   Google Scholar
• Akbaria, S., Maimanib, H., & Majdb, L. P. (2018). On the spectrum of some signed complete and complete bipartite graphs. Filomat, 32(17), 5817–5826. doi:10.2298/FIL1817817A
   Web of Science ®Google Scholar
• Aref, S., & Wilson, M. C. (2018). Measuring partial balance in signed networks. Journal of Complex Networks, 6(4), 566–595. doi:10.1093/comnet/cnx044
   Web of Science ®Google Scholar
• Batagelj, V. (1994). Semirings for social networks analysis. The Journal of Mathematical Sociology, 19(1), 53–68. doi:10.1080/0022250X.1994.9990135
   Web of Science ®Google Scholar
• Bonacich, P. (1972). Factoring and weighting approaches to status scores and clique identification. The Journal of Mathematical Sociology, 2(1), 113–120. doi:10.1080/0022250X.1972.9989806
   Web of Science ®Google Scholar
• Bonacich, P., & Lloyd, P. (2004). Calculating status with negative relations. Social Networks, 26(4), 331–338. doi:10.1016/j.socnet.2004.08.007
   Web of Science ®Google Scholar
• Borgatti, S., & Halgin, D. (2011). Analyzing affiliation networks. The Sage Handbook of Social Network Analysis, 1, 417–433.
   Google Scholar
• Brandes, U., Kenis, P., Lerner, J., & Van Raaij, D. (2009). Network analysis of collaboration structure in Wikipedia. Proceedings of the 18th International Conference on World Wide Web (pp. 731–740). Madrid, Spain: ACM. doi:10.1111/j.1399-6576.2008.01901.x
   Google Scholar
• Brandes, U., & Lerner, J. (2008). Visual analysis of controversy in user-generated encyclopedias. Information Visualization, 7(1), 34–48. doi:10.1057/palgrave.ivs.9500171
   Web of Science ®Google Scholar
• Cartwright, D., & Harary, F. (1956). Structural balance: A generalization of Heider’s theory. Psychological Review, 63(5), 277. doi:10.1037/h0046049
   PubMed Web of Science ®Google Scholar
• Cartwright, D., & Harary, F. (1970). Ambivalence and indifference in generalizations of structural balance. Behavioral Science, 15(6). doi:10.1002/bs.3830150604
   Google Scholar
• Cucuringu, M., Li, H., Sun, H., & Zanetti, L. (2019). Hermitian matrices for clustering directed graphs: Insights and applications. arXiv:1908.02096 [Cs, Stat].
   Google Scholar
• Davis, J. A. (1967). Clustering and structural balance in graphs. Human Relations, 20(2), 181–187. doi:10.1177/001872676702000206
   Web of Science ®Google Scholar
• Doreian, P. (2004). Evolution of human signed networks. Metodoloski Zvezki, 1(2), 277–293.
   Google Scholar
• Doreian, P. (2008). A multiple indicator approach to blockmodeling signed networks. Social Networks, 30(3), 247–258. doi:10.1016/j.socnet.2008.03.005
   Web of Science ®Google Scholar
• Doreian, P. (2017). Reflections on studying signed networks. Journal of Interdisciplinary Methodologies and Issues in Science, Graphs and Social Systems.
   Google Scholar
• Doreian, P., Kapuscinski, R., Krackhardt, D., & Szczypula, J. (1996). A brief history of balance through time. The Journal of Mathematical Sociology, 21(1–2), 113–131. doi:10.1080/0022250X.1996.9990176
   Web of Science ®Google Scholar
• Doreian, P., Lloyd, P., & Mrvar, A. (2013). Partitioning large signed two-mode networks: Problems and prospects. Social Networks, 35(2), 178–203. doi:10.1016/j.socnet.2012.01.002
   Web of Science ®Google Scholar
• Doreian, P., & Mrvar, A. (1996). A partitioning approach to structural balance. Social Networks, 18(2), 149–168. doi:10.1016/0378-8733(95)00259-6
   Web of Science ®Google Scholar
• Doreian, P., & Mrvar, A. (2009). Partitioning signed social networks. Social Networks, 31(1), 1–11. doi:10.1016/j.socnet.2008.08.001
   Web of Science ®Google Scholar
• Doreian, P., & Mrvar, A. (2015). Structural balance and signed international relations. Journal of Social Structure, 16, 1. doi:10.21307/joss-2019-012
   Google Scholar
• Estrada, E. (2019). Rethinking structural balance in signed social networks. Discrete Applied Mathematics, 268, 70–90. doi:10.1016/j.dam.2019.04.019
   Web of Science ®Google Scholar
• Estrada, E., & Benzi, M. (2014). Walk-based measure of balance in signed networks: Detecting lack of balance in social networks. Physical Review E, 90(4), 042802. doi:10.1103/PhysRevE.90.042802
   Web of Science ®Google Scholar
• Everett, M. G., & Borgatti, S. P. (2013). The dual-projection approach for two-mode networks. Social Networks, 35(2), 204–210. doi:10.1016/j.socnet.2012.05.004
   Web of Science ®Google Scholar
• Everett, M. G., & Borgatti, S. P. (2014). Networks containing negative ties. Social Networks, 38, 111–120. doi:10.1016/j.socnet.2014.03.005
   Web of Science ®Google Scholar
• Facchetti, G., Iacono, G., & Altafini, C. (2011). Computing global structural balance in large-scale signed social networks. Proceedings of the National Academy of Sciences, 108(52), 20953–20958. doi:10.1073/pnas.1109521108
   PubMed Web of Science ®Google Scholar
• Giscard, P.-L., Rochet, P., & Wilson, R. (2017). Evaluating balance on social networks from their simple cycles. Journal of Complex Networks, 5(5), 750–775.
   Web of Science ®Google Scholar
• Guo, K., & Mohar, B. (2017). Hermitian adjacency matrix of digraphs and mixed graphs. Journal of Graph Theory, 85(1), 217–248. doi:10.1002/jgt.2017.85.issue-1
   Web of Science ®Google Scholar
• Heider, F. (1946). Attitudes and cognitive organization. The Journal of Psychology, 21(1), 107–112. doi:10.1080/00223980.1946.9917275
   PubMed Web of Science ®Google Scholar
• Horvát, E.-Á., & Zweig, K. A. (2013). A fixed degree sequence model for the one-mode projection of multiplex bipartite graphs. Social Network Analysis and Mining, 3(4), 1209–1224. doi:10.1007/s13278-013-0133-9
   Google Scholar
• Hou, Y., Li, J., & Pan, Y. (2003). On the Laplacian Eigenvalues of signed graphs. Linear and Multilinear Algebra, 51(1), 21–30. doi:10.1080/0308108031000053611
   Web of Science ®Google Scholar
• Kamvar, S. D., Schlosser, M. T., & Garcia-Molina, H. (2003). The Eigentrust algorithm for reputation management in P2P networks. Proceedings of the 12th International Conference on World Wide Web, WWW ’03 (pp. 640–651). New York, NY: ACM. doi:10.1023/b:rubi.0000008900.54667.d9
   Google Scholar
• Kerchove, C., & Dooren, P. (2008). The PageTrust algorithm: How to rank web pages when negative links are allowed? Proceedings of the 2008 SIAM International Conference on Data Mining, Proceedings (pp. 346–352). Society for Industrial and Applied Mathematics Atlanta, Georgia, USA.
   Google Scholar
• Kirkley, A., Cantwell, G. T., & Newman, M. E. J. (2019). Balance in signed networks. Physical Review E, 99(1). doi:10.1103/PhysRevE.99.012320
   PubMed Web of Science ®Google Scholar
• Kittur, A., Suh, B., Pendleton, B. A., & Chi, E. H. (2007). He says, she says: Conflict and coordination in Wikipedia. Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, CHI ’07 (pp. 453–462). New York, NY: ACM.
   Google Scholar
• Kunegis, J., Lommatzsch, A., & Bauckhage, C. (2009). The Slashdot zoo: Mining a social network with negative edges. In Proceedings of the 18th International Conference on World Wide Web, WWW ’09 (pp. 741–750). New York, NY: ACM. doi:10.1098/rsif.2009.0331
   Google Scholar
• Kunegis, J., Schmidt, S., Lommatzsch, A., Lerner, J., De Luca, E., & Albayrak, S. (2010). Spectral analysis of signed graphs for clustering, prediction and visualization. Proceedings of the 2010 SIAM International Conference on Data Mining, Proceedings (pp. 559–570). Society for Industrial and Applied Mathematics Columbus,Ohio,USA.
   Google Scholar
• Leskovec, J., Huttenlocher, D., & Kleinberg, J. (2010). Signed networks in social media. Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, CHI ’10 (pp. 1361–1370) Atlanta, Georgia, USA.
   Google Scholar
• Ma, L., Gong, M., Du, H., Shen, B., & Jiao, L. (2015). A memetic algorithm for computing and transforming structural balance in signed networks. Knowledge-Based Systems, 85, 196–209. doi:10.1016/j.knosys.2015.05.006
   Web of Science ®Google Scholar
• Ma, L., Gong, M., Yan, J., Yuan, F., & Du, H. (2017). A decomposition-based multi-objective optimization for simultaneous balance computation and transformation in signed networks. Information Sciences, 378, 144–160. doi:10.1016/j.ins.2016.10.035
   Web of Science ®Google Scholar
• Marvel, S. A., Strogatz, S. H., & Kleinberg, J. M. (2009). Energy landscape of social balance. Physical Review Letters, 103(19), 198701. doi:10.1103/PhysRevLett.103.198701
   PubMed Web of Science ®Google Scholar
• Mohar, B. (2016). Hermitian adjacency spectrum and switching equivalence of mixed graphs. Linear Algebra and Its Applications, 489, 324–340. doi:10.1016/j.laa.2015.10.018
   Web of Science ®Google Scholar
• Moore, M. (1979). Structural balance and international relations. European Journal of Social Psychology, 9(3), 323–326. doi:10.1002/(ISSN)1099-0992
   Web of Science ®Google Scholar
• Neal, Z. P. (2014). The backbone of bipartite projections: Inferring relationships from co-authorship, co-sponsorship, co-attendance and other co-behaviors. Social Networks, 39, 84–97. doi:10.1016/j.socnet.2014.06.001
   Web of Science ®Google Scholar
• Serrano, M. Á., Boguñá, M., & Vespignani, A. (2009). Extracting the multiscale backbone of complex weighted networks. Proceedings of the National Academy of Sciences, 106(16), 6483–6488. doi:10.1073/pnas.0808904106
   PubMed Web of Science ®Google Scholar
• Terzi, E., & Winkler, M. (2011). A spectral algorithm for computing social balance. In A. Frieze, P. Horn, & P. Prałat (Eds.), Algorithms and models for the web graph, Lecture Notes in Computer Science. (pp. 1–13). Berlin Heidelberg, Germany: Springer.
   Google Scholar
• Traag, V. A., Nesterov, Y. E., & Van Dooren, P. (2010). Exponential ranking: Taking into account negative links. In L. Bolc, M. Makowski, & A. Wierzbicki (Eds.), Social informatics, Lecture Notes in Computer Science. (pp. 192–202). Berlin Heidelberg, Germany: Springer.
   Google Scholar
• Wu, Z., Aggarwal, C. C., & Sun, J. (2016). The troll-trust model for ranking in signed networks. Proceedings of the Ninth ACM International Conference on Web Search and Data Mining, WSDM ’16 (pp. 447–456). New York, NY: ACM.
   Google Scholar
• Yu, G., & Qu, H. (2015). Hermitian Laplacian matrix and positive of mixed graphs. Applied Mathematics and Computation, 269, 70–76. doi:10.1016/j.amc.2015.07.045
   Web of Science ®Google Scholar
• Zweig, K. A., & Kaufmann, M. (2011). A systematic approach to the one-mode projection of bipartite graphs. Social Network Analysis and Mining, 1(3), 187–218. doi:10.1007/s13278-011-0021-0
   Google Scholar