D. Aldous and J. Pitman, The asymptotic speed and shape of a particle system, Probability, statistics and analysis, vol.79, pp.1-23, 1983.

A. B. Barak and P. Erd?, On the maximal number of strongly independent vertices in a random acyclic directed graph, SIAM J. Algebraic Discrete Methods, vol.5, issue.4, pp.508-514, 1984.

J. Bérard and J. Gouéré, Brunet-Derrida behavior of branching-selection particle systems on the line, Comm. Math. Phys, vol.298, issue.2, pp.323-342, 2010.

E. Brunet and B. Derrida, Shift in the velocity of a front due to a cutoff, Phys. Rev. E, vol.56, issue.3, pp.2597-2604, 1997.

K. Chernysh and S. Ramassamy, Coupling any number of balls in the infinite-bin model, J. Appl. Probab, vol.54, issue.2, pp.540-549, 2017.
URL : https://hal.archives-ouvertes.fr/ensl-01651026

J. E. Cohen and C. M. Newman, Community area and food-chain length: theoretical predictions, Amer. Naturalist, pp.1542-1554, 1991.
DOI : 10.1086/285299

F. Comets, R. Fernández, and P. A. Ferrari, Processes with long memory: regenerative construction and perfect simulation, Ann. Appl. Probab, vol.12, issue.3, pp.921-943, 2002.
DOI : 10.1214/aoap/1031863175
URL : https://doi.org/10.1214/aoap/1031863175

D. Denisov, S. Foss, and T. Konstantopoulos, Limit theorems for a random directed slab graph, Ann. Appl. Probab, vol.22, issue.2, pp.702-733, 2012.
DOI : 10.1214/11-aap783
URL : https://doi.org/10.1214/11-aap783

P. Erd?-os and A. Rényi, On random graphs. I, Publ. Math. Debrecen, vol.6, pp.290-297, 1959.

S. Foss and T. Konstantopoulos, Extended renovation theory and limit theorems for stochastic ordered graphs, Markov Process. Related Fields, vol.9, issue.3, pp.413-468, 2003.

S. Foss, J. B. Martin, and P. Schmidt, Long-range last-passage percolation on the line, Ann. Appl. Probab, vol.24, issue.1, pp.198-234, 2014.
DOI : 10.1214/13-aap920
URL : https://doi.org/10.1214/13-aap920

S. Foss and S. Zachary, Stochastic sequences with a regenerative structure that may depend both on the future and on the past, Adv. in Appl. Probab, vol.45, issue.4, pp.1083-1110, 2013.

E. Gelenbe, R. Nelson, T. Philips, and A. Tantawi, An approximation of the processing time for a random graph model of parallel computation, Proceedings of 1986 ACM Fall Joint Computer Conference, ACM '86, pp.691-697, 1986.

M. Isopi and C. M. Newman, Speed of parallel processing for random task graphs, Comm. Pure Appl. Math, vol.47, issue.3, pp.361-376, 1994.
DOI : 10.1002/cpa.3160470307

T. Konstantopoulos and K. Trinajsti´ctrinajsti´c, Convergence to the Tracy-Widom distribution for longest paths in a directed random graph, ALEA Lat. Am. J. Probab. Math. Stat, vol.10, issue.2, pp.711-730, 2013.

B. Mallein, Branching random walk with selection at critical rate, Bernoulli, vol.23, issue.3, pp.1784-1821, 2017.
DOI : 10.3150/15-bej796
URL : https://hal.archives-ouvertes.fr/hal-01322449

B. Mallein and S. Ramassamy, Barak-Erdös graphs and the infinite-bin model, 2016.

C. M. Newman, Chain lengths in certain random directed graphs, Random Structures Algorithms, vol.3, issue.3, pp.243-253, 1992.
DOI : 10.1002/rsa.3240030304

C. M. Newman and J. E. Cohen, A stochastic theory of community food webs IV: theory of food chain lengths in large webs, Proc. Roy. Soc. London B: Biol. Sci, vol.228, pp.355-377, 1252.

J. G. Propp and D. B. Wilson, Exact sampling with coupled Markov chains and applications to statistical mechanics, Proceedings of the Seventh International Conference on Random Structures and Algorithms, vol.9, pp.223-252, 1995.
DOI : 10.1002/(sici)1098-2418(199608/09)9:1/2<223::aid-rsa14>3.3.co;2-r

L. Bastien-mallein and . Galilée,

F. E. Villetaneuse,

S. Ramassamy, Unité de Mathématiques Pures et Appliquées, ´ Ecole normale supérieure de Lyon, 46 allée d'Italie, 69364 Lyon Cedex 07, France E-mail address: sanjay