↓ Skip to main content

PLOS

A Family of Algorithms for Computing Consensus about Node State from Network Data

Overview of attention for article published in PLoS Computational Biology, July 2013
Altmetric Badge

Mentioned by

twitter
11 X users
patent
1 patent

Citations

dimensions_citation
26 Dimensions

Readers on

mendeley
94 Mendeley
citeulike
3 CiteULike
Title
A Family of Algorithms for Computing Consensus about Node State from Network Data
Published in
PLoS Computational Biology, July 2013
DOI 10.1371/journal.pcbi.1003109
Pubmed ID
Authors

Eleanor R. Brush, David C. Krakauer, Jessica C. Flack

Abstract

Biological and social networks are composed of heterogeneous nodes that contribute differentially to network structure and function. A number of algorithms have been developed to measure this variation. These algorithms have proven useful for applications that require assigning scores to individual nodes-from ranking websites to determining critical species in ecosystems-yet the mechanistic basis for why they produce good rankings remains poorly understood. We show that a unifying property of these algorithms is that they quantify consensus in the network about a node's state or capacity to perform a function. The algorithms capture consensus by either taking into account the number of a target node's direct connections, and, when the edges are weighted, the uniformity of its weighted in-degree distribution (breadth), or by measuring net flow into a target node (depth). Using data from communication, social, and biological networks we find that that how an algorithm measures consensus-through breadth or depth- impacts its ability to correctly score nodes. We also observe variation in sensitivity to source biases in interaction/adjacency matrices: errors arising from systematic error at the node level or direct manipulation of network connectivity by nodes. Our results indicate that the breadth algorithms, which are derived from information theory, correctly score nodes (assessed using independent data) and are robust to errors. However, in cases where nodes "form opinions" about other nodes using indirect information, like reputation, depth algorithms, like Eigenvector Centrality, are required. One caveat is that Eigenvector Centrality is not robust to error unless the network is transitive or assortative. In these cases the network structure allows the depth algorithms to effectively capture breadth as well as depth. Finally, we discuss the algorithms' cognitive and computational demands. This is an important consideration in systems in which individuals use the collective opinions of others to make decisions.

X Demographics

X Demographics

The data shown below were collected from the profiles of 11 X users who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 94 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
United States 6 6%
Portugal 2 2%
Netherlands 1 1%
Germany 1 1%
Unknown 84 89%

Demographic breakdown

Readers by professional status Count As %
Researcher 20 21%
Student > Ph. D. Student 11 12%
Student > Bachelor 9 10%
Student > Master 9 10%
Professor 7 7%
Other 19 20%
Unknown 19 20%
Readers by discipline Count As %
Agricultural and Biological Sciences 27 29%
Computer Science 11 12%
Social Sciences 7 7%
Neuroscience 5 5%
Physics and Astronomy 4 4%
Other 19 20%
Unknown 21 22%