Adva Mond

Adva Mond is a Researcher in the Department of Mathematics at King's College London, affiliated with the Probability Group within the Faculty of Natural, Mathematical & Engineering Sciences. She holds a PhD from the University of Cambridge, supervised by Professor Béla Bollobás, and a postdoctoral position under Dr. Matthew Jenssen. Her research focuses on Discrete Probability, Random Graphs, and Extremal Combinatorics, with a particular emphasis on probabilistic combinatorics and graph theory applications.

Education:

• BSc and MSc in Pure Mathematics, Tel Aviv University
• Part III Mathematics, University of Cambridge
• PhD in Combinatorics, University of Cambridge

Research Interests: Adva's work explores theoretical and applied aspects of combinatorics, including random graph structures, extremal problems, and probabilistic methods. She investigates properties of Hamiltonian cycles, graph decomposition, and percolation processes. Her recent studies address spanning forests, discrepancy in dense graphs, and game-theoretic approaches to combinatorial problems.

Publications: Over 10 peer-reviewed articles and preprints, focusing on probabilistic combinatorics, graph algorithms, and extremal graph theory. Key contributions include work on Hamiltonian cycles in hypergraphs, online Ramsey numbers, and percolation games on random graphs.

Labs/Teams: Active member of the Probability Group at King's College London, collaborating with institutions globally on interdisciplinary projects in combinatorics and graph theory.