Cecilia Holmgren
Professor vid Matematiska institutionen; Akademisk personal
- Telefon:
- 018-471 32 78
- Mobiltelefon:
- 070-425 04 69
- E-post:
- cecilia.holmgren@math.uu.se
- Besöksadress:
- Ångströmlaboratoriet, Lägerhyddsvägen 1
- Postadress:
- Box 480
751 06 UPPSALA
Ladda ned kontaktuppgifter för Cecilia Holmgren vid Matematiska institutionen; Akademisk personal
Professor vid Matematiska institutionen; Sannolikhetsteori och kombinatorik
- Telefon:
- 018-471 32 78
- Mobiltelefon:
- 070-425 04 69
- E-post:
- cecilia.holmgren@math.uu.se
- Besöksadress:
- Ångströmlaboratoriet, Lägerhyddsvägen 1
- Postadress:
- Box 480
751 06 UPPSALA
- Akademiska meriter:
- FD, Docent
Biografi
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:
- 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- and Suman Chakraborty 2022- 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)
Publikationer
Senaste publikationer
Invariance principle for fragmentation processes derived from conditioned stable Galton-Watson trees
Ingår i Bernoulli, s. 2745-2770, 2023
Broadcasting-induced colorings of preferential attachment trees
Ingår i Random structures & algorithms (Print), s. 364-405, 2023
- DOI för Broadcasting-induced colorings of preferential attachment trees
- Ladda ner fulltext (pdf) av Broadcasting-induced colorings of preferential attachment trees
The asymptotic distribution of cluster sizes for supercritical percolation on random split trees
Ingår i Random structures & algorithms (Print), s. 631-652, 2022
The fluctuations of the giant cluster for percolation on random split trees
Ingår i Latin American Journal of Probability and Mathematical Statistics, s. 665-700, 2022
Split Trees - A Unifying Model for Many Important Random Trees of Logarithmic Height: A Brief Survey
Ingår i Discrete Geometry and Mathematical Morphology, 0302-9743, s. 20-57, 2021
Alla publikationer
Artiklar i tidskrift
Invariance principle for fragmentation processes derived from conditioned stable Galton-Watson trees
Ingår i Bernoulli, s. 2745-2770, 2023
Broadcasting-induced colorings of preferential attachment trees
Ingår i Random structures & algorithms (Print), s. 364-405, 2023
- DOI för Broadcasting-induced colorings of preferential attachment trees
- Ladda ner fulltext (pdf) av Broadcasting-induced colorings of preferential attachment trees
The asymptotic distribution of cluster sizes for supercritical percolation on random split trees
Ingår i Random structures & algorithms (Print), s. 631-652, 2022
The fluctuations of the giant cluster for percolation on random split trees
Ingår i Latin American Journal of Probability and Mathematical Statistics, s. 665-700, 2022
The k-cut model in deterministic and random trees
Ingår i The Electronic Journal of Combinatorics, 2021
- DOI för The k-cut model in deterministic and random trees
- Ladda ner fulltext (pdf) av The k-cut model in deterministic and random trees
Ingår i Discrete Applied Mathematics, s. 64-71, 2021
Normal limit laws for vertex degrees in randomly grown hooking networks and bipolar networks
Ingår i The Electronic Journal of Combinatorics, 2020
Embedding Small Digraphs and Permutations in Binary Trees and Split Trees
Ingår i Algorithmica, s. 589-615, 2020
- DOI för Embedding Small Digraphs and Permutations in Binary Trees and Split Trees
- Ladda ner fulltext (pdf) av Embedding Small Digraphs and Permutations in Binary Trees and Split Trees
kappa-cut on paths and some trees
Ingår i Electronic Journal of Probability, 2019
- DOI för kappa-cut on paths and some trees
- Ladda ner fulltext (pdf) av kappa-cut on paths and some trees
Heavy subtrees of Galton-Watson trees with an application to Apollonian networks
Ingår i Electronic Journal of Probability, s. 1-44, 2019
Cutting resilient networks - complete binary trees
Ingår i The Electronic Journal of Combinatorics, 2019
- DOI för Cutting resilient networks - complete binary trees
- Ladda ner fulltext (pdf) av Cutting resilient networks - complete binary trees
Limit laws for self-loops and multiple edges in the configuration model
Ingår i Annales de l'I.H.P. Probabilites et statistiques, s. 1509-1530, 2019
Inversions in Split Trees and Conditional Galton-Watson Treest
Ingår i Combinatorics, probability & computing, s. 335-364, 2019
Fringe trees, Crump-Mode-Jagers branching processes and m-ary search trees
Ingår i Probability Surveys, s. 53-154, 2017
- DOI för Fringe trees, Crump-Mode-Jagers branching processes and m-ary search trees
- Ladda ner fulltext (pdf) av Fringe trees, Crump-Mode-Jagers branching processes and m-ary search trees
Ingår i The Electronic Journal of Combinatorics, 2017
Majority Bootstrap Percolation on G(n, p)
Ingår i The Electronic Journal of Combinatorics, 2017
Limit laws for functions of fringe trees for binary search trees and random recursive trees
Ingår i Electronic Journal of Probability, 2015
- DOI för Limit laws for functions of fringe trees for binary search trees and random recursive trees
- Ladda ner fulltext (pdf) av 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
Ingår i Electronic Journal of Probability, 2015
On percolation in one-dimensional stable Poisson graphs
Ingår i Electronic Communications in Probability, 2015
- DOI för On percolation in one-dimensional stable Poisson graphs
- Ladda ner fulltext (pdf) av On percolation in one-dimensional stable Poisson graphs
Bootstrap percolation on Galton-Watson trees
Ingår i Electronic Journal of Probability, s. 1-27, 2014
- DOI för Bootstrap percolation on Galton-Watson trees
- Ladda ner fulltext (pdf) av Bootstrap percolation on Galton-Watson trees
Using Stein's method to show Poisson and normal limit laws for fringe subtrees.
Ingår i Discrete Mathematics & Theoretical Computer Science, s. 169-180, 2014
Cutting down trees with a Markov chainsaw
Ingår i The Annals of Applied Probability, s. 2297-2339, 2014
The time of bootstrap percolation with dense initial sets
Ingår i Annals of Probability, s. 1337-1373, 2014
Novel Characteristics of Split Trees by use of Renewal Theory
Ingår i Electronic Journal of Probability, s. 5, 2012
Counterexamples to a monotonicity conjecture for the threshold pebbling number
Ingår i Discrete Mathematics, s. 2401-2405, 2012
The total path length of split trees
Ingår i The Annals of Applied Probability, s. 1745-1777, 2012
A weakly 1-stable distribution for the number of random records and cuttings in split trees
Ingår i Advances in Applied Probability, s. 151-177, 2011
Random Records and Cuttings in Binary Search Trees
Ingår i Combinatorics, probability & computing, s. 391-424, 2010
Random records and cuttings in split trees.
Ingår i Discrete Mathematics & Theoretical Computer Science, s. 269-282, 2008
Doktorsavhandlingar, sammanläggning
Konferensbidrag
Split Trees - A Unifying Model for Many Important Random Trees of Logarithmic Height: A Brief Survey
Ingår i Discrete Geometry and Mathematical Morphology, 0302-9743, s. 20-57, 2021