Directed network comparison using motifs (2401.06445v1)
Abstract: Analyzing and characterizing the differences between networks is a fundamental and challenging problem in network science. Previously, most network comparison methods that rely on topological properties have been restricted to measuring differences between two undirected networks. However, many networks, such as biological networks, social networks, and transportation networks, exhibit inherent directionality and higher-order attributes that should not be ignored when comparing networks. Therefore, we propose a motif-based directed network comparison method that captures local, global, and higher-order differences between two directed networks. Specifically, we first construct a motif distribution vector for each node, which captures the information of a node's involvement in different directed motifs. Then, the dissimilarity between two directed networks is defined on the basis of a matrix which is composed of the motif distribution vector of every node and Jensen-Shannon divergence. The performance of our method is evaluated via the comparison of six real directed networks with their null models as well as their perturbed networks based on edge perturbation. Our method is superior to the state-of-the-art baselines and is robust with different parameter settings.
- Barabási AL. Network science. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 2013;371(1987):20120375.
- Knoke D, Yang S. Social network analysis. SAGE publications, 2019.
- Susceptible-infected-spreading-based network embedding in static and temporal networks. EPJ Data Science 2020;9(1):30.
- Computational network biology: data, models, and applications. Physics Reports 2020;846:1–66.
- Economic networks: The new challenges. science 2009;325(5939):422–425.
- Bretto A. Hypergraph theory. An introduction Mathematical Engineering Cham: Springer 2013;1.
- Multilayer networks. Journal of complex networks 2014;2(3):203–271.
- Higher-order organization of complex networks. Science 2016;353(6295):163–166.
- Vital node identification in hypergraphs via gravity model. Chaos: An Interdisciplinary Journal of Nonlinear Science 2023;33(1).
- Comparing methods for comparing networks. Scientific reports 2019;9(1):17557.
- A guide to selecting a network similarity method. In Proceedings of the 2014 Siam international conference on data mining. SIAM, pages 1037–1045.
- Thirty years of graph matching in pattern recognition. International journal of pattern recognition and artificial intelligence 2004;18(03):265–298.
- Sharan R, Ideker T. Modeling cellular machinery through biological network comparison. Nature biotechnology 2006;24(4):427–433.
- Brain network similarity: methods and applications. Network Neuroscience 2020;4(3):507–527.
- Graph isomorphism problem. Journal of Soviet Mathematics 1985;29:1426–1481.
- Cook SA. The complexity of theorem-proving procedures. In Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook. 2023;pages 143–152.
- Latora V, Marchiori M. A measure of centrality based on network efficiency. New Journal of Physics 2007;9(6):188.
- Symmetry-based structure entropy of complex networks. Physica A: Statistical Mechanics and its Applications 2008;387(11):2611–2619.
- Babai L. Graph isomorphism in quasipolynomial time. In Proceedings of the forty-eighth annual ACM symposium on Theory of Computing. pages 684–697.
- Eigenvector centrality measure based on node similarity for multilayer and temporal networks. IEEE Access 2019;7:115725–115733.
- A Path-Based Distribution Measure for Network Comparison. Entropy 2020;22(11):1287.
- Quantification of network structural dissimilarities. Nature communications 2017;8(1):13928.
- Bagrow JP, Bollt EM. An information-theoretic, all-scales approach to comparing networks. Applied Network Science 2019;4(1):1–15.
- Deltacon: A principled massive-graph similarity function. In Proceedings of the 2013 SIAM international conference on data mining. SIAM, pages 162–170.
- Graphlet-based characterization of directed networks. Scientific reports 2016;6(1):35098.
- Pržulj N. Biological network comparison using graphlet degree distribution. Bioinformatics 2007;23(2):e177–e183.
- Scalable similarity estimation in social networks: Closeness, node labels, and random edge lengths. In Proceedings of the first ACM conference on Online social networks. pages 131–142.
- Proper evaluation of alignment-free network comparison methods. Bioinformatics 2015;31(16):2697–2704.
- Network motifs: simple building blocks of complex networks. Science 2002;298(5594):824–827.
- Community detection using attribute homogenous motif. Ieee Access 2018;6:47707–47716.
- Temporal link prediction with motifs for social networks. IEEE Transactions on Knowledge and Data Engineering 2021;.
- A novel higher-order neural network framework based on motifs attention for identifying critical nodes. Physica A: Statistical Mechanics and its Applications 2023;629:129194.
- Takahata Y. Diachronic changes in the dominance relations of adult female Japanese monkeys of the Arashiyama B group. The monkeys of Arashiyama State University of New York Press, Albany 1991;:123–139.
- The structure of the nervous system of the nematode Caenorhabditis elegans. Philos Trans R Soc Lond B Biol Sci 1986;314(1165):1–340.
- The diffusion of an innovation among physicians. Sociometry 1957;20(4):253–270.
- Graph evolution: Densification and shrinking diameters. ACM transactions on Knowledge Discovery from Data (TKDD) 2007;1(1):2–es.
- Kunegis J. Konect: the koblenz network collection. In Proceedings of the 22nd international conference on world wide web. pages 1343–1350.
- Quantification of network structural dissimilarities based on network embedding. Iscience 2022;25(6).
- Quantifying randomness in real networks. Nature communications 2015;6(1):8627.