35 citations · 123 across the 21 of their papers we have counts for
5 papers · 1 filter
Normal limit laws for vertex degrees in randomly grown hooking networks and bipolar networks
Colin Desmarais, Cecilia Holmgren
We consider two types of random networks grown in blocks. Hooking networks are grown from a set of graphs as blocks, each with a labelled vertex called a hook. At each step in the…
A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees
Michael Fuchs, Cecilia Holmgren, Dieter Mitsche +1
We identify the mean growth of the independence number of random binary search trees and random recursive trees and show normal fluctuations around their means. Similarly we also s…
The -cut model in deterministic and random trees
Gabriel Berzunza, Xing Shi Cai, Cecilia Holmgren
The -cut number of rooted graphs was introduced by Cai et al. as a generalization of the classical cutting model by Meir and Moon. In this paper, we show that all moments of the…
The fluctuations of the giant cluster for percolation on random split trees
Gabriel Berzunza, Xing Shi Cai, Cecilia Holmgren
A split tree of cardinality is constructed by distributing "balls" in a subset of vertices of an infinite tree which encompasses many types of random trees such as -ary…
Embedding small digraphs and permutations in binary trees and split trees
Michael Albert, Cecilia Holmgren, Tony Johansson +1
We investigate the number of permutations that occur in random labellings of trees. This is a generalisation of the number of subpermutations occurring in a random permutation. It…