Ranking vertices or edges of a network by loops: A new approach

被引:13
|
作者
Van Kerrebroeck, Valery [1 ]
Marinari, Enzo
机构
[1] Univ Roma La Sapienza, Dipartimento Fis, INFM, CNR, I-00185 Rome, Italy
关键词
Network traffic - New approaches - Ranking measures;
D O I
10.1103/PhysRevLett.101.098701
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
We introduce loop ranking, a new ranking measure based on the detection of closed paths, which can be computed in an efficient way. We analyze it with respect to several ranking measures which have been proposed in the past, and are widely used to capture the relative importance of the vertices in complex networks. We argue that loop ranking is a very appropriate measure to quantify the role of both vertices and edges in the network traffic.
引用
收藏
页数:4
相关论文
共 50 条
  • [41] Small convex polytopes with long edges and many vertices
    Károly Böröczky
    Balázs Csikós
    Discrete & Computational Geometry, 2003, 30 : 195 - 204
  • [42] Small convex polytopes with long edges and many vertices
    Böröczky, K
    Csikós, B
    DISCRETE & COMPUTATIONAL GEOMETRY, 2003, 30 (02) : 195 - 204
  • [43] On Clustering Coefficients of Graphs with the Fixed Numbers of Vertices and Edges
    Takahashi, Norikazu
    2009 EUROPEAN CONFERENCE ON CIRCUIT THEORY AND DESIGN, VOLS 1 AND 2, 2009, : 814 - 817
  • [44] Loop-tree duality from vertices and edges
    Bobadilla, William J. Torres
    JOURNAL OF HIGH ENERGY PHYSICS, 2021, 2021 (04)
  • [45] More on the structure of plane graphs with prescribed degrees of vertices, faces, edges and dual edges
    Hudak, Peter
    Macekova, Maria
    Madaras, Tomas
    Siroczki, Pavol
    ARS MATHEMATICA CONTEMPORANEA, 2017, 13 (02) : 355 - 366
  • [46] Matching Extension Missing Vertices and Edges in Triangulations of Surfaces
    Kawarabayashi, Ken-ichi
    Ozeki, Kenta
    Plummer, Michael D.
    JOURNAL OF GRAPH THEORY, 2017, 85 (01) : 249 - 257
  • [47] Asymptotic enumeration of strongly connected digraphs by vertices and edges
    Perez-Gimenez, Xavier
    Wormald, Nicholas
    RANDOM STRUCTURES & ALGORITHMS, 2013, 43 (01) : 80 - 114
  • [48] Edge-bipancyclicity of a hypercube with faulty vertices and edges
    Hsieh, Sun-Yuan
    Shen, Tzu-Hsiung
    DISCRETE APPLIED MATHEMATICS, 2008, 156 (10) : 1802 - 1808
  • [49] Conditions on the Edges and Vertices of Non-commuting Graph
    Jahandideh, M.
    Darafsheh, M. R.
    Sarmin, N. H.
    Omer, S. M. S.
    JURNAL TEKNOLOGI-SCIENCES & ENGINEERING, 2015, 74 (01):
  • [50] Graph Designs for a Graph with Six Vertices and Nine Edges
    Liu, Lifang
    HIGH PERFORMANCE NETWORKING, COMPUTING, AND COMMUNICATION SYSTEMS, 2011, 163 : 354 - 358