M. Granovetter, Threshold models of collective behavior, American journal of sociology, vol.83, pp.1420-1443, 1978.
DOI : 10.1086/226707

J. Chalupa, G. Paul-l-leath, and . Reich, Bootstrap percolation on a bethe lattice, Journal of Physics C: Solid State Physics, vol.12, p.31, 1979.
DOI : 10.1088/0022-3719/12/1/008

D. Reichman, New bounds for contagious sets, Discrete Mathematics, vol.312, pp.1812-1814, 2012.
DOI : 10.1016/j.disc.2012.01.016
URL : https://doi.org/10.1016/j.disc.2012.01.016

A. Coja-oghlan, U. Feige, M. Krivelevich, and D. Reichman, Contagious sets in expanders, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.1953-1987, 2015.

A. Guggiola and G. Semerjian, Minimal contagious sets in random regular graphs, Journal of Statistical Physics, vol.158, pp.300-358, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01061756

A. Paul, F. S. Dreyer, and . Roberts, Irreversible k-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion, Discrete Applied Mathematics, vol.157, pp.1615-1627, 2009.

A. Fabrizio-altarelli, L. Braunstein, R. Dallasta, and . Zecchina, Optimizing spread dynamics on graphs by message passing, Journal of Statistical Mechanics: Theory and Experiment, p.9011, 2013.

A. Fabrizio-altarelli, L. Braunstein, R. Dallasta, and . Zecchina, Large deviations of cascade processes on graphs, Physical Review E, vol.87, p.62115, 2013.

A. Braunstein, L. Dall'asta, G. Semerjian, and L. Zdeborová, Network dismantling, Proceedings of the National Academy of Sciences, vol.113, pp.12368-12373, 2016.
DOI : 10.1073/pnas.1605083113
URL : http://europepmc.org/articles/pmc5098660?pdf=render

P. Sen, T. Xian, J. Shaman, F. Morone, and . Makse, Efficient collective influence maximization in cascading processes with first-order transitions, Scientific Reports, 2017.

M. Richard and . Karp, Reducibility among combinatorial problems, Complexity of computer computations, pp.85-103, 1972.

S. Bau, N. C. Wormald, and S. Zhou, Decycling numbers of random regular graphs, Random Structures and Algorithms, vol.21, pp.397-413, 2002.

C. Hoppen and N. Wormald, Induced forests in regular graphs with large girth, Comb. Probab. Comput, vol.17, pp.389-410, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01185567

H. Zhou, Spin glass approach to the feedback vertex set problem, The European Physical Journal B, vol.86, p.455, 2013.

J. Ding, A. Sly, and N. Sun, Proof of the satisfiability conjecture for large k, Proceedings of the forty-seventh annual ACM symposium on Theory of Computing, pp.59-68, 2015.

C. Nicholas and . Wormald, Differential equations for random processes and random graphs, Ann. Appl. Probab, vol.5, pp.1217-1235, 1995.

H. D. Pfister, The analysis of graph peeling processes, 2014.

M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, Efficient erasure correcting codes, IEEE Trans. Inform. Theory, vol.47, pp.569-584, 2001.

D. Achlioptas, Setting 2 variables at a time yields a new lower bound for random 3-SAT, Proceedings of the thirty-second annual ACM symposium on Theory of Computing, pp.28-37, 2000.

D. Achlioptas, Lower bounds for random 3-SAT via differential equations, Theoretical Computer Science, vol.265, pp.159-185, 2001.

S. Cocco and R. Monasson, Statistical physics analysis of the computational complexity of solving random satisfiability problems using backtrack algorithms, Physics of Condensed Matter, vol.22, pp.505-531, 2001.

B. Pittel, J. Spencer, and N. Wormald, Sudden emergence of a giant k-core in a random graph, Journal of Combinatorial Theory-Series B, vol.67, 1996.

C. Nicholas and . Wormald, The differential equation method for random graph processes and greedy algorithms, Lectures on approximation and randomized algorithms, pp.73-155, 1999.

E. Ackerman, O. Ben-zwi, and G. Wolfovitz, Combinatorial model and bounds for target set selection, Theoretical Computer Science, vol.411, pp.4017-4022, 2010.