activity
20092015
most citedThe unreasonable effectiveness of tree-based theory for networks with clustering

131 citations · 501 across the 5 of their papers we have counts for

collaborators

5 papers

physics.soc-ph2015★ 105 cited

Bond percolation on multiplex networks

A. Hackett, D. Cellai, S. Gómez +2

We present an analytical approach for bond percolation on multiplex networks and use it to determine the expected size of the giant connected component and the value of the critica…

physics.soc-ph2012★ 24 cited

Cascades on clique-based graphs

Adam Hackett, 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 highly-clustered random graphs introduced by Gleeson…

physics.soc-ph2010★ 117 cited

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…

cond-mat.dis-nn2010★ 131 cited

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…

cond-mat.stat-mech2009★ 124 cited

How clustering affects the bond percolation threshold in complex networks

James P. Gleeson, Sergey Melnik, Adam Hackett

The question of how clustering (non-zero density of triangles) in networks affects their bond percolation threshold has important applications in a variety of disciplines. Recent a…