COMMUNITY DETECTION IN TEMPORAL MULTILAYER NETWORKS, WITH AN APPLICATION TO CORRELATION NETWORKS

被引:126
作者
Bazzi, Marya [1 ]
Porter, Mason A. [1 ,2 ]
Williams, Stacy [3 ]
McDonald, Mark [3 ]
Fenn, Daniel J. [3 ]
Howison, Sam D. [1 ,4 ]
机构
[1] Oxford Ctr Ind & Appl Math, Math Inst, Oxford OX2 6GG, England
[2] Univ Oxford, CABDyN Complex Ctr, Oxford OX1 1HP, England
[3] HSBC Bank, Global Res, London E14 5HQ, England
[4] Univ Oxford, Oxford Man Inst Quantitat Finance, Oxford OX2 6ED, England
基金
英国工程与自然科学研究理事会;
关键词
community structure; multilayer networks; temporal networks; modularity maximization; financial correlation networks; RANDOM GRAPHS; MULTISCALE; TRANSITION;
D O I
10.1137/15M1009615
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Networks are a convenient way to represent complex systems of interacting entities. Many networks contain "communities" of nodes that are more densely connected to each other than to nodes in the rest of the network. In this paper, we investigate the detection of communities in temporal networks represented as multilayer networks. As a focal example, we study time-dependent financial-asset correlation networks. We first argue that the use of the "modularity" quality function-which is defined by comparing edge weights in an observed network to expected edge weights in a "null network"-is application-dependent. We differentiate between "null networks" and "null models" in our discussion of modularity maximization, and we highlight that the same null network can correspond to different null models. We then investigate a multilayer modularity-maximization problem to identify communities in temporal networks. Our multilayer analysis depends only on the form of the maximization problem and not on the specific quality function that one chooses. We introduce a diagnostic to measure persistence of community structure in a multilayer network partition. We prove several results that describe how the multilayer maximization problem measures a trade-off between static community structure within layers and larger values of persistence across layers. We also discuss some computational issues that the popular "Louvain" heuristic faces with temporal multilayer networks and suggest ways to mitigate them.
引用
收藏
页码:1 / 41
页数:41
相关论文
共 77 条
  • [1] Analysis of the structure of complex networks at different resolution levels
    Arenas, A.
    Fernandez, A.
    Gomez, S.
    [J]. NEW JOURNAL OF PHYSICS, 2008, 10
  • [2] Aynaud Thomas, 2010, 2010 8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), P513
  • [3] The Architecture of complexity
    Barabasi, Albert-Lashlo
    [J]. IEEE CONTROL SYSTEMS MAGAZINE, 2007, 27 (04): : 33 - 42
  • [4] Barnett I., 2015, ARXIV14100761V2STATM
  • [5] Extraction of force-chain network architecture in granular materials using community detection
    Bassett, Danielle S.
    Owens, Eli T.
    Porter, Mason A.
    Manning, M. Lisa
    Daniels, Karen E.
    [J]. SOFT MATTER, 2015, 11 (14) : 2731 - 2744
  • [6] Robust detection of dynamic community structure in networks
    Bassett, Danielle S.
    Porter, Mason A.
    Wymbs, Nicholas F.
    Grafton, Scott T.
    Carlson, Jean M.
    Mucha, Peter J.
    [J]. CHAOS, 2013, 23 (01)
  • [7] Dynamic reconfiguration of human brain networks during learning
    Bassett, Danielle S.
    Wymbs, Nicholas F.
    Porter, Mason A.
    Mucha, Peter J.
    Carlson, Jean M.
    Grafton, Scott T.
    [J]. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2011, 108 (18) : 7641 - 7646
  • [8] Battiston S, 2010, NETWORK SCIENCE: COMPLEXITY IN NATURE AND TECHNOLOGY, P131, DOI 10.1007/978-1-84996-396-1_7
  • [9] Bell ET., 1934, Am Math Mon, V41, P411, DOI [DOI 10.1080/00029890.1934.11987615, 10.1080/00029890.1934.11987615]
  • [10] Fast unfolding of communities in large networks
    Blondel, Vincent D.
    Guillaume, Jean-Loup
    Lambiotte, Renaud
    Lefebvre, Etienne
    [J]. JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2008,