Preprints

1. Majority dynamics on random graphs: the multiple states case (joint with J. Chellig), preprint.
2. High-dimensional bootstrap processes in evolving simplicial complexes (joint with M. Przykucki), preprint.

Journal articles

1. Bootstrap percolation in inhomogeneous random graphs (joint with H.Amini and K. Panagiotou), Advances in Applied Probability, to appear.
2. Condensation phenomena in preferential attachment trees with neighbourhood influence (joint with T. Iyer), Electronic Journal of Probability27 (2022), 49pp.
3. Dynamical models for random simplicial complexes, (joint with T. Iyer, C. Mailler and H. Sulzbach), Annals of Applied Probability 32 (2022), 2860--2913. pdf
4. The modularity of random graphs on the hyperbolic plane (with J. Chellig and F. Skerman), Journal of Complex Networks 10 (2022), 32 pp.
5. Algebraic and combinatorial expansion in random simplicial complexes (joint with M. Przykucki), Random Structures and Algorithms 60 (2022), 339-366.
6. Percolation on random graphs with a fixed degree sequence, (joint with F. Joos and G. Perarnau), SIAM Journal on Discrete Mathematics 36 (2022), 1--46 .
7. Best response dynamics on random graphs (joint wiht J. Chellig and C. Durbac), Games and Economic Behavior 131 (2022), 141--170.
8. Clustering in a hyperbolic model of complex networks (joint with P. vd Hoorn, T. Müller and M. Schepers), Electronic Journal of Probability 26 (2021), 132pp.
9. Hamilton cycles and perfect matchings in the KPKVB model, (joint with D. Mietchse, T. Müller and M. Schepers), Stochastic Processes and their Applications 131 (2021), 340-358.
10. Resolution of a conjecture on majority dynamics: rapid stabilisation in dense random graphs (joint with M. Kang and T. Makai), Random Structures and Algorithms 57 (4) (2020), 1134-1156
11. Limit theory for the number of isolated and extreme points in hyperbolic random graphs (joint with J. Yukich), Electronic Journal of Probability 25 (2020), paper no. 141, 51 pages (electronic)
12. A phase transition on the evolution of bootstrap processes in inhomogeneous random graphs, (joint with M. Kang, C. Koch and T. Makai), Annals of Applied Probability 28 (2018), 990-1051.
13. Law of large numbers for the largest component in a hyperbolic model of complex networks, (joint with T. Müller), Annals of Applied Probability 28 (2018), 607-650.
14. A phase transition on the evolution of bootstrap percolation processes on preferential attachment graphs, (joint with M.Abdullah), Random Structures and Algorithms 52 (2018), 379-418.
15. Typical distances in a geometric model for complex networks, (joint with M. Abdullah and M. Bode), Internet Mathematics 1 (2017), 38 pages (electronic).
16. The probability of connectivity in a hyperbolic model of complex networks, (joint with M. Bode and T. Müller), Random Structures and Algorithms 49(1) (2016), 65-94.
17. Clustering and the hyperbolic geometry of complex networks (joint with E. Candellero), Internet Mathematics 12(1-2) (2016), 2-53.
    (a short version has appeared in Proceedings of the 11th International Workshop on Algorithms and Models for the Web graph (WAW'14) (A. Bonato et al. Eds.), Lecture Notes in Computer Science 8882, 2014, pp. 1-12.)
18. Multiple orientability thresholds for random hypergraphs (joint with M. Khosla and K. Panagiotou), Combinatorics, Probability and Computing 25(6) (2016), 870--908.
19. Bootstrap percolation and the geometry of complex networks (joint with E. Candellero), Stochastic Processes and their Applications 126(1) (2016), 234-264.
20. On the largest component of a hyperbolic model of complex networks, (joint with M. Bode and T. Müller), Electronic Journal of Combinatorics 22 (3) (2015), 3.24.
21. On a geometrization of the Chung-Lu model for complex networks, Journal of Complex Networks 3(3) (2015), 361-387.
22. On the average-case complexity of parametrised clique, (joint with T. Friedrich and D. Hermelin), Theoretical Computer Science 576 (2015), 18-29.
23. Bootstrap percolation in power-law random graphs, (joint with H. Amini) J. Stat. Phys. 155 (2014), 72-92.
24. Largest sparse subgraphs of random graphs, (joint with R. Kang and C. McDiarmid), European J. Combin. 35 (2014), 232-244.
25. On the insertion time of Cuckoo hashing (joint with K. Panagiotou and A. Steger), SIAM Journal on Computing 42 (2013), 2156-2181.
26. Rumor spreading on random regular graphs and expanders, (joint with K. Panagiotou), Random Structures and Algorithms 41 (2013), 201-220.
27. Sharp load thresholds for Cuckoo hashing, (joint with K. Panagiotou), Random Structures and Algorithms 41 (2012), 306-333.
28. 3-Connected Cores in Random Planar Graphs,(joint with K. Panagiotou), Combinatorics, Probability and Computing 20(3) (2011), 381-412.
29. The t-stability number of a random graph, (joint with C.J.H. McDiarmid and R. Kang), The Electronic Journal of Combinatorics R(59), 2010.
30. Quasirandom rumor spreading on the complete graph is as fast as randomized rumor spreading, (joint with A. Huber), SIAM Journal on Discrete Mathematics 23 (2009), 1964-1991.
31. Embeddings and Ramsey numbers of sparse k-uniform hypergraphs (joint with O.J. Cooley, D. Kühn and D. Osthus), Combinatorica 29 (2009), 263-297.
32. Minors in random regular graphs (joint with D. Kühn and D. Osthus), Random Structures and Algorithms 35 (2009), 444-463.
33. The order of the largest complete minor in a random graph (joint with D. Kühn and D. Osthus), Random Structures and Algorithms 33 (2008), 127-141.
34. 3-Uniform hypergraphs of bounded degree have linear Ramsey numbers (joint with O.J. Cooley, D. Kühn and D. Osthus), Journal of Combinatorial Theory B 98(2008), 484-505.
35. The evolution of the mixing rate of a simple random walk on the giant component of a random graph , (joint with B. A. Reed), Random Structures and Algorithms 33 (2008), 68-86.
36. Percolation on sparse random graphs with given degree sequence, Internet Mathematics 4 (2007), 329-356.
37. Faster Mixing and Small Bottlenecks , (joint with B. A. Reed), Probability Theory and Related Fields 137 (2007), 475-486.
38. Upper bounds on the non-3-colourability threshold of random graphs (joint with C.J.H. McDiarmid), Discrete Mathematics and Theoretical Computer Science 5 (2002), 205-226.

Refereed conferences

1. Local majority dynamics on preferential attachement graphs (full version), (joint with M. Abdullah and M. Bode), Proceedings of the 11th International Workshop on Algorithms and Models for the Web graph (WAW'14) (A. Bonato et al. Eds.), Lecture Notes in Computer Science 9479, 2015, pp. 95-106.
2. What I tell you three times in true: bootstrap percolation in small worlds, (joint with H. Amini), In Proceedings of the 8th Workshop on Internet and Network Economics (WINE '12) (P. Goldberg, Ed.), Lecture Notes in Computer Science, 7695, 2012, pp. 462-474.
3. Ultra-fast rumor spreading in social networks (joint with K.Panagiotou and T.Sauerwald), In Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, 2012, pp. 1642-1660.
4. The multiple-orientability thresholds of random hypergraphs (joint with M. Koshla and K. Panagiotou), In Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, U.S.A., 2011, pp.1222-1236.
5. Rumor spreading on random regular graphs and expanders, (joint with K. Panagiotou), In Proceedings of RANDOM 2010, Leture Notes in Computer Science 6302, Springer, 2010, pp. 560-573.
6. Orientability of random hypergraphs and the power of multiple choices , (joint with K.Panagiotou) In Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP 2010), Lecture Notes in Computer Science 6198, Springer, 2010, pp. 348-359.
7. Reliable broadcasting on random networks and the effect of density , (joint with A.Huber and K.Panagiotou) In Proceedings of IEEE INFOCOM 2010, 2010, pp. 2552-2560.
8. Brief announcement:The speed of broadcasting in random networks: density does not matter, (joint with A. Huber and K. Panagiotou), In Proceedings of the 23rd International Symposium on Distributed Computing (DISC 2009), Lecture Notes in Computer Science 5805, Springer, 2009, pp. 529-530.
9. A general critical condition for the emergence of a giant component in random graphs with given degrees, (joint with B. Reed) In Proceedings of EUROCOMB 2009, Electronic Notes in Discrete Mathematics 34, 2009, pp. 639-645

Edited volumes

1. Random graphs, geometry and asymptotic structure (authors: M. Krivelevich, K. Panagiotou, M.Penrose and C. McDiarmid, co-editor: D. Hefetz), London Mathematical Society Students Texts, Cambridge University Press, 2016.