131 citations · 501 across the 5 of their papers we have counts for
5 papers
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…
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…
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…
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…
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…