1 citations · 1 across the 6 of their papers we have counts for
6 papers
Ancestries in random -DAGs
Fabian Burghart
We consider a random recursive DAG on the vertex set where every vertex has out-degree , with the targets chosen uniformly at random among the earlier $i-1…
On Cycles in Multiset Permutations, Parking Functions, and Related Structures
Calum Buchanan, Fabian Burghart, Stephan Wagner +1
In this paper we study cycles in multiset permutations and parking functions. As combinatorial objects, multiset permutations are essential building blocks for mappings and permuta…
On the intersection of pairs of trees
Miklos Bona, Fabian Burghart, Stephan Wagner
We consider the number of common edges in two independent random spanning trees of a graph . For complete graphs , we give a new proof of the fact, originally obtained by M…
A bijection for the evolution of -trees
Fabian Burghart, Stephan Wagner
A -tree is a type of search tree where every node (except possibly for the root) contains between and keys for some positive integer , and all leaves have the same d…
Polynomial invariants for rooted trees related to their random destruction
Fabian Burghart
We consider three bivariate polynomial invariants , , and for rooted trees, as well as a trivariate polynomial invariant . These invariants are motivated by random des…
A Semiring Structure for Generalised Pólya Urns
Fabian Burghart
We define the notions of disjoint unions and products for generalised Pólya urns, proving that this turns the set of isomorphism classes of urns into a commutative semiring. The se…