Related papers: Asymptotic approximations for eigenvalues and eige…
In continuation with the paper arXiv:1202.4414, we investigate the asymptotic behavior of weighted eigenfunctions in two half-spaces connected by a thin tube. We provide several improvements about some convergences stated in…
Homogenization of a spectral problem in a bounded domain with a high contrast in both stiffness and density is considered. For a special critical scaling, two-scale asymptotic expansions for eigenvalues and eigenfunctions are constructed.…
We analyze the contact Hele-Shaw problem with zero surface tension of a free boundary in a thin domain $\Omega^{\varepsilon}(t).$ Under suitable conditions on the given data, the one-valued local classical solvability of the problem for…
Excitation of surface-plasmon resonances of closely spaced nanometallic structures is a key technique used in nanoplasmonics to control light on subwavelength scales and generate highly confined electric-field hotspots. In this paper we…
Reliable and efficient computation of the pseudospectral abscissa in the large-scale setting is still not settled. Unlike the small-scale setting where there are globally convergent criss-cross algorithms, all algorithms in the large-scale…
Explicit representations of the eigenvalues of the peridynamic operator have been recently derived in [5]. These representations are given in terms of generalized hypergeometric functions. Asymptotic analysis of the hypergeometric functions…
We study planar graphs with large negative curvature outside of a finite set and the spectral theory of Schr{\"o}dinger operators on these graphs. We obtain estimates on the first and second order term of the eigenvalue asymptotics.…
Random graphs defined by an occurrence probability that is invariant under node aggregation have been identified recently in the context of network renormalization. The invariance property requires that edges are drawn with a specific…
This paper investigates the asymptotic nature of graph spectra when some edges of a graph are subdivided sufficiently many times. In the special case where all edges of a graph are subdivided, we find the exact limits of the $k$-th largest…
The on-line nearest-neighbour graph on a sequence of $n$ uniform random points in $(0,1)^d$ ($d \in \N$) joins each point after the first to its nearest neighbour amongst its predecessors. For the total power-weighted edge-length of this…
We consider the quasi-static problem governing the localized surface plasmon modes and permittivity eigenvalues $\epsilon$ of smooth, arbitrarily shaped, axisymmetric inclusions. We develop an asymptotic theory for the dense part of the…
The aim of the paper is to address the behavior in large population of diffusions interacting on a random, possibly diluted and inhomogeneous graph. This is the natural continuation of a previous work, where the homogeneous Erd\H os-R\'enyi…
The one-particle density matrix $\gamma(x, y)$ for a bound state of an atom or molecule is one of the key objects in the quantum-mechanical approximation schemes. We prove the asymptotic formula $\lambda_k \sim (Ak)^{-8/3}$, $A \ge 0$, as…
We consider families of finite quantum graphs of increasing size and we are interested in how eigenfunctions are distributed over the graph. As a measure for the distribution of an eigenfunction on a graph we introduce the entropy, it has…
We study local (the heat equation) and nonlocal (convolution type problems with an integrable kernel) evolution problems on a metric connected finite graph in which some of the edges have infinity length. We show that the asymptotic…
We study asymptotic behaviour of stochastic approximation procedures with three main characteristics: truncations with random moving bounds, a matrix valued random step-size sequence, and a dynamically changing random regression function.…
We prove optimal convergence estimates for eigenvalues and eigenvectors of a class of singular/stiff perturbed problems. Our profs are constructive in nature and use (elementary) techniques which are of current interest in computational…
We consider the adjacency matrix $A$ of the Erd\H{o}s-R\'enyi graph on $N$ vertices with edge probability $d/N$. For $(\log \log N)^4 \ll d \lesssim \log N$, we prove that the eigenvalues near the spectral edge form asymptotically a Poisson…
We construct an asymptotic approximation to the solution of a transmission problem for a body containing a region occupied by many small inclusions. The cluster of inclusions is characterised by two small parameters that determine the…
The asymptotic spectrum of graphs, introduced by Zuiddam (arXiv:1807.00169, 2018), is the space of graph parameters that are additive under disjoint union, multiplicative under the strong product, normalized and monotone under homomorphisms…