Jigsaw percolation: What social networks can collaboratively solve a puzzle?
Charles D. Brummitt, Shirshendu Chatterjee, Partha S. Dey, David, Sivakoff

TL;DR
This paper introduces jigsaw percolation, a new model of social networks solving puzzles through merging ideas, and analyzes the conditions under which different network structures can successfully solve puzzles.
Contribution
It defines the jigsaw percolation model, analyzes the critical connectivity thresholds for solving puzzles, and reveals limitations of power-law networks in solving bounded-degree puzzles.
Findings
For an n-cycle puzzle, the critical probability is Θ(1/ log n).
Connected bounded-degree puzzles are solvable with probability approaching 1 if p_n = O(1/ log n).
Power-law degree networks almost surely cannot solve bounded-degree puzzles.
Abstract
We introduce a new kind of percolation on finite graphs called jigsaw percolation. This model attempts to capture networks of people who innovate by merging ideas and who solve problems by piecing together solutions. Each person in a social network has a unique piece of a jigsaw puzzle. Acquainted people with compatible puzzle pieces merge their puzzle pieces. More generally, groups of people with merged puzzle pieces merge if the groups know one another and have a pair of compatible puzzle pieces. The social network solves the puzzle if it eventually merges all the puzzle pieces. For an Erd\H{o}s-R\'{e}nyi social network with vertices and edge probability , we define the critical value for a connected puzzle graph to be the for which the chance of solving the puzzle equals . We prove that for the -cycle (ring) puzzle, , and for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
