Searcharxiv⌕ Search

arXiv subjects

Stephan Wagner

Publications and source records attributed to Stephan Wagner.

At least 19 recordsLinked to original sources

The External Path Length and Terminal Wiener Index in Random Trees

We consider two distance-based concepts in rooted trees and compare them to their leaf-restricted counterparts. The path length is the sum of all distances from the root to the vertices of the tree, while the external path length is the sum of all distances from the root to the leaves of the tree. Upon dividing by the number of vertices and leaves respectively, we obtain the average distance to the root. The Wiener index is the sum of all distances between pairs of vertices, and the terminal Wiener index is the sum of all distances between pairs of leaves. Dividing by the number of pairs of vertices and pairs of leaves respectively, we obtain the average distance between vertices and average distance between leaves. For two important classes of random trees, we show that the average distance of the root to a random leaf is almost the same as the average distance to a random vertex and that the average distance between vertices is almost the same as the average distance between leaves. For Bienaymé--Galton--Watson trees, each of these differences is bounded in probability. For three varieties of increasing trees (recursive trees, $d$-ary increasing trees, generalised plane-oriented recursive trees), on the other hand, the differences converge to constants in probability. This allows the transfer of convergence results for the path length to the external path length, and results for the Wiener index to be transferred to the terminal Wiener index.

math.CO↗

On the extrema of the mean subtree order of graphs

It has been conjectured that the minimum and maximum of the mean subtree order among connected graphs of order $n$ are attained by the path $P_n$ and clique $K_n$, respectively. Extending ideas due to Haslegrave and Vince, we confirm that the minimum is indeed attained by $P_n$. We also show that the maximum is attained by $K_n$ by proving that the ratio between spanning and almost spanning trees is maximised by the clique and applying a double-counting argument.

math.CO↗

Limits of descent-biased trees

We investigate scaling and local limits of random trees biased according to their number of descents. A descent in a rooted labeled tree $t$ is a parent-child pair such that the label of the parent is greater than the label of the child, and the total number of descents is denoted by $\mathrm{des}(t)$. For $n \geq 1$ and $q_n \geq 0$, we consider the probability measure on trees of size $n$ where each tree $t$ is chosen with a probability proportional to $q_n^{\mathrm{des}(t)}$. We study the resulting random tree $\mathcal{T}_n^{(q_n)}$ properly rescaled as $n \to \infty$, and focus on two regimes for the bias parameter $q_n$. When $q_n = q \in (0,1]$ is fixed, we prove that $\mathcal{T}_n^{(q)}$ converges in distribution to the Brownian Continuum Random Tree. When $q_n = a/n$ for some fixed $a > 0$, we prove that $\mathcal{T}_n^{(q_n)}$ converges in distribution to a random non-trivial dendron constructed from a Poisson-Dirichlet sequence. We complement these results with a description of the Benjamini-Schramm local limit of $\mathcal{T}_n^{(q_n)}$ in all regimes of parameters. Our proofs rely on analytic combinatorics to find the asymptotics of certain statistics of the tree, and on a probabilistic analysis of the structure of descent-biased random trees.

math.PR↗

On the intersection of pairs of trees

We consider the number of common edges in two independent random spanning trees of a graph $G$. For complete graphs $K_n$, we give a new proof of the fact, originally obtained by Moon, that the distribution converges to a Poisson distribution with expected value $2$. This is applied to show a Poisson limit law for the number of common edges in two independent random spanning trees of an Erdős--Rényi random graph $G(n,p)$ for constant~$p$, as well as a central limit theorem in the case where $p\to 0$ and $p\geq n^{-2/3+\varepsilon}$. We also use the same method to prove an analogous result for complete multipartite graphs.

math.CO↗

Counting Colored Trees

We consider the enumeration of plane trees (rooted ordered trees) whose vertices are colored according to a specific coloring rule that prescribes which possible pairs of colors can occur as the colors of a parent vertex and its child. This general construction covers many different examples that have been studied in the literature. Some general necessary and sufficient conditions for two different coloring rules to result in the same counting sequence are established. We also provide exhaustive lists of counting sequences arising from coloring rules with two or three colors, and we find formulas and closed form expressions for many of these sequences. The famous Fibonacci, Catalan, Narayana, and Schröder sequences appear in several cases. Some of these coloring rules are extended to families of coloring rules with arbitrarily many colors.

math.CO↗

On Cycles in Multiset Permutations, Parking Functions, and Related Structures

In this paper we study cycles in multiset permutations and parking functions. As combinatorial objects, multiset permutations are essential building blocks for mappings and permutations, while parking functions lie between mappings and permutations. We take both algebraic and analytic views in our investigation and present exact as well as asymptotic results. We point to a surprising correspondence between two statistics on multiset permutations, terminal closers and cyclic points, shedding light on the combinatorial structure.

math.CO↗

Benjamini-Schramm convergence and subtrees of trees

In this paper, we study the asymptotic behaviour of the number of subtrees and the subtree density for a sequence of trees that converges in the Benjamini-Schramm sense. Benjamini-Schramm convergence, also called local weak convergence, describes the local behaviour of a sequence of graphs. Here we show that for a Benjamini-Schramm-convergent sequence of trees, the subtree entropy, i.e., the logarithm of the number of subtrees divided by the order, converges to a constant depending only on the limit. The same holds true for the subtree density, i.e., the probability of a uniformly random vertex being contained in a uniformly random subtree, provided that long paths are ruled out in the limit. Related to this, we show that the subtree density and the average subtree entropy are dense in different parts of the unit interval $[0,1]$ for both general trees and series-reduced trees.

math.CO↗

The Distribution Of Subtrees In Dense Graphs And The Roots Of The Subtree Polynomial

For a graph $G$ with $n$ vertices and a positive integer $k \leq n$, let $s_k(G)$ be the number of subtrees (subgraphs that are trees, not necessarily induced) of $G$ with $k$ vertices. The subtree polynomial of $G$ is $S(G;x) = \sum_{k=1}^n s_k(G) x^k$. In this paper, we consider dense connected graphs with a minimum degree that is linear in the number of vertices. We prove that the number of missing vertices in a random subtree is asymptotically Poisson-distributed and deduce that all the roots of the subtree polynomial have to be close to $0$.

math.CO↗

Machine Learning Power Week 2023: Clustering in Hadronic Calorimeters

In both high-energy physics and industry applications, a crowd-sourced approach to difficult problems is becoming increasingly common. These innovative approaches are ideal for the development of future facilities where the simulations can be publicly distributed, such as the Electron-Ion Collider (EIC). In this paper, we discuss a so-called ``Power Week" where graduate students were able to learn about machine learning while also contributing to an unsolved problem at a future facility. Here, the problem of interest was the clustering of the forward hadronic calorimeter in the foreseen electron-proton/ion collider experiment (ePIC) detector at the EIC. The different possible approaches, developed over the course of a single week, and their performance are detailed and summarised. Feedback on the format of the week and recommendations for future similar programs are provided in the hopes to inspire future learning opportunities for students that also serve as a crowd-sourced approaches to unsolved problems.

nucl-ex↗

Distribution of new statistics of parking functions and their generalizations

In this paper we present new results on the enumeration of parking functions and labeled forests. We introduce new statistics on parking functions, which are then extended to labeled forests via bijective correspondences. We determine the joint distribution of two statistics on parking functions and their counterparts on labeled forests. Our results on labeled forests also serve to explain the mysterious equidistribution between two seemingly unrelated statistics in parking functions recently identified by Stanley and Yin and give an explicit bijection between the two statistics. Extensions of our techniques are discussed, including joint distribution on further refinement of these new statistics.

math.CO↗

Average Case Analysis of Leaf-Centric Binary Tree Sources

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 binary tree source induces for every $n \geq 2$ a probability distribution on the set of binary trees with $n$ leaves. We generalize a result by Flajolet, Gourdon, Martinez and Devroye, according to which the average number of distinct fringe subtrees in a random binary search tree of size $n$ is in $Θ(n/\log n)$, as well as a result by Flajolet, Sipala and Steayert, according to which the number of distinct fringe subtrees in a uniformly random binary tree of size $n$ is in $Θ(n/\sqrt{\log n})$.

cs.DM↗

A computer algebra package for bivariate asymptotics with explicit error terms

Making use of a newly developed package in the computer mathematics system SageMath, we show how to perform a full asymptotic analysis of certain types of sums that occur frequently in combinatorics, including explicit error bounds. We present two applications of the general approach to illustrate its use: the first concerns a classical problem due to Ramanujan, while the second one concerns a question of Bóna and DeJonge on 132-avoiding permutations with a unique longest increasing subsequence that can be translated into an inequality for a certain binomial sum.

math.CO↗

Trees maximizing the number of almost-perfect matchings

We characterize the extremal trees that maximize the number of almost-perfect matchings, which are matchings covering all but one or two vertices, and those that maximize the number of strong almost-perfect matchings, which are matchings missing only one or two leaves. We also determine the trees that minimize the number of maximal matchings. We apply these results to extremal problems on the weighted Hosoya index for several choices of vertex-degree-based weight function.

math.CO↗

Some bounds on the spectral radius of connected threshold graphs

The spectral radius of a graph is the spectral radius of its adjacency matrix. A threshold graph is a simple graph whose vertices can be ordered as $v_1, v_2, \ldots, v_n$, so that for each $2 \le i \le n$, vertex $v_i$ is either adjacent or nonadjacent simultaneously to all of $v_1, v_2, \ldots, v_{i-1}$. Brualdi and Hoffman initially posed and then partially solved the extremal problem of finding the simple graphs with a given number of edges that have the maximum spectral radius. This problem was subsequently completely resolved by Rowlinson. Here, we deal with the similar problem of maximizing the spectral radius over the set of connected simple graphs with a given number of vertices and edges. As shown by Brualdi and Solheid, each such extremal graph is necessarily a threshold graph. We investigate the spectral radii of threshold graphs by relying on computations involving lazy walks. Furthermore, we obtain three lower bounds and one upper bound on the spectral radius of a given connected threshold graph.

math.CO↗

The distribution of the maximum protection number in simply generated trees

The protection number of a vertex $v$ in a tree is the length of the shortest path from $v$ to any leaf contained in the maximal subtree where $v$ is the root. In this paper, we determine the distribution of the maximum protection number of a vertex in simply generated trees, thereby refining a recent result of Devroye, Goh and Zhao. Two different cases can be observed: if the given family of trees allows vertices of outdegree $1$, then the maximum protection number is on average logarithmic in the tree size, with a discrete double-exponential limiting distribution. If no such vertices are allowed, the maximum protection number is doubly logarithmic in the tree size and concentrated on at most two values. These results are obtained by studying the singular behaviour of the generating functions of trees with bounded protection number. While a general distributional result by Prodinger and Wagner can be used in the first case, we prove a variant of that result in the second case.

math.CO↗

Monomial identities in the Weyl algebra

Motivated by a question and some enumerative conjectures of Richard Stanley, we explore the equivalence classes of words in the Weyl algebra, $\mathbf{k} \left< D,U \mid DU - UD = 1 \right>$. We show that each class is generated by the swapping of adjacent *balanced subwords*, i.e., those which have the same number of $D$'s as $U$'s, and give several other characterizations, as well as a linear-time algorithm for equivalence checking. Armed with this, we deduce several enumerative results about such equivalence classes and their sizes. We extend these results to the class of $c$-Dyck words, where every prefix has at least $c$ times as many $U$'s as $D$'s. We also connect these results to previous work on bond percolation and rook theory, and generalize them to some other algebras.

math.CO↗

Tree height and the asymptotic mean of the Colijn-Plazzotta rank of unlabeled binary rooted trees

The Colijn--Plazzotta ranking is a bijective encoding of the unlabeled binary rooted trees with positive integers. We show that the rank $f(t)$ of a tree $t$ is closely related to its height $h$, the length of the longest path from a leaf to the root. We consider the rank $f(τ_n)$ of a random $n$-leaf tree $τ_n$ under each of three models: (i) uniformly random unlabeled unordered binary rooted trees, or unlabeled topologies; (ii) uniformly random leaf-labeled binary trees, or labeled topologies under the uniform model; and (iii) random binary search trees, or labeled topologies under the Yule--Harding model. Relying on the close relationship between tree rank and tree height, we obtain results concerning the asymptotic properties of $\log \log f(τ_n)$. In particular, we find $\mathbb{E} \{\log_2 \log f(τ_n)\} \sim 2 \sqrt{πn}$ for uniformly random unlabeled ordered binary rooted trees and uniformly random leaf-labeled binary trees, and for a constant $α\approx 4.31107$, $\mathbb{E}\{\log_2 \log f(τ_n)\} \sim α\log n $ for leaf-labeled binary trees under the Yule--Harding model. We show that the mean of $f(τ_n)$ itself under the three models is largely determined by the rank $c_{n-1}$ of the highest-ranked tree -- the caterpillar -- obtaining an asymptotic relationship with $π_n c_{n-1}$, where $π_n$ is a model-specific function of $n$. The results resolve open problems, providing a new class of results on an encoding useful in mathematical phylogenetics.

math.CO↗

The minimum number of maximal independent sets in twin-free graphs

The problem of determining the maximum number of maximal independent sets in certain graph classes dates back to a paper of Miller and Muller and a question of Erdős and Moser from the 1960s. The minimum was always considered to be less interesting due to simple examples such as stars. In this paper we show that the problem becomes interesting when restricted to twin-free graphs, where no two vertices have the same open neighbourhood. We consider the question for arbitrary graphs, bipartite graphs and trees. The minimum number of maximal independent sets turns out to be logarithmic in the number of vertices for arbitrary graphs, linear for bipartite graphs and exponential for trees. In the latter case, the minimum and the extremal graphs have been determined earlier by Taletski\uı and Malyshev, but we present a shorter proof.

math.CO↗