Centrality measures in networks based on nodes attributes, long-range interactions and group influence
Preprint
Abstract
We propose a new method for assessing agents influence in network structures, which takes into consideration nodes attributes, individual and group influences of nodes, and the intensity of interactions. This approach helps us to identify both explicit and hidden central elements which cannot be detected by classical centrality measures or other indices.Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Modeling optimal social choice: matrix-vector representation of various solution concepts based on majority ruleJournal of Global Optimization, 2012
- Power Indices Taking into Account Agents’ Preferences2007
- A measure of betweenness centrality based on random walksSocial Networks, 2005
- The anatomy of a large-scale hypertextual Web search engineComputer Networks and ISDN Systems, 1998
- Centrality in valued graphs: A measure of betweenness based on network flowSocial Networks, 1991
- Algorithm 457: finding all cliques of an undirected graphCommunications of the ACM, 1973
- Communication Patterns in Task-Oriented GroupsThe Journal of the Acoustical Society of America, 1950