DIVIDE-AND-CONQUER TOMOGRAPHY FOR LARGE-SCALE NETWORKS

被引:0
|
作者
Santos, Augusto [1 ]
Matta, Vincenzo [2 ]
Sayed, Ali H. [1 ]
机构
[1] Ecole Polytech Fed Lausanne, CH-1015 Lausanne, Switzerland
[2] Univ Salerno, DIEM, Via Giovanni Paolo 2, I-84084 Fisciano, SA, Italy
关键词
Network inference; local inference; big-data; large-scale networks; network tomography;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This work considers the problem of reconstructing the topology of a network of interacting agents via observations of the state-evolution of the agents. Observations from only a subset of the nodes are collected, and the information is used to infer their local connectivity (local tomography). Recent results establish that, under suitable conditions on the network model, local tomography is achievable with high probability as the network size scales to infinity [1, 2]. Motivated by these results, we explore the possibility of reconstructing a larger network via repeated application of the local tomography algorithm to smaller network portions. A divide-and-conquer strategy is developed and tested numerically on some illustrative examples.
引用
收藏
页码:170 / 174
页数:5
相关论文
共 50 条
  • [31] DIVIDE-AND-CONQUER
    LEWIS, R
    CHEMISTRY IN BRITAIN, 1992, 28 (12) : 1092 - 1093
  • [32] A divide-and-conquer method for large scale ν-nonparallel support vector machines
    Xuchan Ju
    Yingjie Tian
    Neural Computing and Applications, 2018, 29 : 497 - 509
  • [33] A divide-and-conquer method for large scale ν-nonparallel support vector machines
    Ju, Xuchan
    Tian, Yingjie
    NEURAL COMPUTING & APPLICATIONS, 2018, 29 (09): : 497 - 509
  • [34] Performance Analysis of Divide-and-Conquer strategies for Large scale Simulations in R
    Subramanian, Ranjini
    Zhang, Hui
    2018 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), 2018, : 4261 - 4267
  • [35] Two provably consistent divide-and-conquer clustering algorithms for large networks
    Mukherjee, Soumendu Sundar
    Sarkar, Purnamrita
    Bickel, Peter J.
    PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2021, 118 (44)
  • [36] A divide-and-conquer algorithm for core-periphery identification in large networks
    Yanchenko, Eric
    STAT, 2022, 11 (01):
  • [37] Matching large ontologies: A divide-and-conquer approach
    Hu, Wei
    Qu, Yuzhong
    Cheng, Gong
    DATA & KNOWLEDGE ENGINEERING, 2008, 67 (01) : 140 - 160
  • [38] Divide-and-conquer learning and modular perceptron networks
    Fu, HC
    Lee, YP
    Chiang, CC
    Pao, HT
    IEEE TRANSACTIONS ON NEURAL NETWORKS, 2001, 12 (02): : 250 - 263
  • [39] A divide-and-conquer algorithm for distributed optimization on networks
    Emirov, Nazar
    Song, Guohui
    Sun, Qiyu
    APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2024, 70
  • [40] Divide-and-conquer learning and modular perceptron networks
    Fu, H.-C.
    Lee, Y.-P.
    Chiang, C.-C.
    Pao, H.-T.
    2001, Institute of Electrical and Electronics Engineers Inc. (12):