Related papers: Full asymptotic expansion for Polya structures

We consider a model of random tree growth, where at each time unit a new vertex is added and attached to an already existing vertex chosen at random. The probability with which a vertex with degree $k$ is chosen is proportional to $w(k)$,…

In this paper, we develop a coarse analogue of treewidth. We prove that a graph $G$ admits a tree-decomposition in which each bag is contained in the union of a bounded number of balls of bounded radius, if and only if $G$ admits a…

In this paper, we introduce a notion of expansion for groupoids, which recovers the classical notion of expander graphs by a family of pair groupoids and expanding actions in measure by transformation groupoids. We also consider an…

Prudent walks are special self-avoiding walks that never take a step towards an already occupied site, and \emph{$k$-sided prudent walks} (with $k=1,2,3,4$) are, in essence, only allowed to grow along $k$ directions. Prudent polygons are…

Phylogenetic networks generalize phylogenetic trees, and have been introduced in order to describe evolution in the case of transfer of genetic material between coexisting species. There are many classes of phylogenetic networks, which can…

We obtain bivariate asymptotics for the number of (unicellular) combinatorial maps (a model of discrete surfaces) as both the size and the genus grow. This work is related to two research topics that have been very active recently:…

For a two-dimensional lattice $\Lambda$ with $n$ vertices, the number of spanning trees $N_{ST}(\Lambda)$ grows asymptotically as $\exp(n z_\Lambda)$ in the thermodynamic limit. We present exact integral expression and numerical value for…

Using the method of spectral decimation and a modified version of Kirchhoffs Matrix-Tree Theorem, a closed form solution to the number of spanning trees on approximating graphs to a fully symmetric self-similar structure on a finitely…

By utilizing the idea of Colombeau's generalized function, we introduce a notion of asymptotic map between arbitrary diffeological spaces. The category consisting of diffeological spaces and asymptotic maps is enriched over the category of…

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…

In this note we revisit the problem of explicitly computing tree-level scattering amplitudes in various theories in any dimension from worldsheet formulas. The latter are known to produce cubic-tree expansion of tree amplitudes with…

We consider the height of random k-trees and k-Apollonian networks. These random graphs are not really trees, but instead have a tree-like structure. The height will be the maximum distance of a vertex from the root. We show that w.h.p. the…

We develop a new method for studying the asymptotics of symmetric polynomials of representation-theoretic origin as the number of variables tends to infinity. Several applications of our method are presented: We prove a number of theorems…

We employ the exponentially improved asymptotic expansions of the confluent hypergeometric functions on the Stokes lines discussed by the author [Appl. Math. Sci. {\bf 7} (2013) 6601--6609] to give the analogous expansions of the modified…

Let $N(t)$ be the collection of particles alive at time $t$ in a branching Brownian motion in $\mathbb{R}^d$, and for $u\in N(t)$, let $\mathbf{X}_u(t)$ be the position of particle $u$ at time $t$. For $\theta\in \mathbb{R}^d$, we define…

In recent years post-Newtonian approximations for isolated slowly-moving systems in general relativity have been studied by means of matched asymptotic expansions. A paper by Poujade & Blanchet in 2002 made great progress by effectively…

In this thesis the properties of two kinds of non-uniform random recursive trees are studied. In the first model weights are assigned to each node, thus altering the attachment probabilities. We will call these trees weighted recursive…

Let $f \in \mathbb{Z}[y]$ be a polynomial such that $f(\mathbb{N}) \subseteq \mathbb{N}$, and let $p_{\mathcal{A}_{f}}(n)$ denote number of partitions of $n$ whose parts lie in the set $\mathcal{A}_f:=\{f(n):n \in \mathbb{N}\}$. Under…

To find boundary contributions is a rather difficult problem when applying the BCFW recursion relation. In this paper, we propose an approach to bypass this problem by calculating general tree amplitudes that contain no polynomial using…

In [8], asymptotic expansion of the martingale with mixed normal limit was provided. The expansion formula is expressed by the adjoint of a random symbol with coefficients described by the Malliavin calculus, differently from the standard…