Influence measures in subnetworks using vertex centrality

June 30, 2019 Β· Declared Dead Β· πŸ› Soft Computing - A Fusion of Foundations, Methodologies and Applications

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Roy Cerqueti, Gian Paolo Clemente, Rosanna Grassi arXiv ID 1907.00431 Category physics.soc-ph Cross-listed cs.SI Citations 3 Venue Soft Computing - A Fusion of Foundations, Methodologies and Applications Last Checked 4 months ago
Abstract
This work deals with the issue of assessing the influence of a node in the entire network and in the subnetwork to which it belongs as well, adapting the classical idea of vertex centrality. We provide a general definition of relative vertex centrality measure with respect to the classical one, referred to the whole network. Specifically, we give a decomposition of the relative centrality measure by including also the relative influence of the single node with respect to a given subgraph containing it. The proposed measure of relative centrality is tested in the empirical networks generated by collecting assets of the $S\&P$ 100, focusing on two specific centrality indices: betweenness and eigenvector centrality. The analysis is performed in a time perspective, capturing the assets influence, with respect to the characteristics of the analysed measures, in both the entire network and the specific sectors to which the assets belong.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” physics.soc-ph

R.I.P. πŸ‘» Ghosted

Scale-free networks are rare

Anna D. Broido, Aaron Clauset

physics.soc-ph πŸ› Nat. Commun. πŸ“š 988 cites 8 years ago

Died the same way β€” πŸ‘» Ghosted