The threshold for jigsaw percolation on random graphs
Jigsaw percolation is a model for the process of solving puzzles within a social network, which was recently proposed by Brummitt, Chatterjee, Dey and Sivakoff. In the model there are two graphs on a single vertex set (the ‘people’ graph and the ‘puzzle’ graph), and vertices merge to form components...
Autors principals: | Bollobás, B, Riordan, O, Slivken, E, Smith, P |
---|---|
Format: | Journal article |
Publicat: |
Electronic Journal of Combinatorics
2017
|
Ítems similars
-
Sharp thresholds and percolation in the plane
per: Bollobas, B, et al.
Publicat: (2004) -
Percolation on dense graph sequences
per: Bollobás, B, et al.
Publicat: (2007) -
Percolation on random Johnson-Mehl tessellations and related models
per: Bollobas, B, et al.
Publicat: (2006) -
Percolation.
per: Bollobás, B, et al.
Publicat: (2006) -
On the maximum running time in graph bootstrap percolation
per: Bollobás, B, et al.
Publicat: (2017)