Abstract
We are interested in a 2D propagation medium obtained from a localized perturbation of a reference homogeneous periodic medium. This reference medium is a “thick graph”, namely a thin structure (the thinness being characterized by a small parameter
Summary of Part 1 and main results of Part 2
This article is the sequel of [5] and we refer the reader to its introduction for the motivation of the study and related bibliographical comments. We choose to go directly to the heart of the subject and to give below a brief recap about the problem under consideration, then to give a summary of the main results of [5] in Sections 1.1 and 1.2. Finally, we state the main result of the present paper in Section 1.3.
Let

The unperturbed periodic ladder (left). The perturbed ladder (right).
Starting from the periodic domain
The operator
Injecting (1) into (2), one can easily see that the construction of localized modes turns out to solve the following eigenvalue problem for the function v:
The decomposition of the operator
into its symmetric and antisymmetric components
To study the operator
The limit problem: Spectral problem on the graph
As might be expected, the investigation of the spectrum of
The limit operators
,
and
The limit periodic graph
The sets of all vertices and all edges of the graph are then

Limit graph
Weighted functional spaces on
Definition of the limit operators
As for the ladder, denoting
The operator
The following proposition, based on explicit characterizations of
The essential spectrum of the operator
For
To show the last item, we use the characterization of the spectrum
Before stating the main result of this paper, let us remind first the result, already proven for instance in [18], which states the convergence of the essential spectrum of the operator
Let
Note that as every eigenvalue of the operators
We point out that the main novelty of the previous result lies in the determination of a high order asymptotic expansion of the eigenvalues of
Methodology of the proof
The proof of Theorem 1 relies on the following lemma.
Let
See the electronic version. □
The function
Due to the multiscale nature of the problem, it is not possible to construct a simple asymptotic expansion of
In Section 2.2, we give the ansatz for the far field and the near field expansions as sums of far field and near field terms indexed by

The domain
Before entering the details, let us introduce some notations. The function
The domains
From now on,
To start the construction of the asymptotic expansion, we have to fix
Choosing another eigenvector
We propose an asymptotic expansion for
Throughout the rest of the paper, we shall extend the above convention: any quantity indexed by k with

Schematic representation of the asymptotic expansion (NF: near field, FF: far field).
Mimicking the approach of [13,14,27], we use the following ansatz (see Fig. 4)
Substituting (25–26–27) into the eigenvalue problem (20), and separating formally the different powers of ε, we get the following set of problems for the far field terms
In what follows, for any k, we denote by The junctions 
To make the matching conditions more explicit, we need to describe the form of the near field terms in the three infinite branches
We begin with some recaps about solution of homogeneous Laplace equations in bands. More precisely, we are interested in the problem
The well-posedness of (37) follows from Lax–Milgram’s lemma and Hardy’s inequality (see for instance [22, Lemma 2.5.7]). Moreover, it can be solved by separation of variables in
Assume that there exists a sequence of near fields
The link between (42) and (43–46) is quite straightforward. In particular,
In opposition, “the harmonic part” of Integrating (46) with respect to
Derivation of the matching conditions
To find the missing information (the transmission conditions at the vertices of the graph for the far field terms and the behaviour at infinity for the near field terms), we shall write the so-called matching conditions that ensure that far field and near field expansions coincide in some intermediate areas. Indeed, far field and near field expansions are assumed to be both valid in some intermediate areas
Then the matching zone

The matching area
Let us first explain how we proceed in the matching zone
We first use the (formal) Taylor series expansion of the far field term
Then, writing
Let us now anticipate here the way we shall exploit these matching conditions for the construction of the asymptotic expansion by induction on k. In fact, these will be used for “building conditions at infinity” for the near field terms in addition to (35). If one assumes
Assume that (
35
)–(
30
) are satisfied (with m instead of k) for
See the electronic version. □
In other words, under the hypotheses of the previous lemma, it suffices to satisfy (55) in order to satisfy the matching conditions (53).
As usual in the method of asymptotic expansions, the construction of the terms
Necessary conditions for the existence of the near field terms
In this section, assuming the existence of the whole sequence
Dirichlet to Neumann operators
Let
Reduction to a bounded domain
We wish to characterize, for
For
The function U solution of (66) is omny defined up to an additive constant at our disposal.
As we shall see later, in the case of
The main result of this section is Proposition 3 whose proof involves two “profile functions” The function The function Note that, according to the identification of the junctions Assume the existence of a sequence See the electronic version. □
In this section, we assume that we are inside an induction process and wish to construct
Assume that
See the electronic version. □
Here we assume that
Let
The proof of this theorem is an elementary application of the Fredholm’s alternative. A similar proof can be found, for instance in [20] (see Theorem 4.10, Corollary 2.2 and Theorem 2.13). Note that (77) is the necessary compatibility condition for the existence of a solution of (74) seen as a generalized boundary value problem for
In the solution of (74), the field
Besides, we can notice that the expression of
We conclude this section by a symmetry property (in the variable x) of the far field
Let
See the electronic version. □
By repeating applications of Proposition 5 and Proposition 4 (successively), we are able to define a recursive procedure to construct all the terms of the different asymptotic expansions (far field expansion, near field expansion and eigenvalue expansion) up to any order. The construction is done by induction.
Moreover, we can derive explicit formulas for the far field terms and semi-explicit expressions for the near field terms, which are suitable for the numerical computations of the successive terms of the asymptotic expansion. In particular, we point out two important features of the forthcoming construction:
First, by induction, all far field terms Secondly, an explicit dependance with respect to j can be proved by induction. This turns out to be very useful from the numerical point of view.
This section is organized as follows. First, we initialize the induction process for
Order 0: Initialization of the algorithm
We start from an eigenvalue
For convenience in the forthcoming exposition, we shall use the following alternative expressions of
Moreover, since
Order 1: First induction step
We shall construct in turn
the coefficient the near field term To avoid a boring exposition of long and complicated formulas or expressions, we shall most often restrict ourselves to explain how these explicit computations can be done, without giving the results (this will be also the case in Section 4.3). Note however that these formulas are necessary and used in the numerical method presented in Section 6, while the general form of these formulas will be used for the error analysis of Section 5. Note that it is natural that the vertical edge corresponding to
They are obtained by solving (74) for
Thanks to (86), (89) and (91), the assumptions of Proposition 5 are satisfied for
Let us first consider the two linear ordinary differential equations of (74) for
Finally, substituting (99) in the fourth equation in (74) (the Kirchhoff condition) yields to
It remains to compute
A priori, this gives 3 linear equations in
Determination of
We already know that
Since
The computation of
Let us now consider the case
We first establish this decomposition inside
For
Order k: The general induction step
The previous reasoning can be repeated for any the coefficient the near field term
We emphasize that the construction, although more technical, is similar to the one for
Justification of the asymptotic expansion
The existence of the (formal) asymptotic expansion being proved, we now prove Theorem 1 by first constructing (Section 5.1) pseudo-modes as defined in Section 2.1. Then we prove that (19) holds with (18). This is based on error estimates of Sections 5.2 and 5.3. This allows to conclude (Section 5.4).
Construction of pseudomodes and related properties
Roughly speaking, given
On the other hand, we define for
The computations that lead to (115) and (116) are of course quite similar to the ones that lead to (112) and (113). The reader will notice that the power of ε that appears as the multiplying factor in the right hand sides of (112) and (115) passes from
Next, we want to construct a pseudomode that will coincide with

Support of the function

Support of the function
To obtain a tractable expression
The matching error
See the electronic version. □
The consistency errors defined in (
120
) satisfy the estimates
See the electronic version. □
Using (with m instead of n) the estimates (121) (Lemma 5) and (122) (Lemma 6), we deduce from (119) (with m instead of n) that the estimate (19) holds with
A numerical approach based on asymptotics expansions
Description of the method
See the electronic version.
Numerical results
In the following section, we choose

The spectrum of

Representation of two limit eigenvectors associated with
The numerical results associated with the first eigenvalue
We notice that the approximation of

Results for the first eigenvalue:

Results for the fourth eigenvalue::
To verify the accuracy of our asymptotic expansion, we represent on Fig. 11 the evolution of the errors
The same experiment is reproduced for the fourth eigenvalue (
To summarize, from a computational point of view, the main advantage of the asymptotic method is that it suffices to make one computation in order to obtain an approximation of

Schematic representation of the domain under consideration.

Near fields

Cuts of the near fields

Near fields

Cuts of the near fields
In Fig. 14, we display the near fields terms
Then, the same near fields are represented in the junction
