The unreasonable effectiveness of tree-based theory for networks with clustering
The unreasonable effectiveness of tree-based theory for networks with clustering
We demonstrate that a tree-based theory for various dynamical processes operating on static, undirected networks yields extremely accurate results for several networks with high levels of clustering. We find that such a theory works well as long as the mean intervertex distance $\ensuremath{\ell}$ is sufficiently small---that is, as long as …