Jigsaw percolation: what social networks can collaboratively solve a puzzle?

DOI10.1214/14-AAP1041zbMath1322.60210arXiv1207.1927OpenAlexW3106344820MaRDI QIDQ2354890

Charles D. Brummitt, Partha S. Dey, Shirshendu Chatterjee, David Sivakoff

Publication date: 27 July 2015

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1207.1927

zbMATH Keywords

percolationphase transitionsocial networksrandom graph

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Related Items

The threshold for jigsaw percolation on random graphs, Bootstrap percolation on a graph with random and local connections, Transitive closure in a polluted environment, The size of the giant joint component in a binomial random double graph, Shotgun identification on groups, Jigsaw percolation on random hypergraphs, Mimicking the collective intelligence of human groups as an optimization tool for complex problems, The sharp threshold for jigsaw percolation in random graphs, Bootstrap percolation on the stochastic block model

Cites Work

• Unnamed Item
• Nucleation scaling in jigsaw percolation
• Distance in random graphs with infinite mean degrees
• Slow convergence in bootstrap percolation
• Sharp metastability threshold for two-dimensional bootstrap percolation
• Evolution of the social network of scientific collaborations
• From the Cover: The structure of scientific collaboration networks
• On the strength of connectedness of a random graph
• Metastability effects in bootstrap percolation
• Percolation
• A critical point for random graphs with a given degree sequence
• The average distances in random graphs with given expected degrees