Related papers: On the structure of asymptotic expanders

We combine the ideas of a Harish-Chandra--Howe local character expansion, which can be centred at an arbitrary semisimple element, and a Kim--Murnaghan asymptotic expansion, which so far has been considered only around the identity. We show…

Among all sequences that satisfy a divide-and-conquer recurrence, the sequences that are rational with respect to a numeration system are certainly the most immediate and most essential. Nevertheless, until recently they have not been…

Asymptotic properties of random graph sequences, like occurrence of a giant component or full connectivity in Erd\H{o}s-R\'enyi graphs, are usually derived with very specific choices for defining parameters. The question arises to which…

Sequences that are defined by multisums of hypergeometric terms with compact support occur frequently in enumeration problems of combinatorics, algebraic geometry and perturbative quantum field theory. The standard recipe to study the…

We prove that in all regular robust expanders $G$ every edge is asymptotically equally likely contained in a uniformly chosen perfect matching $M$. We also show that given any fixed matching or spanning regular graph $N$ in $G$, the random…

Asymptotic expansions are derived as power series in a small coefficient entering a nonlinear multiplicative noise and a deterministic driving term in a nonlinear evolution equation. Detailed estimates on remainders are provided.

The full asymptotic expansion of the equivariant complex Ray-Singer torsion for high powers of line bundles on symmetric spaces is given in an explicit form. In the case of isolated fixed points this expansion is given for general complex…

In this paper we present a complete asymptotic expansion of a symmetric homogeneous stable (balanced), stabilizable and stabilized mean. By including known asymptotic expansions of parametric means it is shown how the obtained coefficients…

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…

We consider the uniform asymptotic expansion for the Gauss hypergeometric function \[{}_2F_1(a+\epsilon\lambda,b;c+\lambda;x),\qquad 0<x<1\] as $\lambda\to+\infty$ in the neigbourhood of $\epsilon x=1$ when the parameter $\epsilon>1$ and…

It is well-known that a paracompact space $X$ is of covering dimension at most $n$ if and only if any map $f\colon X\to K$ from $X$ to a simplicial complex $K$ can be pushed into its $n$-skeleton $K^{(n)}$. We use the same idea to…

Asymptotic expansions are obtained for contour integrals of the form \[ \int_a^b \exp \left( - zp(t) + z^{\nu /\mu } r(t) \right)q(t)dt, \] in which $z$ is a large real or complex parameter, $p(t)$, $q(t)$ and $r(t)$ are analytic functions…

This paper is devoted to the structure of the complete asymptotic expansion of the probability that a large combinatorial object is irreducible or consists of a given number of irreducible parts, where irreducibility is understood in terms…

We investigate a class of generalized Schr\"{o}dinger operators in $L^2(\mathbb{R}^3)$ with a singular interaction supported by a smooth curve $\Gamma$. We find a strong-coupling asymptotic expansion of the discrete spectrum in case when…

This paper provides uniform bounds on the asymptotic regularity for iterations associated to a finite family of nonexpansive mappings. We obtain our quantitative results in the setting of $(r,\delta)$-convex spaces, a class of geodesic…

We show that every uniformly asymptotically affine circle endomorphism has a uniformly asymptotically conformal extension.

We compute an asymptotic expansion in $1/c$ of the limit in $n$ of the empirical spectral measure of the adjacency matrix of an Erd\H{o}s-R\'enyi random graph with $n$ vertices and parameter $c/n$. We present two different methods, one of…

We consider piecewise expanding maps of the interval with finitely many branches of monotonicity and show that they are generically combinatorially stable, i.e., the number of ergodic attractors and their corresponding mixing periods do not…

Finding independent sets of maximum size in fixed graphs is well known to be an NP-hard task. Using scaling limits, we characterise the asymptotics of sequential degree-greedy explorations and provide sufficient conditions for this…

We show that an entire branched cover of finite distortion cannot have a compact branch set if its distortion satisfies a certain asymptotic growth condition. We furthermore show that this bound is strict by constructing an entire,…