Related papers: Asymptotics for graphically divergent series: dens…

Asymptotic solutions are derived for inhomogeneous differential equations having a large real or complex parameter and a simple turning point. They involve Scorer functions and three slowly varying analytic coefficient functions. The…

The theory of graphons has proven to be a powerful tool in many areas of graph theory. In this paper, we introduce several foundational aspects of the theory of digraphons -- asymmetric two-variable functions that arise as limits of…

We provide a rigorous derivation of an asymptotic formula for perturbations in the resonance values caused by the presence of finite number of anisotropic imperfections of small shapes with constitutive parameters different from the…

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…

The asymptotic dimension is an invariant of metric spaces introduced by Gromov in the context of geometric group theory. In this paper, we study the asymptotic dimension of metric spaces generated by graphs and their shortest path metric…

We compare two classes of functions arising from genus-one superstring amplitudes: modular and holomorphic graph functions. We focus on their analytic properties, we recall the known asymptotic behaviour of modular graph functions and we…

We study some series expansions for the Lambert $W$ function. We show that known asymptotic series converge in both real and complex domains. We establish the precise domains of convergence and other properties of the series, including…

In this paper we relate a fundamental parameter of a random graph, its degree sequence, to a simple model of nearly independent binomial random variables. This confirms a conjecture made in 1997. As a result, many interesting functions of…

Asymptotic expansion of a variation with anticipative weights is derived by the theory of asymptotic expansion for Skorohod integrals having a mixed normal limit. The expansion formula is expressed with the quasi-torsion, quasi-tangent and…

A sequence of graphs with diverging number of nodes is a dense graph sequence if the number of edges grows approximately as for complete graphs. To each such sequence a function, called graphon, can be associated, which contains information…

We derive a new representation for $U$- and $V$-statistics. Using this representation, the asymptotic distribution of $U$- and $V$-statistics can be derived by a direct application of the Continuous Mapping theorem. That novel approach not…

Limited data availability in machine learning significantly impacts performance and generalization. Traditional augmentation methods enhance moderately sufficient datasets. GANs struggle with convergence when generating diverse samples.…

A new approach to the problem of finding the asymptotical behaviour of large orders of semiclassical expansion is suggested. Asymptotics of high orders not only for eigenvalues, but also for eigenfunctions, are constructed. Thus, one can…

New algorithms for construction of asymptotic expansions for stationary distributions of nonlinearly perturbed semi-Markov processes with finite phase spaces are presented. These algorithms are based on a special technique of sequential…

Uniform asymptotic expansions are derived for the zeros of the reverse generalized Bessel polynomials of large degree $n$ and real parameter $a$. It is assumed that $-\Delta_{1} n+\frac{3}{2} \leq a \leq \Delta_{2} n$ for fixed arbitrary…

We study asymptotics of fiber integrals depending on a large parameter. When the critical fiber is singular, full-asymptotic expansions are established in two different cases : local extremum and isolated real principal type singularities.…

In this paper, by using asymptotic expansions of oscillatory integrals with positive real power phase functions in one variable, we obtain asymptotic expansions of oscillatory integrals with phase functions expressed by a product of…

A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…

A steady-state convection-diffusion problem with a small diffusion of order $\mathcal{O}(\varepsilon)$ is considered in a thin three-dimensional graph-like junction consisting of thin cylinders connected through a domain (node) of diameter…

We study the problem of generating graphs with prescribed degree sequences for bipartite, directed, and undirected networks. We first propose a sequential method for bipartite graph generation and establish a necessary and sufficient…