Multilayer network simplification: approaches, models and methods

Abstract Multilayer networks have been widely used to represent and analyze systems of interconnected entities where both the entities and their connections can be of different types. However, real multilayer networks can be difficult to analyze because of irrelevant information, such as layers not related to the objective of the analysis, because of their size, or because traditional methods defined to analyze simple networks do not have a straightforward extension able to handle multiple layers. Therefore, a number of methods have been devised in the literature to simplify multilayer networks with the objective of improving our ability to analyze them. In this article we provide a unified and practical taxonomy of existing simplification approaches, and we identify categories of multilayer network simplification methods that are still underdeveloped, as well as emerging trends.

[1]  Enhong Chen,et al.  Learning Deep Representations for Graph Clustering , 2014, AAAI.

[2]  Jeffrey Dean,et al.  Efficient Estimation of Word Representations in Vector Space , 2013, ICLR.

[3]  Tore Opsahl,et al.  For the few not the many? The effects of affirmative action on presence, prominence, and social capital of women directors in Norway , 2011 .

[4]  Dino Ienco,et al.  Local community detection in multilayer networks , 2016, Data Mining and Knowledge Discovery.

[5]  Jeffrey Dean,et al.  Distributed Representations of Words and Phrases and their Compositionality , 2013, NIPS.

[6]  Santo Fortunato,et al.  Information filtering in complex weighted networks , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  Minas Gjoka,et al.  Multigraph Sampling of Online Social Networks , 2010, IEEE Journal on Selected Areas in Communications.

[8]  Andrea Tagarelli,et al.  Consensus Community Detection in Multilayer Networks using Parameter-free Graph Pruning , 2018, PAKDD.

[9]  Tore Opsahl.  Triadic closure in two-mode networks: Redefining the global and local clustering coefficients , 2013, Soc. Networks.

[10]  Satoru Kawai,et al.  An Algorithm for Drawing General Undirected Graphs , 1989, Inf. Process. Lett..

[11]  Vito Latora,et al.  Structural reducibility of multilayer networks , 2015, Nature Communications.

[12]  M. Newman,et al.  Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  Jian Pei,et al.  Community Preserving Network Embedding , 2017, AAAI.

[14]  Matteo Magnani,et al.  Finding overlapping communities in multiplex networks , 2016, ArXiv.

[15]  Meng Wang,et al.  Learning content–social influential features for influence analysis , 2016, International Journal of Multimedia Information Retrieval.

[16]  Tiago P. Peixoto.  Bayesian Stochastic Blockmodeling , 2017, Advances in Network Clustering and Blockmodeling.

[17]  Christos Faloutsos,et al.  Sampling from large graphs , 2006, KDD '06.

[18]  K. Fuast.  Comparison of methods for positional analysis: Structural and general equivalences , 1988 .

[19]  Mason A. Porter,et al.  Multilayer networks , 2013, J. Complex Networks.

[20]  Peter Sanders,et al.  Advanced Coarsening Schemes for Graph Partitioning , 2012, ACM J. Exp. Algorithmics.

[21]  Patrick J. F. Groenen,et al.  Modern Multidimensional Scaling: Theory and Applications , 2003 .

[22]  Katherine Faust.  Comparison of methods for positional analysis: Structural and general equivalences☆ , 1988 .

[23]  Fang Zhou,et al.  Compression of weighted graphs , 2011, KDD.

[24]  Albert Solé-Ribalta,et al.  Navigability of interconnected networks under random failures , 2013, Proceedings of the National Academy of Sciences.

[25]  George Karypis,et al.  Multi-threaded modularity based graph clustering using the multilevel paradigm , 2015, J. Parallel Distributed Comput..

[26]  Kevin Chen-Chuan Chang,et al.  A Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications , 2017, IEEE Transactions on Knowledge and Data Engineering.

[27]  Steven Skiena,et al.  DeepWalk: online learning of social representations , 2014, KDD.

[28]  Ryan A. Rossi,et al.  Role Discovery in Networks , 2014, IEEE Transactions on Knowledge and Data Engineering.

[29]  Fosca Giannotti,et al.  Finding and Characterizing Communities in Multidimensional Networks , 2011, 2011 International Conference on Advances in Social Networks Analysis and Mining.

[30]  Mason A. Porter,et al.  A local perspective on community structure in multilayer networks , 2015, Network Science.

[31]  Yifan Hu,et al.  Efficient, High-Quality Force-Directed Graph Drawing , 2006 .

[32]  Vitaly Osipov,et al.  n-Level Graph Partitioning , 2010, ESA.

[33]  Sergio Gómez,et al.  Random walk centrality in interconnected multilayer networks , 2015, ArXiv.

[34]  Giovanni Montana,et al.  Community detection in multiplex networks using Locally Adaptive Random walks , 2015, 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM).

[35]  S. Borgatti,et al.  Defining and measuring trophic role similarity in food webs using regular equivalence. , 2003, Journal of theoretical biology.

[36]  Chris Walshaw,et al.  Journal of Graph Algorithms and Applications a Multilevel Algorithm for Force-directed Graph-drawing , 2022 .

[37]  Danai Koutra,et al.  Graph Summarization Methods and Applications , 2016, ACM Comput. Surv..

[38]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

[39]  Danai Koutra,et al.  TimeCrunch: Interpretable Dynamic Graph Summarization , 2015, KDD.

[40]  Anjon Basak,et al.  Abstraction Methods for Solving Graph-Based Security Games , 2016, AAMAS Workshops.

[41]  Ioannis G. Tollis,et al.  Algorithms for area-efficient orthogonal drawings , 1998, Comput. Geom..

[42]  Liwei Qiu,et al.  Scalable Multiplex Network Embedding , 2018, IJCAI.

[43]  Diego Garlaschelli,et al.  Unbiased sampling of network ensembles , 2014, ArXiv.

[44]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[45]  Francesco Calabrese,et al.  ABACUS: frequent pAttern mining-BAsed Community discovery in mUltidimensional networkS , 2013, Data Mining and Knowledge Discovery.

[46]  Tiago P. Peixoto.  Nonparametric weighted stochastic block models. , 2017, Physical review. E.

[47]  Xiufen Zou,et al.  A new centrality measure of nodes in multilayer networks under the framework of tensor computation , 2018 .

[48]  Huan Liu,et al.  Community detection via heterogeneous interaction analysis , 2012, Data Mining and Knowledge Discovery.

[49]  Pascal Vincent,et al.  Representation Learning: A Review and New Perspectives , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[50]  Andrea L. Bertozzi,et al.  Filtering Methods for Subgraph Matching on Multiplex Networks , 2018, 2018 IEEE International Conference on Big Data (Big Data).

[51]  Matteo Magnani,et al.  Multilayer Social Networks , 2016 .

[52]  Max Welling,et al.  Semi-Supervised Classification with Graph Convolutional Networks , 2016, ICLR.

[53]  Abdolreza Mirzaei,et al.  Hierarchical graph embedding in vector space by graph pyramid , 2017, Pattern Recognit..

[54]  Ah Chung Tsoi,et al.  The Graph Neural Network Model , 2009, IEEE Transactions on Neural Networks.

[55]  Katharina Anna Zweig,et al.  Most Central or Least Central? How Much Modeling Decisions Influence a Node's Centrality Ranking in Multiplex Networks , 2016, 2016 Third European Network Intelligence Conference (ENIC).

[56]  Mohammad Reza Meybodi,et al.  Sampling from complex networks using distributed learning automata , 2014 .

[57]  Ales Ziberna,et al.  Blockmodeling of multilevel networks , 2014, Soc. Networks.

[58]  Subhadeep Paul,et al.  Consistent community detection in multi-relational data through restricted multi-layer stochastic blockmodel , 2015, 1506.02699.

[59]  Stephen B. Seidman,et al.  Network structure and minimum degree , 1983 .

[60]  Sebastian Maneth,et al.  A Survey on Methods and Systems for Graph Compression , 2015, ArXiv.

[61]  Rajeev Motwani,et al.  Clique partitions, graph compression and speeding-up algorithms , 1991, STOC '91.

[62]  Kevin W. Boyack,et al.  OpenOrd: an open-source toolbox for large graph layout , 2011, Electronic Imaging.

[63]  Weiyi Liu,et al.  Principled Multilayer Network Embedding , 2017, 2017 IEEE International Conference on Data Mining Workshops (ICDMW).

[64]  Jure Leskovec,et al.  node2vec: Scalable Feature Learning for Networks , 2016, KDD.

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

[66]  Peter Sanders,et al.  Recent Advances in Graph Partitioning , 2013, Algorithm Engineering.

[67]  Francesco Bonchi,et al.  Core Decomposition and Densest Subgraph in Multilayer Networks , 2017, CIKM.

[68]  Ingo Scholtes,et al.  From Relational Data to Graphs: Inferring Significant Links Using Generalized Hypergeometric Ensembles , 2017, SocInfo.

[69]  Christian Schulz,et al.  Tree-Based Coarsening and Partitioning of Complex Networks , 2014, SEA.

[70]  Michael Jünger,et al.  Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm , 2004, GD.

[71]  Hawoong Jeong,et al.  Statistical properties of sampled networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[72]  Jukka-Pekka Onnela,et al.  Community Structure in Time-Dependent, Multiscale, and Multiplex Networks , 2009, Science.

[73]  Nisheeth Shrivastava,et al.  Graph summarization with bounded error , 2008, SIGMOD Conference.

[74]  Kan Li,et al.  Topologically biased random walk for diffusions on multiplex networks , 2017, J. Comput. Sci..

[75]  Dane Taylor,et al.  Clustering Network Layers with the Strata Multilayer Stochastic Block Model , 2015, IEEE Transactions on Network Science and Engineering.

[76]  Kevin Chen-Chuan Chang,et al.  Learning Community Embedding with Community Detection and Node Embedding on Graphs , 2017, CIKM.

[77]  Martin G. Everett,et al.  Role colouring a graph , 1991 .

[78]  Dino Ienco,et al.  Do more views of a graph help? Community detection and clustering in multi-graphs , 2013, Proceedings of the 16th International Conference on Information Fusion.

[79]  Wenwu Zhu,et al.  Structural Deep Network Embedding , 2016, KDD.

[80]  Palash Goyal,et al.  Graph Embedding Techniques, Applications, and Performance: A Survey , 2017, Knowl. Based Syst..

[81]  Kristian Kersting,et al.  Glocalized Weisfeiler-Lehman Graph Kernels: Global-Local Feature Maps of Graphs , 2017, 2017 IEEE International Conference on Data Mining (ICDM).

[82]  Diego Garlaschelli,et al.  Irreducible network backbones: unbiased graph filtering via maximum entropy , 2017, ArXiv.

[83]  Dimitris Papadias,et al.  Uncertain Graph Processing through Representative Instances , 2015, TODS.

[84]  Peter Sanders,et al.  Engineering a scalable high quality graph partitioner , 2009, 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS).

[85]  Curt Jones,et al.  A Heuristic for Reducing Fill-In in Sparse Matrix Factorization , 1993, PPSC.

[86]  Yong Deng,et al.  Identification of influential nodes in network of networks , 2015, ArXiv.

[87]  Carsten Wiuf,et al.  Subnets of scale-free networks are not scale-free: sampling properties of networks. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[88]  Matteo Magnani,et al.  Towards effective visual analytics on multiplex and multilayer networks , 2015, ArXiv.

[89]  Vipin Kumar,et al.  Highly Scalable Parallel Algorithms for Sparse Matrix Factorization , 1997, IEEE Trans. Parallel Distributed Syst..

[90]  Marcello Pelillo,et al.  A Matrix Factorization Approach to Graph Compression , 2014, 2014 22nd International Conference on Pattern Recognition.

[91]  Young-Koo Lee,et al.  Scalable Compression of a Weighted Graph , 2016, ArXiv.

[92]  Leandros Tassiulas,et al.  Identifying Influential Spreaders in Complex Multilayer Networks: A Centrality Perspective , 2019, IEEE Transactions on Network Science and Engineering.

[93]  Henrik Jeldtoft Jensen,et al.  Comparison of Communities Detection Algorithms for Multiplex , 2014, ArXiv.

[94]  H. White,et al.  “Structural Equivalence of Individuals in Social Networks” , 2022, The SAGE Encyclopedia of Research Design.

[95]  Joachim M. Buhmann,et al.  Multidimensional Scaling and Data Clustering , 1994, NIPS.

[96]  Mason A. Porter,et al.  Multilayer Analysis and Visualization of Networks , 2014, J. Complex Networks.

[97]  Sebastian Maneth,et al.  Grammar-Based Graph Compression , 2017, Inf. Syst..

[98]  Navid Dianati,et al.  Unwinding the "hairball" graph: a pruning algorithm for weighted complex networks , 2015, Physical review. E.

[99]  Anna Traveset,et al.  Alternative approaches of transforming bimodal into unimodal mutualistic networks. The usefulness of preserving weighted information , 2011 .

[100]  Alireza Bagheri,et al.  Biased sampling from facebook multilayer activity network using learning automata , 2016, Applied Intelligence.

[101]  Bruce Hendrickson,et al.  A Multi-Level Algorithm For Partitioning Graphs , 1995, Proceedings of the IEEE/ACM SC95 Conference.

[102]  Andrea Tagarelli,et al.  Identifying Users With Alternate Behaviors of Lurking and Active Participation in Multilayer Social Networks , 2018, IEEE Transactions on Computational Social Systems.

[103]  Andrea Tagarelli,et al.  Ensemble-based community detection in multilayer networks , 2017, Data Mining and Knowledge Discovery.

[104]  Georgios B. Giannakis,et al.  Centrality-constrained graph embedding , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.

[105]  Mingzhe Wang,et al.  LINE: Large-scale Information Network Embedding , 2015, WWW.

[106]  Junbin Gao,et al.  Laplacian Regularized Low-Rank Representation and Its Applications , 2016, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[107]  Gueorgi Kossinets.  Effects of missing data in social networks , 2006, Soc. Networks.

[108]  Kan Li,et al.  Centrality ranking in multiplex networks using topologically biased random walks , 2018, Neurocomputing.

[109]  Christos Faloutsos,et al.  SlashBurn: Graph Compression and Mining beyond Caveman Communities , 2014, IEEE Transactions on Knowledge and Data Engineering.

[110]  Katarzyna Musial,et al.  A degree centrality in multi-layered social network , 2011, 2011 International Conference on Computational Aspects of Social Networks (CASoN).

[111]  Tanmoy Chakraborty,et al.  Cross-layer betweenness centrality in multiplex networks with applications , 2016, 2016 IEEE 32nd International Conference on Data Engineering (ICDE).

[112]  Marián Boguñá,et al.  Extracting the multiscale backbone of complex weighted networks , 2009, Proceedings of the National Academy of Sciences.

[113]  Xin Wang,et al.  Query preserving graph compression , 2012, SIGMOD Conference.

[114]  Huan Liu,et al.  Uncoverning Groups via Heterogeneous Interaction Analysis , 2009, 2009 Ninth IEEE International Conference on Data Mining.

[115]  Sergio Gómez,et al.  Centrality rankings in multiplex networks , 2014, WebSci '14.

[116]  Wei Lu,et al.  Deep Neural Networks for Learning Graph Representations , 2016, AAAI.

[117]  Mason A. Porter,et al.  Relating modularity maximization and stochastic block models in multilayer networks , 2018, SIAM J. Math. Data Sci..

[118]  Ugur Dogrusoz,et al.  CiSE: A Circular Spring Embedder Layout Algorithm , 2013, IEEE Transactions on Visualization and Computer Graphics.

[119]  Geoffrey Zweig,et al.  Linguistic Regularities in Continuous Space Word Representations , 2013, NAACL.

[120]  Vincenza Carchiolo,et al.  Communities Unfolding in Multislice Networks , 2016, CompleNet.

[121]  Michael Burch,et al.  A Taxonomy and Survey of Dynamic Graph Visualization , 2017, Comput. Graph. Forum.

[122]  Giorgio Fagiolo,et al.  Enhanced reconstruction of weighted networks from strengths and degrees , 2013, 1307.2104.

[123]  Vito Latora,et al.  Efficient exploration of multiplex networks , 2015, 1505.01378.

[124]  Jure Leskovec,et al.  Inductive Representation Learning on Large Graphs , 2017, NIPS.

[125]  Yufei Han,et al.  Partially Supervised Graph Embedding for Positive Unlabelled Feature Selection , 2016, IJCAI.

[126]  Edward M. Reingold,et al.  Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..

[127]  Peter Sanders,et al.  Exact Routing in Large Road Networks Using Contraction Hierarchies , 2012, Transp. Sci..

[128]  Anna Monreale,et al.  Multidimensional networks: foundations of structural analysis , 2013, World Wide Web.

[129]  Peter Sanders,et al.  Engineering Multilevel Graph Partitioning Algorithms , 2010, ESA.

[130]  Tsuyoshi Murata,et al.  MELL: Effective Embedding Method for Multiplex Networks , 2018, WWW.

[131]  M. Newman,et al.  Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[132]  J. Rissanen,et al.  Modeling By Shortest Data Description* , 1978, Autom..

[133]  Giancarlo Ragozini,et al.  Quantifying layer similarity in multiplex networks: a systematic study , 2017, Royal Society Open Science.

[134]  Jae-Gil Lee,et al.  Community Detection in Multi-Layer Graphs: A Survey , 2015, SGMD.

[135]  Micah Adler,et al.  Towards compressing Web graphs , 2001, Proceedings DCC 2001. Data Compression Conference.

[136]  Stephen Curial,et al.  Effectively visualizing large networks through sampling , 2005, VIS 05. IEEE Visualization, 2005..

[137]  P. Holland,et al.  An Exponential Family of Probability Distributions for Directed Graphs , 1981 .

[138]  Vladimir Batagelj,et al.  Generalized blockmodeling of two-mode network data , 2004, Soc. Networks.

[139]  Danai Koutra,et al.  RolX: structural role extraction & mining in large graphs , 2012, KDD.

[140]  Mathias Niepert,et al.  Learning Convolutional Neural Networks for Graphs , 2016, ICML.