Related papers: Path count asymptotics and Stirling numbers
We provide a new strategy to compute the exponential growth constant of enumeration sequences counting walks in lattice path models restricted to the quarter plane. The bounds arise by comparison with half-planes models. In many cases the…
We derive two new identities involving the Bernoulli numbers, the Euler numbers, and the Stirling numbers of the first kind using analytic continuation of a well known identity for the Stirling numbers of the first kind.
We enumerate the connected graphs that contain a number of edges growing linearly with respect to the number of vertices. So far, only the first term of the asymptotics and a bound on the error were known. Using analytic combinatorics, ie…
We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P.
In this paper, we first present combinatorial proofs of a kind of expansions of the Eulerian polynomials of types A and B, and then we introduce Stirling permutations of the second kind. In particular, we count Stirling permutations of the…
A certain class of directed metric graphs is considered. Asymptotics for a number of possible endpoints of a random walk at large times is found.
In this note we give asymptotic estimates for the volume growth associated to suitable infinite graphs. Our main application is to give an asymptotic estimate for volume growth associated to translation surfaces.
Asymptotics are given for the number of rational points in the domain of a morphism of weighted projective stacks whose images have bounded height and satisfy a (possibly infinite) set of local conditions. As a consequence we obtain results…
The state space of our model is the Euclidean space in dimension d = 2. Simultaneously, from all points of a homogeneous Poisson point process, we let grow independent and identically distributed random continuum paths. Each path stops…
We introduce and study the Separation Problem for infinite graphs, which involves determining whether a connected graph splits into at least two infinite connected components after the removal of a given finite set of edges. We prove that…
A class of countable infinite graphs with unbounded vertex degree is considered. In these graphs, the vertices of large degree `repel' each other, which means that the path distance between two such vertices cannot be smaller than a certain…
By considering Eulerian numbers and ordered Stirling numbers of the second and third kinds over a multiset, we generalize identities of Eulerian numbers and Stirling numbers of the second and third kinds and provide $q$-analogs of these…
For the Chebyshev-Stirling numbers, a special case of the Jacobi-Stirling numbers, asymptotic formulae are derived in terms of a local central limit theorem. The underlying probabilistic approach also applies to the classical Stirling…
Given a set D of nonnegative integers, we derive the asymptotic number of graphs with a givenvnumber of vertices, edges, and such that the degree of every vertex is in D. This generalizes existing results, such as the enumeration of graphs…
Initial steps in the study of inner expansion properties of infinite Cayley graphs and other infinite graphs, such as hyperbolic ones, are taken, in a flavor similar to the well-known Lipton-Tarjan square root separation result for planar…
The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…
Associated to each complex-valued random variable satisfying appropriate integrability conditions, we introduce a different generalization of the Stirling numbers of the second kind. Various equivalent definitions are provided. Attention,…
The aim of this paper is to associate a measure for certain sets of paths in the Euclidean plane $\mathbb{R}^2$ with fixed starting and ending points. Then, working on parameterized surfaces with a specific Riemannian metric, we define and…
We study the asymptotic behavior of the number of paths of length $N$ on several classes of infinite graphs with a single special vertex. This vertex can work as an entropic trap for the path, i.e. under certain conditions the dominant part…
We point out that the total number of trails and the total number of paths of given length, between two vertices of a simple undirected graph, are obtained as expectation values of specifically engineered quantum mechanical observables.…