40 citations · 172 across the 51 of their papers we have counts for
6 papers · 1 filter
Conditioned Galton-Watson trees: The shape functional, and more on the sum of powers of subtree sizes and its mean
James Allen Fill, Svante Janson, Stephan Wagner
For a complex number , we consider the sum of the th powers of subtree sizes in Galton--Watson trees conditioned to be of size . Limiting distributions of this functional…
The Uncover Process for Random Labeled Trees
Benjamin Hackl, Alois Panholzer, Stephan Wagner
We consider the process of uncovering the vertices of a random labeled tree according to their labels. First, a labeled tree with vertices is generated uniformly at random. The…
The distribution of the number of automorphisms of random trees
Christoffer Olsson, Stephan Wagner
We study the size of the automorphism group of two different types of random trees: Galton--Watson trees and rooted Pólya trees. In both cases, we prove that it asymptotically foll…
Broadcasting induced colourings of random recursive trees and preferential attachment trees
Colin Desmarais, Cecilia Holmgren, Stephan Wagner
In this work we consider random two-colourings of random linear preferential attachment trees, which includes random recursive trees, random plane-oriented recursive trees, random…
Uniform spanning trees on Sierpinski graphs
Masato Shinoda, Elmar Teufl, Stephan Wagner
We study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for…
Coupons collecting with or without replacement, and with multipurpose coupons
Marcel Wild, Svante Janson, Stephan Wagner +1
The classic Coupon-Collector Problem (CCP) is generalized to the extent that each coupons serves certain "purposes". Only basic probability theory is used. Centerpiece rather is an…