3.2k citations · 5.9k across the 54 of their papers we have counts for
3 papers · 1 filter
Cascades on a class of clustered random networks
Adam Hackett, Sergey Melnik, James P. Gleeson
We present an analytical approach to determining the expected cascade size in a broad range of dynamical models on the class of random networks with arbitrary degree distribution a…
Accuracy of Mean-Field Theory for Dynamics on Real-World Networks
James P. Gleeson, Sergey Melnik, Jonathan A. Ward +2
Mean-field analysis is an important tool for understanding dynamics on complex networks. However, surprisingly little attention has been paid to the question of whether mean-field…
The unreasonable effectiveness of tree-based theory for networks with clustering
Sergey Melnik, Adam Hackett, Mason A. Porter +2
We demonstrate that a tree-based theory for various dynamical processes yields extremely accurate results for several networks with high levels of clustering. We find that such a t…