The following pages link to Cecilia Holmgren (Q400561):
Displayed 41 items.
- The time of bootstrap percolation with dense initial sets (Q400563) (← links)
- Novel characteristics of split trees by use of renewal theory (Q428606) (← links)
- Counterexamples to a monotonicity conjecture for the threshold pebbling number (Q442335) (← links)
- Cutting down trees with a Markov chainsaw (Q473156) (← links)
- Majority bootstrap percolation on \(G(n,p)\) (Q510304) (← links)
- Fringe trees, Crump-Mode-Jagers branching processes and \(m\)-ary search trees (Q521300) (← links)
- The total path length of split trees (Q691101) (← links)
- Heavy subtrees of Galton-Watson trees with an application to Apollonian networks (Q1721992) (← links)
- Split trees -- a unifying model for many important random trees of logarithmic height: a brief survey (Q2061784) (← links)
- Normal limit laws for vertex degrees in randomly grown hooking networks and bipolar networks (Q2188836) (← links)
- The \(k\)-cut model in deterministic and random trees (Q2223481) (← links)
- A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees (Q2223687) (← links)
- Cutting resilient networks -- complete binary trees (Q2278120) (← links)
- Embedding small digraphs and permutations in binary trees and split trees (Q2292861) (← links)
- \(k\)-cuts on a path (Q2294043) (← links)
- Limit laws for self-loops and multiple edges in the configuration model (Q2337833) (← links)
- Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees (Q2363114) (← links)
- \(k\)-cut on paths and some trees (Q2423460) (← links)
- Limit laws for functions of fringe trees for binary search trees and random recursive trees (Q2514319) (← links)
- Asymptotic distribution of two-protected nodes in ternary search trees (Q2515874) (← links)
- On percolation in one-dimensional stable Poisson graphs (Q2517278) (← links)
- Bootstrap percolation on Galton-Watson trees (Q2637757) (← links)
- (Q2789554) (← links)
- (Q2959868) (← links)
- A weakly 1-stable distribution for the number of random records and cuttings in split trees (Q2996574) (← links)
- Random Records and Cuttings in Binary Search Trees (Q3058297) (← links)
- (Q4632487) (← links)
- Embedding small digraphs and permutations in binary trees and split trees (Q4993531) (← links)
- Inversions in split trees and conditional Galton--Watson trees (Q4993537) (← links)
- The fluctuations of the giant cluster for percolation on random split trees (Q5093986) (← links)
- Degree distributions of generalized hooking networks (Q5195238) (← links)
- Inversions in Split Trees and Conditional Galton–Watson Trees (Q5222541) (← links)
- (Q5874403) (← links)
- Largest Clusters for Supercritical Percolation on Split Trees (Q5874404) (← links)
- The asymptotic distribution of cluster sizes for supercritical percolation on random split trees (Q6074697) (← links)
- (Q6161818) (← links)
- A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees (Q6326129) (← links)
- Invariance principle for fragmentation processes derived from conditioned stable Galton-Watson trees (Q6351417) (← links)
- Convergence of trees with a given degree sequence and of their associated laminations (Q6383077) (← links)
- Approximation of Subgraph Counts in the Uniform Attachment Model (Q6458442) (← links)
- Fringe trees for random trees with given vertex degrees (Q6462577) (← links)