Cecilia Holmgren
Professor at Department of Mathematics; Academic staff
- Telephone:
- +46 18 471 32 78
- Mobile phone:
- +46 70 425 04 69
- E-mail:
- cecilia.holmgren@math.uu.se
- Visiting address:
- Ångströmlaboratoriet, Regementsvägen 10
- Postal address:
- Box 480
751 06 UPPSALA
Download contact information for Cecilia Holmgren at Department of Mathematics; Academic staff
Professor at Department of Mathematics; Probability Theory and Combinatorics
- Telephone:
- +46 18 471 32 78
- Mobile phone:
- +46 70 425 04 69
- E-mail:
- cecilia.holmgren@math.uu.se
- Visiting address:
- Ångströmlaboratoriet, Regementsvägen 10
- Postal address:
- Box 480
751 06 UPPSALA
- Academic merits:
- PhD
Short presentation
My research area is probability theory and combinatorics, specifically random graphs.
A short presentation of myself is given in the biography field below.
Biography
My specific field of research is random graphs, especially random trees. I defended my PhD thesis “Split Trees, Cuttings and Explosions” in Uppsala in February, 2010 with Prof. Svante Janson as primary supervisor. Thereafter I spent two years abroad on a postdoc fellowship from the Swedish Research Council (VR), the first 8 months at INRIA in Paris with Prof. Philippe Flajolet and Dr Nicolas Broutin and then for 1½ years at Univ of Cambridge with Prof. Béla Bollobás and his group. In August, 2012 I got a tenured position as Assoc. Prof. (Senior Lecturer) at the Department of Mathematics at Stockholm University and from October, 2014 I am a Docent (associate professor) in Mathematics. From August 2015 I am working as docent in mathematics (probability theory and analysis) at the Dept of Mathematics at Uppsala University. In January 2018 I received a Ragnar Söderberg Fellowship based on my score A (highest) evaluation of my project application to the European Research Council with funding for 5 years matching an ERC fellowship.
Competitive External Funding:
- 2023-Grant from Knut and Alice Wallenberg foundation for hiring a postdoc, 1,844,000 SEK
- 2023-Grant for hiring an academic PhD student from WASP (Wallenberg AI, Autonomous systems and Software Program)
- 2022-2025: Four year project grant from the Swedish Research Council (senior researchers), 3,504,000 SEK
- 2018-2022: Five year Swedish Foundation Starting Grant from Ragnar Söderbergs Foundation (full funding for my ERC Starting grant project where I was awarded the highest score A but could not be funded from ERC due to budget constraints), 1,500,000 euros= 15,000,000 SEK
- 2018-2021: Four year project grant from the Swedish Research Council (senior researchers), 3,300,000 SEK
- 2018-2023: Project Grant from Knut and Alice Wallenberg Foundation (shared with Prof Svante Janson and Prof Erik Ekström), 27,500,000 SEK
- 2018: Grant for organising the Analysis of Algorithms conference in June 2018, Swedish Research Council and Marcus Wallenberg Foundation: 397,000 SEK
- 2016-2018: Grant from Knut and Alice Wallenberg foundation for hiring a postdoc, 1,700,000 SEK
- 2013-2016: Four year grant for young researchers from the Swedish Research Council, 3,200,000 SEK
- 2010-2012: Two year Postdoc fellowship from the Swedish Research Council 700,000 SEK
Awards:
- Wallenberg Prize in Mathematics 2024 from the Swedish Mathematics Society
- Scored A (highest) after the step 2 interview (Nov 2022) of my consolidator grant application to the European Research Council
- Ragnar Söderberg Fellowship 2018-22 based on score A (highest) evaluation of my starting grant application to the European Research Council
- Edlundska prize 2020 from Swedish Royal Academy of Science
- Göran Gustafsson prize for young researchers 2020 (in engineering physics, teknisk fysik) from Göran Gustafsson Foundation
- Prize from Ruth and Nils-Erik Stenbäcks Foundation 2021 awarded by The Finnish Society of Sciences and Letters and the Swedish Royal Academy of Sciences
Interview about my research (in Swedish)
Interview about my research (in English)
Forskning och Framsteg article in Swedish 2020
Forskning och Framsteg article in English 2020
Swedish Research Council journal Curie article in Swedish 2020
Edlundska prize interview in Swedish 2020
Brochure about the Department of Mathematics including an interview with me (in Swedish) 2020
Article about myself and my research by Alma Kirlic in Swedish
Article about myself and my research by Alma Kirlic in English Ragnar Söderberg interview about my research from the 2017 annual report of the Foundation (in Swedish) Article about my PhD thesis by Linda Koffmar in Swedish
Ragnar Söderberg Fellow: Description of my ERC project
Description of my Knut and Alice Wallenberg Foundation project 2016 in Swedish
Description of my Knut and Alice Wallenberg foundation project 2016 in English
Article about my award from Ragnar Söderberg Foundation in Swedish
Article about my award from Ragnar Söderberg Foundation in English
Article about my award from Knut and Alice Wallenberg Foundation in Swedish
Article about my award from Knut and Alice Wallenberg Foundation in English
Photo1PhotographerJohanMarklund
Photo2PhotographerJohanMarklund
Photo3PhotographerJohanMarklund
Members of my research group:
Postdocs: Main-advisor of Xing Shi Cai 2017-2021, Fiona Skerman 2017-19, Gabriel Berzunza 2018-2020, Paul Thevenin 2020-2022, Tiffany Lo 2022-2024, Suman Chakraborty 2022-2023, Jasper Ischebeck 2025- and Victor Dubach 2025- Co-advisor of Tony Johansson 2017-19, Debleena Thacker 2017-19 and Baptiste Louf.
Guest researcher September 2018-August 2019: Daniel Krenn
Guest Professor: Prof. Stephan Wagner (then at Stellenbosch University, South Africa) was guest Professor at Uppsala University January 2019-June 2019. He has now a tenured position at our Department.
PhD students: Colin Desmarais 2017-2022, Fabian Burghart 2018-2023 and Jakob Lundblad 2023- (main advisor) and Ruoyu Wang 2021- (co-advisor)
Publications
Recent publications
Fringe Trees for Random Trees With Given Vertex Degrees
Part of Random structures & algorithms (Print), 2025
- DOI for Fringe Trees for Random Trees With Given Vertex Degrees
- Download full text (pdf) of Fringe Trees for Random Trees With Given Vertex Degrees
Approximation of subgraph counts in the uniform attachment model
Part of Combinatorics, probability & computing, 2025
- DOI for Approximation of subgraph counts in the uniform attachment model
- Download full text (pdf) of Approximation of subgraph counts in the uniform attachment model
Fringe Trees for Random Trees with Given Vertex Degrees
Part of 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024), 2024
- DOI for Fringe Trees for Random Trees with Given Vertex Degrees
- Download full text (pdf) of Fringe Trees for Random Trees with Given Vertex Degrees
The root cluster after percolation on preferential attachment trees
Part of Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, EUROCOMB' 2023, p. 343-348, 2023
Invariance principle for fragmentation processes derived from conditioned stable Galton-Watson trees
Part of Bernoulli, p. 2745-2770, 2023
All publications
Articles in journal
Fringe Trees for Random Trees With Given Vertex Degrees
Part of Random structures & algorithms (Print), 2025
- DOI for Fringe Trees for Random Trees With Given Vertex Degrees
- Download full text (pdf) of Fringe Trees for Random Trees With Given Vertex Degrees
Approximation of subgraph counts in the uniform attachment model
Part of Combinatorics, probability & computing, 2025
- DOI for Approximation of subgraph counts in the uniform attachment model
- Download full text (pdf) of Approximation of subgraph counts in the uniform attachment model
Invariance principle for fragmentation processes derived from conditioned stable Galton-Watson trees
Part of Bernoulli, p. 2745-2770, 2023
Broadcasting-induced colorings of preferential attachment trees
Part of Random structures & algorithms (Print), p. 364-405, 2023
- DOI for Broadcasting-induced colorings of preferential attachment trees
- Download full text (pdf) of Broadcasting-induced colorings of preferential attachment trees
The asymptotic distribution of cluster sizes for supercritical percolation on random split trees
Part of Random structures & algorithms (Print), p. 631-652, 2022
The fluctuations of the giant cluster for percolation on random split trees
Part of Latin American Journal of Probability and Mathematical Statistics, p. 665-700, 2022
The k-cut model in deterministic and random trees
Part of The Electronic Journal of Combinatorics, 2021
- DOI for The k-cut model in deterministic and random trees
- Download full text (pdf) of The k-cut model in deterministic and random trees
Part of Discrete Applied Mathematics, p. 64-71, 2021
Embedding Small Digraphs and Permutations in Binary Trees and Split Trees
Part of Algorithmica, p. 589-615, 2020
- DOI for Embedding Small Digraphs and Permutations in Binary Trees and Split Trees
- Download full text (pdf) of Embedding Small Digraphs and Permutations in Binary Trees and Split Trees
Normal limit laws for vertex degrees in randomly grown hooking networks and bipolar networks
Part of The Electronic Journal of Combinatorics, 2020
kappa-cut on paths and some trees
Part of Electronic Journal of Probability, 2019
- DOI for kappa-cut on paths and some trees
- Download full text (pdf) of kappa-cut on paths and some trees
Heavy subtrees of Galton-Watson trees with an application to Apollonian networks
Part of Electronic Journal of Probability, p. 1-44, 2019
Cutting resilient networks - complete binary trees
Part of The Electronic Journal of Combinatorics, 2019
- DOI for Cutting resilient networks - complete binary trees
- Download full text (pdf) of Cutting resilient networks - complete binary trees
Limit laws for self-loops and multiple edges in the configuration model
Part of Annales de l'I.H.P. Probabilites et statistiques, p. 1509-1530, 2019
Inversions in Split Trees and Conditional Galton-Watson Treest
Part of Combinatorics, probability & computing, p. 335-364, 2019
Fringe trees, Crump-Mode-Jagers branching processes and m-ary search trees
Part of Probability Surveys, p. 53-154, 2017
- DOI for Fringe trees, Crump-Mode-Jagers branching processes and m-ary search trees
- Download full text (pdf) of Fringe trees, Crump-Mode-Jagers branching processes and m-ary search trees
Part of The Electronic Journal of Combinatorics, 2017
Majority Bootstrap Percolation on G(n, p)
Part of The Electronic Journal of Combinatorics, 2017
Limit laws for functions of fringe trees for binary search trees and random recursive trees
Part of Electronic Journal of Probability, 2015
- DOI for Limit laws for functions of fringe trees for binary search trees and random recursive trees
- Download full text (pdf) of Limit laws for functions of fringe trees for binary search trees and random recursive trees
Asymptotic distribution of two-protected nodes in ternary search trees
Part of Electronic Journal of Probability, 2015
On percolation in one-dimensional stable Poisson graphs
Part of Electronic Communications in Probability, 2015
- DOI for On percolation in one-dimensional stable Poisson graphs
- Download full text (pdf) of On percolation in one-dimensional stable Poisson graphs
Bootstrap percolation on Galton-Watson trees
Part of Electronic Journal of Probability, p. 1-27, 2014
- DOI for Bootstrap percolation on Galton-Watson trees
- Download full text (pdf) of Bootstrap percolation on Galton-Watson trees
Using Stein's method to show Poisson and normal limit laws for fringe subtrees.
Part of Discrete Mathematics & Theoretical Computer Science, p. 169-180, 2014
Cutting down trees with a Markov chainsaw
Part of The Annals of Applied Probability, p. 2297-2339, 2014
The time of bootstrap percolation with dense initial sets
Part of Annals of Probability, p. 1337-1373, 2014
Novel Characteristics of Split Trees by use of Renewal Theory
Part of Electronic Journal of Probability, p. 5, 2012
Counterexamples to a monotonicity conjecture for the threshold pebbling number
Part of Discrete Mathematics, p. 2401-2405, 2012
The total path length of split trees
Part of The Annals of Applied Probability, p. 1745-1777, 2012
A weakly 1-stable distribution for the number of random records and cuttings in split trees
Part of Advances in Applied Probability, p. 151-177, 2011
Random Records and Cuttings in Binary Search Trees
Part of Combinatorics, probability & computing, p. 391-424, 2010
Random records and cuttings in split trees.
Part of Discrete Mathematics & Theoretical Computer Science, p. 269-282, 2008
Comprehensive doctoral thesis
Conference papers
Fringe Trees for Random Trees with Given Vertex Degrees
Part of 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024), 2024
- DOI for Fringe Trees for Random Trees with Given Vertex Degrees
- Download full text (pdf) of Fringe Trees for Random Trees with Given Vertex Degrees
The root cluster after percolation on preferential attachment trees
Part of Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, EUROCOMB' 2023, p. 343-348, 2023
Fragmentation Processes Derived from Conditioned Stable Galton-Watson Trees
Part of 33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2022), 2022
- DOI for Fragmentation Processes Derived from Conditioned Stable Galton-Watson Trees
- Download full text (pdf) of Fragmentation Processes Derived from Conditioned Stable Galton-Watson Trees
Split Trees - A Unifying Model for Many Important Random Trees of Logarithmic Height: A Brief Survey
Part of Discrete Geometry and Mathematical Morphology, 0302-9743, p. 20-57, 2021