Informative core identification in complex networks

01/16/2021
by   Ruizhong Miao, et al.
2

In network analysis, the core structure of modeling interest is usually hidden in a larger network in which most structures are not informative. The noise and bias introduced by the non-informative component in networks can obscure the salient structure and limit many network modeling procedures' effectiveness. This paper introduces a novel core-periphery model for the non-informative periphery structure of networks without imposing a specific form for the informative core structure. We propose spectral algorithms for core identification as a data preprocessing step for general downstream network analysis tasks based on the model. The algorithm enjoys a strong theoretical guarantee of accuracy and is scalable for large networks. We evaluate the proposed method by extensive simulation studies demonstrating various advantages over many traditional core-periphery methods. The method is applied to extract the informative core structure from a citation network and give more informative results in the downstream hierarchical community detection.

READ FULL TEXT

page 8

page 22

page 23

page 25

research
12/02/2019

Core-Periphery Structure in Directed Networks

While studies of meso-scale structures in networks often focus on commun...
research
05/20/2020

A Clarified Typology of Core-Periphery Structure in Networks

Core-periphery structure, the arrangement of a network into a dense core...
research
08/09/2020

Community models for partially observed networks from surveys

Communities are a common and widely studied structure in networks, typic...
research
09/03/2020

Online Community Detection for Event Streams on Networks

A common goal in network modeling is to uncover the latent community str...
research
05/16/2017

All-relevant feature selection using multidimensional filters with exhaustive search

This paper describes a method for identification of the informative vari...
research
12/31/2022

Targeted k-node Collapse Problem: Towards Understanding the Robustness of Local k-core Structure

The concept of k-core, which indicates the largest induced subgraph wher...
research
02/06/2013

Inference with Idempotent Valuations

Valuation based systems verifying an idempotent property are studied. A ...

Please sign up or login with your details

Forgot password? Click here to reset