Related papers: Asymptotic Behavior of Spanning Forests and Connec…
This paper concerns the asymptotic behaviour of solutions of a linear convolution Volterra summation equation with an unbounded forcing term. In particular, we suppose the kernel is summable and ascribe growth bounds to the exogenous…
We compute the limiting distributions of the lengths of the longest monotone subsequences of random (signed) involutions with or without conditions on the number of fixed points (and negated points) as the sizes of the involutions tend to…
In this paper, we establish the asymptotic expansion at infinity of gradient graph in dimension 2 with vanishing mean curvature at infinity. This corresponds to our previous results in higher dimensions and generalizes the results for…
Phylogenetic trees and networks are leaf-labelled graphs used to model evolution. Display graphs are created by identifying common leaf labels in two or more phylogenetic trees or networks. The treewidth of such graphs is bounded as a…
String scattering amplitudes in the high energy asymptotic region have been studied by saddle point approximation. Recently, it was pointed out that infinitely many complex saddles contribute to string amplitudes even at tree-level after…
We consider the hyperuniform model of d-dimensional integer lattice perturbed by independent random variables and we investigate the large scale asymptotic fluctuations of smoothed versions of the usual counting statistics, specifically of…
Let $F(G)$ be the number of forests of a graph $G$. Similarly let $C(G)$ be the number of connected spanning subgraphs of a connected graph $G$. We bound $F(G)$ and $C(G)$ for regular graphs and for graphs with fixed average degree. Among…
Compression and sparsification algorithms are frequently applied in a preprocessing step before analyzing or optimizing large networks/graphs. In this paper we propose and study a new framework contracting edges of a graph (merging vertices…
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…
Consider a random recusive tree with n vertices. We show that the number of vertices with even depth is asymptotically normal as n tends to infinty. The same is true for the number of vertices of depth divisible by m for m=3, 4 or 5; in all…
In 1966, Cummins introduced the "tree graph": the tree graph $\mathbf{T}(G)$ of a graph $G$ (possibly infinite) has all its spanning trees as vertices, and distinct such trees correspond to adjacent vertices if they differ in just one edge,…
Many hard algorithmic problems dealing with graphs, circuits, formulas and constraints admit polynomial-time upper bounds if the underlying graph has small treewidth. The same problems often encourage reducing the maximal degree of vertices…
Let $R_T$ be the Ricci matrix of a finite tree $T$ introduced in \cite{BaiChengHua2026}, the largest eigenvalue $\lambda_{\max}(R_T)$ determines the sign of a discrete Einstein metric curvature on the tree. This paper investigates the…
Let X be a Hadamard manifold and $\Gamma$ a discrete group of isometries of X which contains an axial isometry without invariant flat half plane. We study the behavior of conformal densities on the geometric limit set of $\Gamma$ in order…
We study phase-ordering dynamics of a ferromagnetic system with a scalar order-parameter on fractal graphs. We propose a scaling approach, inspired by renormalization group ideas, where a crossover between distinct dynamical behaviors is…
We construct and classify all polynomial growth solutions to certain drift-harmonic equations on complete manifolds with paraboloidal asymptotics. These encompass the natural drift-harmonic equations on certain steady gradient Ricci…
Graph rules for the linked cluster expansion of the Legendre effective action $\Gamma[\phi]$ are derived and proven in $D\geq 2$ Euclidean dimensions. A key aspect is the weight assigned to articulation vertices which is itself shown to be…
We compute the first three terms of the 1/d expansions for the growth constants and one-point functions of nearest-neighbour lattice trees and lattice (bond) animals on the integer lattice Zd, with rigorous error estimates. The proof uses…
In this paper we construct spanning trees in hyperbolic graphs that represent their hyperbolic compactification in a good way: so that the tree has a bounded number of distinct rays to each boundary point. The bound depends only on the…
Fronts, propagating into an unstable state $\phi=0$, whose asymptotic speed $v_{\text{as}}$ is equal to the linear spreading speed $v^*$ of infinitesimal perturbations about that state (so-called pulled fronts) are very sensitive to changes…