Testing spreading behavior in networks with arbitrary topologies

DOI10.4230/LIPICS.ICALP.2024.112MaRDI QIDQ6875077zbMATH OpenFDO

Authors Augusto Modanese, Yuichi Yoshida

Publication date 14 January 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2024.112

zbMATH Keywords

bootstrap percolationexpander graphslocal phenomenaproperty testing

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• An algebraic characterization of testable Boolean CSPs
• Bootstrap percolation on the random graph \(G_{n,p}\)
• Bootstrap percolation on the random regular graph
• Computational Complexity
• Constant-query testability of assignments to constraint satisfaction problems
• Convergence in (social) influence networks
• Excluded minors, network decomposition, and multicommodity flow
• scientific article; zbMATH DE number 6851888 (Why is no real title available?)
• Majority model on random regular graphs
• Monotonicity testing over general poset domains
• On learning and testing dynamic environments
• Property testing. Problems and techniques
• Pseudorandomness
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Tight bounds on the minimum size of a dynamic monopoly

This page was built for publication: Testing spreading behavior in networks with arbitrary topologies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875077)