18.8k citations · 108.9k across the 85 of their papers we have counts for
86 papers
Strongly-connected percolation on directed lattices
M. E. J. Newman, P. Grassberger, R. M. Ziff
We study percolation on lattices with directed bonds, focusing on the behavior of strongly-connected percolation clusters -- clusters in which every site is reachable from every ot…
20 years of network community detection
Santo Fortunato, M. E. J. Newman
A fundamental technical challenge in the analysis of network data is the automated discovery of communities - groups of nodes that are strongly connected or that share similar feat…
Cutting Through the Noise to Infer Autonomous System Topology
Kirtus G. Leyba, Joshua J. Daymude, Jean-Gabriel Young +3
The Border Gateway Protocol (BGP) is a distributed protocol that manages interdomain routing without requiring a centralized record of which autonomous systems (ASes) connect to wh…
Clustering of heterogeneous populations of networks
Jean-Gabriel Young, Alec Kirkley, M. E. J. Newman
Statistical methods for reconstructing networks from repeated measurements typically assume that all measurements are generated from the same underlying network structure. This nee…
Representative community divisions of networks
Alec Kirkley, M. E. J. Newman
Methods for detecting community structure in networks typically aim to identify a single best partition of network nodes into communities, often by optimizing some objective functi…
The friendship paradox in real and model networks
George T. Cantwell, Alec Kirkley, M. E. J. Newman
The friendship paradox is the observation that the degrees of the neighbors of a node in any network will, on average, be greater than the degree of the node itself. In common parl…