40 citations · 172 across the 51 of their papers we have counts for
14 papers · 1 filter
On the inducibility of small trees
Audace A. V. Dossou-Olory, Stephan Wagner
The quantity that captures the asymptotic value of the maximum number of appearances of a given topological tree (a rooted tree with no vertices of outdegree ) with leav…
Further results on the inducibility of -ary trees
Audace A. V. Dossou-Olory, Stephan Wagner
A subset of leaves of a rooted tree induces a new tree in a natural way. The density of a tree inside a larger tree is the proportion of such leaf-induced subtrees in t…
A central limit theorem for almost local additive tree functionals
Dimbinaina Ralaivaosaona, Matas Šileikis, Stephan Wagner
An additive functional of a rooted tree is a functional that can be calculated recursively as the sum of the values of the functional over the branches, plus a certain toll functio…
The ancestral matrix of a rooted tree
Eric O. D. Andriantiana, Kenneth Dadedzi, Stephan Wagner
Given a rooted tree with leaves , we define the ancestral matrix of to be the matrix for which the entry in the -th row, -th c…
On the Number of Increasing Trees with Label Repetitions
Olivier Bodini, Antoine Genitrini, Bernhard Gittenberger +1
We study the asymptotic number of certain monotonically labeled increasing trees arising from a generalized evolution process. The main difference between the presented model and t…
On the minimal Hamming weight of a multi-base representation
Daniel Krenn, Vorapong Suppakitpaisarn, Stephan Wagner
Given a finite set of bases , , \dots, (integers greater than ), a multi-base representation of an integer~ is a sum with summands $db_1^{α_1}b_2^{α_2} \cdots…
Reducing Simply Generated Trees by Iterative Leaf Cutting
Benjamin Hackl, Clemens Heuberger, Stephan Wagner
We consider a procedure to reduce simply generated trees by iteratively removing all leaves. In the context of this reduction, we study the number of vertices that are deleted afte…
The average size of independent sets of graphs
Eric O. D. Andriantiana, Valisoa Razanajatovo Misanantenaina, Stephan Wagner
In this paper, we study the average size of independent (vertex) sets of a graph. This invariant can be regarded as the logarithmic derivative of the independence polynomial evalua…
The number of distinct adjacent pairs in geometrically distributed words
Margaret Archibald, Aubrey Blecher, Charlotte Brennan +3
A sequence of geometric random variables of length is a sequence of independent and identically distributed geometric random variables () where $\math…
Average Case Analysis of Leaf-Centric Binary Tree Sources
Louisa Seelbach Benkner, Markus Lohrey, Stephan Wagner
We study the average number of distinct fringe subtrees in random trees generated by leaf-centric binary tree sources as introduced by Zhang, Yang and Kieffer. A leaf-centric binar…
A polynomial associated with rooted trees and specific posets
Valisoa Razanajatovo Misanantenaina, Stephan Wagner
We investigate a trivariate polynomial associated with rooted trees. It generalises a bivariate polynomial for rooted trees that was recently introduced by Liu. We show that this p…
Inducibility of Topological Trees
Audace Amen Vioutou Dossou-Olory, Stephan Wagner
Trees without vertices of degree are sometimes named topological trees. In this work, we bring forward the study of the inducibility of (rooted) topological trees with a given…
Inducibility of d-ary trees
Éva Czabarka, Audace A. V. Dossou-Olory, László A. Székely +1
Imitating a recently introduced invariant of trees, we initiate the study of the inducibility of -ary trees (rooted trees whose vertex outdegrees are bounded from above by $d\ge…
On the centroid of increasing trees
Kevin Durant, Stephan Wagner
A centroid node in a tree is a node for which the sum of the distances to all other nodes attains its minimum, or equivalently a node with the property that none of its branches co…