Related papers: Asymptotic Behavior of Spanning Forests and Connec…
We study the inflated phase of two dimensional lattice polygons, both convex and column-convex, with fixed area A and variable perimeter, when a weight \mu^t \exp[- Jb] is associated to a polygon with perimeter t and b bends. The mean…
On a finite graph, there is a natural family of Boltzmann probability measures on cycle-rooted spanning forests, parametrized by weights on cycles. For a certain subclass of those weights, we construct Gibbs measures in infinite volume, as…
We study the asymptotic behaviour of simply connected, Riemannian manifolds $X$ of strictly negative curvature admitting a non-uniform lattice $\Gamma$. If the quotient manifold $\bar X= \Gamma \backslash X$ is asymptotically $1/4$-pinched,…
As a flexible nonparametric learning tool, the random forests algorithm has been widely applied to various real applications with appealing empirical performance, even in the presence of high-dimensional feature space. Unveiling the…
Using a relation between the virial expansion coefficients of the pressure and the entropy expansion coefficients in the case of the monomer-dimer model on infinite regular lattices, we have shown that, on hypercubic lattices of any…
We prove that every connected graph with $s$ vertices of degree not 2 has a spanning tree with at least ${1\over 4}(s-2)+2$ leaves. Let $G$ be a be a connected graph of girth $g$ with $v>1$ vertices. Let maximal chain of successively…
We present a detailed asymptotic analysis of correlation functions for the two component spanning tree on the two-dimensional lattice when one component contains three paths connecting vicinities of two fixed lattice sites at large distance…
This paper considers the asymptotic distribution of the longest edge of the minimal spanning tree and nearest neighbor graph on X_1,...,X_{N_n} where X_1,X_2,... are i.i.d. in \Re^2 with distribution F and N_n is independent of the X_i and…
We establish formulae for the asymptotic growth (with respect to the scaling dimension) of the number of operators in effective field theory, or equivalently the number of $S$-matrix elements, in arbitrary spacetime dimensions and with…
We are concerned with the long-time behavior of the growth-fragmentation equation. We prove fine estimates on the principal eigenfunctions of the growth-fragmentation operator, giving their first-order behavior close to 0 and $+\infty$.…
We consider additive functionals $X_n(\phi)$ with small toll functions on split trees and a generalization of split trees, which we call fractional split trees, where the split vector does not need to sum up to 1. These additive functionals…
In 2001, Koml\'os, S\'ark\"ozy, and Szemer\'edi proved that every sufficiently large $n$-vertex graph with minimum degree at least $\left(1/2+\gamma\right)n$ contains all spanning trees with maximum degree at most $cn/\log n$. We extend…
We derive two-sided bounds for a class of Stirling-type asymptotic formulas for piecewise logarithmic interpolations of the pi function, and hence also for the factorials and the gamma functions. The bounds are derived by first proving some…
This paper is a contribution to the problem of counting geometric graphs on point sets. More concretely, we look at the maximum numbers of non-crossing spanning trees and forests. We show that the so-called double chain point configuration…
We study whether the universal runaway behaviour of stringy scalar potentials towards infinite field distance limits can produce an accelerated expanding cosmology \`{a} la quintessence. We identify a loophole to some proposed bounds that…
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 connective constant $\mu(G)$ of an infinite transitive graph $G$ is the exponential growth rate of the number of self-avoiding walks from a given origin. The relationship between connective constants and amenability is explored in the…
Recent progress in the study of the contact process [2] has verified that the extinction-survival threshold $\lambda_1$ on a Galton-Watson tree is strictly positive if and only if the offspring distribution $\xi$ has an exponential tail. In…
Subshifts are sets of colorings of $\mathbb{Z}^d$ defined by families of forbidden patterns. In a given subshift, the extender set of a finite pattern is the set of all its admissible completions. Since soficity of $\mathbb{Z}$ subshifts is…
In this paper, we present the results of a computer investigation of asymptotics for maximum dimensions of linear and projective representations of the symmetric group. This problem reduces to the investigation of standard and strict Young…