Related papers: Full asymptotic expansion for Polya structures

Uniform asymptotic expansions are derived for reverse generalised Bessel polynomials of large degree $n$, real parameter $a$, and complex argument $z$, which are simpler than previously known results. The defining differential equation is…

We introduce a concept of tree-graded metric space and we use it to show quasi-isometry invariance of certain classes of relatively hyperbolic groups, to obtain a characterization of relatively hyperbolic groups in terms of their asymptotic…

We show that for almost every polynomial P(x,y) with complex coefficients, the difference of the logarithmic Mahler measures of P(x,y) and P(x,x^n) can be expanded in a type of formal series similar to an asymptotic power series expansion…

In this article, we construct explicit examples of pairs of non-isomorphic trees with the same restricted $U$-polynomial for every $k$; by this we mean that the polynomials agree on terms with degree at most $k+1$. The main tool for this…

We study the size of the automorphism group of two different types of random trees: Galton--Watson trees and rooted P\'olya trees. In both cases, we prove that it asymptotically follows a log-normal distribution and provide asymptotic…

A relaxed $k$-ary tree is an ordered directed acyclic graph with a unique source and sink in which every node has out-degree $k$. These objects arise in the compression of trees in which some repeated subtrees are factored and repeated…

We study the full asymptotic expansion of the monodromy data ({\it i.e.}, Stokes multipliers) for the first Painlev\'{e} transcendent (PI) with large initial data or large pole parameters. Our primary approach involves refining the complex…

Many processes and models --in biological, physical, social, and other contexts-- produce trees whose depth scales logarithmically with the number of leaves. Phylogenetic trees, describing the evolutionary relationships between biological…

We study the asymptotic distribution of integers sharing the same rooted-tree structure that encodes their complete prime factorization tower. For each tree we derive an explicit density formula depending only on a pair $(m,k)$, the density…

Arthur Cayley famously proved that there are n to the power n-2 labeled trees on n vertices. Here we go much further and show how to enumerate, fully automatically, labeled trees such that every vertex has a number of neighbors that belongs…

We study the total mass of the solution to the parabolic Anderson model on a regular tree with an i.i.d. random potential whose marginal distribution is double-exponential. In earlier work we identified two terms in the asymptotic expansion…

For the solutions $\Phi(z)$ of functional equations $\Phi(z)=P(z)+\Phi(Q(z))$, we derive a complete asymptotic of power series coefficients. As an application, we improve significantly an asymptotic of the number of $2,3$-trees with $n$…

We study a natural Lie algebra structure on the free vector space generated by all rooted planar trees as the associated Lie algebra of the nonsymmetric operad (non-$\Sigma$ operad, preoperad) of rooted planar trees. We determine whether…

Here we examine the number of ways to partition an integer $n$ into $k$th powers when $n$ is large. Simplified proofs of some asymptotic results of Wright are given using the saddle-point method, including exact formulas for the expansion…

One of the features inherent in nested Archimedean copulas, also called hierarchical Archimedean copulas, is their rooted tree structure. A nonparametric, rank-based method to estimate this structure is presented. The idea is to represent…

We show that several new classes of groups are measure strongly treeable. In particular, finitely generated groups admitting planar Cayley graphs, elementarily free groups, and the group of isometries of the hyperbolic plane and all its…

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…

We prove detailed asymptotics for the number of spanning trees, called complexity, for a general class of discrete tori as the parameters tend to infinity. The proof uses in particular certain ideas and techniques from an earlier paper. Our…

The uniform infinite planar quadrangulation is an infinite random graph embedded in the plane, which is the local limit of uniformly distributed finite quadrangulations with a fixed number of faces. We study asymptotic properties of this…

We prove asymptotic normality for the number of fringe subtrees isomorphic to any given tree in uniformly random trees with given vertex degrees. As applications, we also prove corresponding results for random labelled trees with given…