Extracting backbones from weighted complex networks with incomplete information
Summary: The backbone is the natural abstraction of a complex network, which can help people understand a networked system in a more simplified form. Traditional backbone extraction methods tend to include many outliers into the backbone. What is more, they often suffer from the computational inefficiency -- the exhaustive search of all nodes or edges is often prohibitively expensive. In this paper, we propose a backbone extraction heuristic with incomplete information (BEHwII) to find the backbone in a complex weighted network. First, a strict filtering rule is carefully designed to determine edges to be preserved or discarded. Second, we present a local search model to examine part of edges in an iterative way, which only relies on the local/incomplete knowledge rather than the global view of the network. Experimental results on four real-life networks demonstrate the advantage of BEHwII over the classic disparity filter method by either effectiveness or efficiency validity.
- Community structure in social and biological networks
- Emergence of Scaling in Random Networks
- scientific article; zbMATH DE number 437527 (Why is no real title available?)
- Robust $H_{\infty}$ Filtering for a Class of Nonlinear Networked Systems With Multiple Stochastic Communication Delays and Packet Dropouts
This page was built for publication: Extracting backbones from weighted complex networks with incomplete information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q304977)
