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 and nonzero clustering introduced previously in [M. E. J. Newman, Phys. Rev. Lett. 103, 058701 (2009)]. A condition for the existence of global cascades is derived as well as a general criterion that determines whether increasing the level of clustering will increase, or decrease, the expected cascade size. Applications, examples of which are provided, include site percolation, bond percolation, and Watts' threshold model; in all cases analytical results give excellent agreement with numerical simulations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cascades on clique-based graphs

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 [J. P. Gleeson, Phys. Rev. E 80, 036107 (2009)]. A condition for the existence of global cascades is also derived. Applications of this approach include analyses of percolation, and Watts's model. We show how our tec...

متن کامل

Single-Seed Cascades on Clustered Networks

We consider a dynamic network cascade process developed by Watts [20] applied to a random networks with a specified amount of clustering, belonging to a class of random networks developed by Newman [19]. We adapt tree-based methods from [20] to formulate an appropriate two-type branching process to describe the spread of a cascade started with a single active node, and obtain a fixed-point equa...

متن کامل

Percolation and epidemics in random clustered networks.

The social networks that infectious diseases spread along are typically clustered. Because of the close relation between percolation and epidemic spread, the behavior of percolation in such networks gives insight into infectious disease dynamics. A number of authors have studied percolation or epidemics in clustered networks, but the networks often contain preferential contacts in high degree n...

متن کامل

Percolation in clustered networks

The social networks that infectious diseases spread along are typically clustered. Because of the close relation between percolation and epidemic spread, the behavior of percolation in such networks gives insight into infectious disease dynamics. A number of authors have studied clustered networks, but the networks often contain preferential mixing between high degree nodes. We introduce a clas...

متن کامل

Information cascades on degree-correlated random networks.

We investigate by numerical simulation a threshold model of social contagion on degree-correlated random networks. We show that the class of networks for which global information cascades occur generally expands as degree-degree correlations become increasingly positive. However, under certain conditions, large-scale information cascades can paradoxically occur when degree-degree correlations a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Physical review. E, Statistical, nonlinear, and soft matter physics

دوره 83 5 Pt 2  شماره 

صفحات  -

تاریخ انتشار 2011