Compressive sensing of high betweenness centrality nodes in networks

DOI10.1016/J.PHYSA.2017.12.145MaRDI QIDQ2150293zbMATH OpenOpenAlexFDO

Authors Hamidreza Mahyar, Rouzbeh Hasheminezhad, Elahe Ghalebi K., Ali Nazemian, Radu Grosu, Ali Movaghar, Hamid R. Rabiee

Publication date 27 June 2022

Published in Physica A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.physa.2017.12.145

zbMATH Keywords

complex networkcompressive sensingbetweenness centrality

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Recommendations

• Fast approximation of betweenness centrality through sampling
• Approximating Betweenness Centrality
• A new method for identifying influential nodes and important edges in complex networks
• scientific article; zbMATH DE number 6096696
• A centrality measure in dense networks based on two-way random walk betweenness

Cites work

• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 47023 (Why is no real title available?)
• scientific article; zbMATH DE number 1460605 (Why is no real title available?)
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• A Note on the Equality of the Column and Row Rank of a Matrix
• A faster algorithm for betweenness centrality*
• A mathematical introduction to compressive sensing
• Approximating Betweenness Centrality in Fully Dynamic Networks
• Block splitting for distributed optimization
• Collective dynamics of `small-world' networks
• Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters
• Compressed sensing
• Decoding by Linear Programming
• Efficient algorithms for updating betweenness centrality in fully dynamic graphs
• Emergence of Scaling in Random Networks
• Exploring complex networks
• Fast approximation of betweenness centrality through sampling
• Identifying and ranking influential spreaders in complex networks by neighborhood coreness
• Identifying sets of key players in a social network
• Improving the betweenness centrality of a node by adding links
• KADABRA is an adaptive algorithm for betweenness via random approximation
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Networks. An introduction.
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Sharp RIP bound for sparse signal and low-rank matrix recovery
• Stable signal recovery from incomplete and inaccurate measurements
• The centrality index of a graph

Cited in

(3)

• Optimizing node infiltrations in complex networks by a local search based heuristic
• Discovering bottlenecks entities in multi-layer social networks
• A centrality measure in dense networks based on two-way random walk betweenness

Describes a project that uses

Uses Software

• KADABRA

This page was built for publication: Compressive sensing of high betweenness centrality nodes in networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2150293)