481 citations · 993 across the 6 of their papers we have counts for
Showing 2003Show all
2 papers · 1 filter
cond-mat.stat-mech2003★ 295 cited
On the uniform generation of random graphs with prescribed degree sequences
R. Milo, N. Kashtan, S. Itzkovitz +2
Random graphs with prescribed degree sequences have been widely used as a model of complex networks. Comparing an observed network to an ensemble of such graphs allows one to detec…
cond-mat.stat-mech2003★ 34 cited
A measure of betweenness centrality based on random walks
M. E. J. Newman
Betweenness is a measure of the centrality of a node in a network, and is normally calculated as the fraction of shortest paths between node pairs that pass through the node of int…