arXiv subjects

Michael Fuchs

Publications and source records attributed to Michael Fuchs.

At least 37 records · Page 2Linked to original sources

arXiv2022

Limit Theorems for Patterns in Ranked Tree-Child Networks

We prove limit laws for the number of occurrences of a pattern on the fringe of a ranked tree-child network which is picked uniformly at random. Our results extend the limit law for cherries proved by Bienvenu et al. (2022). For patterns of height $1$ and $2$, we show that they either occur frequently (mean is asymptotically linear and limit law is normal) or sporadically (mean is asymptotically constant and limit law is Poisson) or not all (mean tends to $0$ and limit law is degenerate). We expect that these are the only possible limit laws for any fringe pattern.

math.PR↗

arXiv2022

Counting Phylogenetic Networks with Few Reticulation Vertices: A Second Approach

Tree-child networks, one of the prominent network classes in phylogenetics, have been introduced for the purpose of modeling reticulate evolution. Recently, the first author together with Gittenberger and Mansouri (2019) showed that the number ${\rm TC}_{\ell,k}$ of tree-child networks with $\ell$ leaves and $k$ reticulation vertices has the first-order asymptotics \[ {\rm TC}_{\ell,k}\sim c_k\left(\frac{2}{e}\right)^{\ell}\ell^{\ell+2k-1},\qquad (\ell\rightarrow\infty). \] Moreover, they also computed $c_k$ for $k=1,2,$ and $3$. In this short note, we give a second approach to the above result which is based on a recent (algorithmic) approach for the counting of tree-child networks due to Cardona and Zhang (2020). This second approach is also capable of giving a simple, closed-form expression for $c_k$, namely, $c_k=2^{k-1}\sqrt{2}/k!$ for all $k\geq 0$.

math.CO↗

arXiv2022

Enumeration of $d$-combining Tree-Child Networks

Tree-child networks are one of the most prominent network classes for modeling evolutionary processes which contain reticulation events. Several recent studies have addressed counting questions for {\it bicombining tree-child networks} which are tree-child networks with every reticulation node having exactly two parents. In this paper, we extend these studies to {\it $d$-combining tree-child networks} where every reticulation node has now $d\geq 2$ parents. Moreover, we also give results and conjectures on the distributional behavior of the number of reticulation nodes of a network which is drawn uniformly at random from the set of all tree-child networks with the same number of leaves.

math.CO↗

arXiv2022

Bijections for Ranked Tree-Child Networks

The class of ranked tree-child networks, tree-child networks arising from an evolution process with a fixed embedding into the plane, has recently been introduced by Bienvenu, Lambert, and Steel. These authors derived counting results for this class. In this note, we will give bijective proofs of three of their results. Two of our bijections answer questions raised in their paper.

math.CO↗

arXiv2021

A Short Note on the Exact Counting of Tree-Child Networks

Tree-child networks are an important network class which are used in phylogenetics to model reticulate evolution. In a recent paper, Pons and Batle (2021) conjectured a relation between tree-child networks and certain words. In this short note, we prove their conjecture for the (important) class of one-component tree-child networks.

q-bio.PE↗

arXiv2021

Asymptotic Enumeration and Distributional Properties of Galled Networks

We show a first-order asymptotics result for the number of galled networks with $n$ leaves. This is the first class of phylogenetic networks of {\it large} size for which an asymptotic counting result of such strength can be obtained. In addition, we also find the limiting distribution of the number of reticulation nodes of a galled networks with $n$ leaves chosen uniformly at random. These results are obtained by performing an asymptotic analysis of a recent approach of Gunawan, Rathin, and Zhang (2020) which was devised for the purpose of (exactly) counting galled networks. Moreover, an old result of Bender and Richmond (1984) plays a crucial role in our proofs, too.

math.CO↗

arXiv2021

Asymptotic Normality for the Size of Graph Tries built from M-ary Tree Labelings

Graph tries are a new and interesting data structure proposed by Jacquet in 2014. They generalize the classical trie data structure which has found many applications in computer science and is one of the most popular data structure on words. For his generalization, Jacquet considered the size (or space requirement) and derived an asymptotic expansion for the mean and the variance when graph tries are built from $n$ independently chosen random labelings of a rooted $M$-ary tree. Moreover, he conjectured a central limit theorem for the (suitably normalized) size as the number of labelings tends to infinity. In this paper, we verify this conjecture with the method of moments.

math.PR↗

arXiv2021

Counting Phylogenetic Networks with Few Reticulation Vertices: Exact Enumeration and Corrections

In previous work, we gave asymptotic counting results for the number of tree-child and normal networks with $k$ reticulation vertices and explicit exponential generating functions of the counting sequences for $k=1,2,3$. The purpose of this note is two-fold. First, we make some corrections to our previous approach which overcounted the above numbers and thus gives erroneous exponential generating functions (however, the overcounting does not effect our asymptotic counting results). Secondly, we use our (corrected) exponential generating functions to derive explicit formulas for the number of tree-child and normal networks with $k=1,2,3$ reticulation vertices. This re-derives recent results of Carona and Zhang, answers their question for normal networks with $k=2$, and adds new formulas in the case $k=3$.

math.CO↗

arXiv2020

Node Profiles of Symmetric Digital Search Trees: Concentration Properties

We give a detailed asymptotic analysis of the profiles of random symmetric digital search trees, which are in close connection with the performance of the search complexity of random queries in such trees. While the expected profiles have been analyzed for several decades, the analysis of the variance turns out to be very difficult and challenging, and requires the combination of several different analytic techniques, including Mellin and Laplace transforms, analytic de-Poissonization, and Laplace convolutions. Our results imply concentration of the profiles in the range where the mean tends to infinity. Moreover, we also obtain a two-point concentration for the distributions of the height and the saturation level.

math.PR↗

arXiv2020

On the Asymptotic Growth of the Number of Tree-Child Networks

In a recent paper, McDiarmid, Semple, and Welsh (2015) showed that the number of tree-child networks with $n$ leaves has the factor $n^{2n}$ in its main asymptotic growth term. In this paper, we improve this by completely identifying the main asymptotic growth term up to a constant. More precisely, we show that the number of tree-child networks with $n$ leaves grows like \[ Θ\left(n^{-2/3}e^{a_1(3n)^{1/3}}\left(\frac{12}{e^2}\right)^{n}n^{2n}\right), \] where $a_1=-2.338107410\cdots$ is the largest root of the Airy function of first kind. For the proof, we bijectively map the underlying graph-theoretical problem onto a problem on words. For the latter, we can find a recurrence to which a recent powerful asymptotic method of Elvey Price, Fang, and Wallner (2019) can be applied.

math.CO↗

arXiv2020

The distributions under two species-tree models of the number of root ancestral configurations for matching gene trees and species trees

For a pair consisting of a gene tree and a species tree, the ancestral configurations at an internal node of the species tree are the distinct sets of gene lineages that can be present at that node. Ancestral configurations appear in computations of gene tree probabilities under evolutionary models conditional on fixed species trees, and the enumeration of root ancestral configurations -- ancestral configurations at the root of the species tree -- assists in describing the complexity of these computations. In the case that the gene tree matches the species tree in topology, we study the distribution of the number of root ancestral configurations of a random labeled tree topology under each of two models.

math.CO↗

arXiv2020

A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees

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 show normal limit laws for the domination number and variations of it for these two cases of random tree models. Our results are an application of a recent general theorem of Holmgren and Janson on fringe trees in these two random tree models.

math.PR↗

arXiv2020

Superconformal Blocks for Mixed 1/2-BPS Correlators with $SU(2)$ R-symmetry

For SCFTs with an $SU(2)$ R-symmetry, we determine the superconformal blocks that contribute to the four-point correlation function of a priori distinct half-BPS superconformal primaries as an expansion in terms of the relevant bosonic conformal blocks. This is achieved by using the superconformal Casimir equation and the superconformal Ward identity to fix the coefficients of the bosonic blocks uniquely in a dimension-independent way. In addition we find that many of the resulting coefficients are related through a web of linear transformations of the conformal data.

hep-th↗

arXiv2018

Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks

In recent decades, phylogenetic networks have become a standard tool in modeling evolutionary processes. Nevertheless, basic combinatorial questions about them are still largely open. For instance, even the asymptotic counting problem for the class of phylogenetic networks and subclasses is unsolved. In this paper, we propose a method based on generating functions to count networks with few reticulation vertices for two subclasses which are important in applications: tree-child networks and normal networks. In particular, our method can be used to completely solve the asymptotic counting problem for these network classes when the number of reticulation vertices remains fixed and the network size tends to infinity.

math.CO↗

arXiv2017

On the Structure of Quantum L$_\infty$ algebras

It is believed that any classical gauge symmetry gives rise to an L$_\infty$ algebra. Based on the recently realized relation between classical ${\cal W}$ algebras and L$_\infty$ algebras, we analyze how this generalizes to the quantum case. Guided by the existence of quantum ${\cal W}$ algebras, we provide a physically well motivated definition of quantum L$_\infty$ algebras describing the consistency of global symmetries in quantum field theories. In this case we are restricted to only two non-trivial graded vector spaces $X_0$ and $X_{-1}$ containing the symmetry variations and the symmetry generators. This quantum L$_\infty$ algebra structure is explicitly exemplified for the quantum ${\cal W}_3$ algebra. The natural quantum product between fields is the normal ordered one so that, due to contractions between quantum fields, the higher L$_\infty$ relations receive off-diagonal quantum corrections. Curiously, these are not present in the loop L$_\infty$ algebra of closed string field theory.

hep-th↗

arXiv2017

${\cal W}$ algebras are L$_\infty$ algebras

It is shown that the closure of the infinitesimal symmetry transformations underlying classical ${\cal W}$ algebras give rise to L$_\infty$ algebras with in general field dependent gauge parameters. Therefore, the class of well understood ${\cal W}$ algebras provides highly non-trivial examples of such strong homotopy Lie-algebras. We develop the general formalism for this correspondence and apply it explicitly to the classical ${\cal W}_3$ algebra.

hep-th↗

arXiv2017

Asymmetric CFTs and GSUGRA

Recent progress on the relation between asymmetric conformal field theories and vacua of gauged supergravities is reviewed. This includes an attempt to classify asymmetric Gepner models in 8D, 6D and 4D with at least eight supercharges, and how they can be categorized by just a few mechanisms including the super Higgs-effect. The latter is a prerequisite for the identification with non-geometric flux compactifications. We also highlight our findings for the identification of 4D asymmetric Gepner models with ${\cal N}=1$ supersymmetry with Minkowski vacua of ${\cal N}=2$ GSUGRA.

hep-th↗

arXiv2017

Partial SUSY Breaking for Asymmetric Gepner Models and Non-geometric Flux Vacua

Using the method of simple current extensions, asymmetric Gepner models of Type IIB with N=1 space-time supersymmetry are constructed. The combinatorics of the massless vector fields suggests that these classical Minkowski string vacua provide fully backreacted solutions corresponding to N=1 minima of N=2 gauged supergravity. The latter contain abelian gaugings along the axionic isometries in the hypermultiplet moduli space, and can be considered as Type IIB flux compactifications on Calabi-Yau manifolds equipped with (non-)geometric fluxes. For a particular class of asymmetric Gepner models, we are able to explicitly specify the underlying CICYs and to check necessary conditions for a GSUGRA interpretation. If this conjecture is correct, there exists a large class of exactly solvable non-geometric flux compactifications on CY threefolds.

hep-th↗