Beyond the clustering coefficient: A topological analysis of node neighbourhoods in complex networks

被引:53
|
作者
Kartun-Giles A.P. [1 ]
Bianconi G. [1 ,2 ]
机构
[1] School of Mathematical Sciences, Queen Mary University of London, London
[2] The Alan Turing Institute, The British Library, London
关键词
Complex networks; Simplicial complexes; Topological data analysis;
D O I
10.1016/j.csfx.2019.100004
中图分类号
学科分类号
摘要
In Network Science, node neighbourhoods, also called ego-centered networks, have attracted significant attention. In particular the clustering coefficient has been extensively used to measure their local cohesiveness. In this paper, we show how, given two nodes with the same clustering coefficient, the topology of their neighbourhoods can be significantly different, which demonstrates the need to go beyond this simple characterization. We perform a large scale statistical analysis of the topology of node neighbourhoods of real networks by first constructing their clique complexes, and then computing their Betti numbers. We are able to show significant differences between the topology of node neighbourhoods of real networks and the stochastic topology of null models of random simplicial complexes revealing local organisation principles of the node neighbourhoods. Moreover we observe that a large scale statistical analysis of the topological properties of node neighbourhoods is able to clearly discriminate between power-law networks, and planar road networks. © 2019 The Author(s)
引用
收藏
相关论文
共 50 条
  • [21] Complex Network Hierarchical Sampling Method Combining Node Neighborhood Clustering Coefficient with Random Walk
    Xiaoyang Liu
    Mengyao Zhang
    Giacomo Fiumara
    Pasquale De Meo
    New Generation Computing, 2022, 40 : 765 - 807
  • [22] Complex Network Hierarchical Sampling Method Combining Node Neighborhood Clustering Coefficient with Random Walk
    Liu, Xiaoyang
    Zhang, Mengyao
    Fiumara, Giacomo
    De Meo, Pasquale
    NEW GENERATION COMPUTING, 2022, 40 (03) : 765 - 807
  • [23] Design and Topological Analysis of Complex Networks with Optimal Controllability
    Yang, Cuili
    Tang, Wallace K. S.
    INTERNATIONAL JOURNAL OF BIFURCATION AND CHAOS, 2014, 24 (07):
  • [24] High clustering coefficient of computer networks
    Du, Cai-Feng
    2009 WASE INTERNATIONAL CONFERENCE ON INFORMATION ENGINEERING, ICIE 2009, VOL I, 2009, : 371 - 374
  • [25] A clustering coefficient for complete weighted networks
    Mcassey, Michael P.
    Bijma, Fetsje
    NETWORK SCIENCE, 2015, 3 (02) : 183 - 195
  • [26] EMPIRICAL ANALYSIS OF THE CLUSTERING COEFFICIENT IN THE USER-OBJECT BIPARTITE NETWORKS
    Liu, Jianguo
    Hou, Lei
    Zhang, Yi-Lu
    Song, Wen-Jun
    Pan, Xue
    INTERNATIONAL JOURNAL OF MODERN PHYSICS C, 2013, 24 (08):
  • [27] The Effect of Clustering Coefficient and Node Degree on The Robustness of Cooperation
    Li, Menglin
    O'Riordan, Colm
    2013 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2013, : 2833 - 2839
  • [28] UNSUPERVISED CLUSTERING ANALYSIS: A MULTISCALE COMPLEX NETWORKS APPROACH
    Granell, Clara
    Gomez, Sergio
    Arenas, Alex
    INTERNATIONAL JOURNAL OF BIFURCATION AND CHAOS, 2012, 22 (07):
  • [29] Label propagation algorithm based on edge clustering coefficient for community detection in complex networks
    Zhang, Xian-Kun
    Tian, Xue
    Li, Ya-Nan
    Song, Chen
    INTERNATIONAL JOURNAL OF MODERN PHYSICS B, 2014, 28 (30):
  • [30] A degree-related and link clustering coefficient approach for link prediction in complex networks
    Meixi Wang
    Xuyang Lou
    Baotong Cui
    The European Physical Journal B, 2021, 94