On the notion of ground state for nonlinear Schrödinger equations on metric graphs

We compare ground states for the nonlinear Schrödinger equation on metric graphs, defined as global minimizers of the action functional constrained on the Nehari manifold, and least action solutions, namely minimizers of the action among all solutions to the equation. In principle, four alternative cases may take place: ground states do exist (thus coinciding with least action solutions); ground states do not exist while least action solutions do; both ground states and least action solutions do not exist and the levels of the two minimizing problems coincide; both ground states and least action solutions do not exist and the levels of the two minimizing problems are different. We show that in the context of metric graphs all four alternatives do occur. This is accomplished by a careful analysis of doubly constrained variational problems. As a by-product, we obtain new multiplicity results for positive solutions on a wide class of noncompact metric graphs.


Introduction
Nonlinear Schrödinger equations on metric graphs have attracted the interest of a large -and increasing -number of researchers in the last few years.As the literature on the subject witnessed a massive growth, we refrain from overviewing it here, redirecting e.g. to [1,3,[9][10][11][12][13][14][15][16]21,26,29,32,33,[38][39][40] for some of the most recent developments and to the reviews [2,34] for more comprehensive discussions.Within the whole theory, prominent efforts have been devoted to the analysis of existence of positive standing wave solutions, with a particular focus on ground states.
The notion of ground state however, albeit often suggested unequivocally by the specific problem under study, is by no means univocally defined.This aspect is of course not specific to Schrödinger equations on metric graphs, but is a general feature appearing in the study of various types of scalar field equations on a variety of domains, from open subsets of R N to Riemannian manifolds.
To describe it more concretely, we consider a metric graph G and the NLS equation where λ > 0 and p > 2. As usual, it is required that (1.1) be satisfied pointwise on every edge of G, while additional matching conditions have to be imposed at the vertices of the structure.In this paper, equation (1.1) is coupled with the so-called natural, or Kirchhoff, boundary conditions, prescribing that on every vertex v of G the sum of the outgoing derivatives of u along every edge incident at v is zero.Thus, defining a coordinate x e ∈ (0, |e|) on every edge e of G (where |e| is the length of edge e), the problem we are addressing reads where λ > 0, p > 2, the symbol e ≻ v means that the sum is extended to all edges emanating from v and where du dxe (v) is the outward derivative of u at v. In this framework, the solutions to (1.2) can be characterized variationally as the critical points of the standard action functional where In the search for ground states, as J λ is not bounded from below, one may impose extra constraints to recover boundedness and make a minimization procedure meaningful.For instance one could restrict J λ to the unit sphere of L p (G) or to the Nehari manifold associated with J λ (this second approach has the advantage that the nonlinearity need not be homogeneous).Both procedures make J λ bounded from below on these sets and one then defines ground states as the functions that achieve the infimum of J λ on the constraint.Specifically, for our problem, the Nehari manifold is the set As is well known, the Nehari manifold contains all nonzero critical points of J λ and is a natural constraint, in the sense that constrained critical points are in fact true critical points of J λ .This leads to a first definition of ground state.Defining it is customary to set the following Definition 1.1.An action ground state for (1.2) is a function u ∈ N λ (G) such that J λ (u) = c λ (G). (1.5) Clearly any action ground state is a constant sign solution to (1.2), often referred to also as a "solution of minimal action", though we adopt here a different terminology (see Definition 1.2).In applications, action ground states play a prominent role for various reasons, which fully justifies the preceding definition.In practice, however, one is very often confronted with the following inconvenience: there need not exist any function u in N λ (G) satisfying (1.5) (a frequent fact in many noncompact settings).Thus, the existence of a ground state is not guaranteed in general.
To overcome this obstacle, sometimes one assumes a different definition of ground state.Let be the set of nonzero solutions to (1.2) and set Although it is common use to call ground states too the functions described in the following definition, we prefer to label them with a different name, to avoid misunderstandings.
The two points of view motivating the above definitions are clearly different.In the former case one fixes the attention on the level c λ (G), and tries to prove that it is attained, obtaining in this way a solution that has minimal action among all functions in N λ (G).In the latter the aim is to ascertain if, among solutions of (1.2), there is one of least action; in this case there might be plenty of functions with lesser action (and none of them will solve problem (1.2) if c λ (G) is not attained).
Although S λ (G) is a much smaller set than N λ (G) it is not at all clear, in general, that there exist any functions in S λ (G) that achieve σ λ (G).Thus, even with the second definition, the existence of "ground states" is not guaranteed a priori.
The aim of this paper is to analyze the relations among c λ (G) and σ λ (G) and in particular to investigate if all the theoretical cases can actually take place.To make this point clear we start by observing that, trivially, without any further assumption.Furthermore, if c λ (G) is attained by some function u ∈ N λ (G), then u ∈ S λ (G), the equality c λ (G) = σ λ (G) holds, and σ λ (G) is attained too.In view of these preliminary considerations, the possibilities to consider are exactly the following four: , and they are attained; A2) c λ (G) = σ λ (G), and they are not attained; , and neither is attained.
To prove or disprove the actual occurrence of these situations then amounts, for each A1-B2, to produce an example of a graph G where the behavior is exactly the one prescribed by the alternative in question.We wish to make very clear that the previous discussion is completely independent of the domain on which the NLS equation is set.For instance, replacing G by an open subset Ω of R N (and the second derivative by the Laplacian, and so on, e.g.H 1 (G) by H 1 (Ω) or H 1 0 (Ω),....), every issue described so far can be stated in the new context without any modification except notation.In particular, the four alternatives listed above remain and it would be extremely interesting to understand if they really occur.While this can be easily achieved in some of the alternatives (A1, for instance), some of them appear rather difficult to deal with when considering the NLS equation on subsets of R N and are currently out of reach.
Our present contribution aims at shedding some light on this problem starting from the context of metric graphs, where one can profitably use the advantage of the local one-dimensional nature of the ambient space to obtain sharper results.Even in this setting, though, the constructions we will provide are quite involved, very specific to the metric graph environment and do not seem to be extendable to other frameworks.
Stated in a compact form, our main result is the following.In a nutshell, as far as action ground states are concerned, "anything can happen" on metric graphs.Theorem 1.3.For every p > 2, every λ > 0 and every choice of an alternative among A1, A2, B1, B2, there exists a metric graph G where that alternative takes place.
As the proof of Theorem 1.3 will be carried out case by case, let us briefly comment here on A1-B2, postponing the technical issues to subsequent sections.
Case A1 corresponds to problems where the infimum c λ (G) is achieved.This is what one normally tries to obtain in the existence results and it is the case for all compact graphs and for some noncompact ones (see e.g.[6-8, 22, 23, 25, 35, 37, 38, 41], works that deal with still a slightly different notion of ground state, but whose techniques adapt easily to the present setting).The theory in this framework is rather well developed, not only on metric graphs of course, and there is not much to add.
In case A2 the graph is necessarily noncompact.There are plenty of examples where it is known that c λ (G) is not attained, and this is due to topological or metric obstructions on the graph that have been widely described in the literature (see again e.g.[6][7][8]25]).Nonetheless, this leaves open the question of the existence of a least action solution in the sense of Definition 1.2.As far as we know, examples of this kind, where c λ (G) coincides with σ λ (G) but the level is not achieved, have never been described before.The construction of a graph with this property will be the object of Section 4.2 (Theorem 4.1) and is one of the principal proofs of the paper.
Due to existing results, it is easy to produce an example where alternative B1 occurs.We will briefly describe it anyway for completeness in Section 4.3, since it has never been considered under this perspective.
Case B2 is the hardest one and will be treated in Section 4.4 (Theorem 4.2).It is well known that, typically, the lack of a function attaining c λ (G) is due to the presence of a "problem at infinity" that attracts nonconvergent minimizing sequences.This is a standard phenomenon in problems with lack of compactness and is essentially what takes places in cases A2 and B1.The main novelty in B2, which is what makes this case rather delicate, is that the infimum over solutions is not attained due to the presence of a second problem at infinity, at level σ λ (G) > c λ (G).By this we do not mean a problem at infinity with loss of compactness at different levels, but rather the presence of two distinct problems: the first, as we said, attracting nonconvergent minimizing sequences for J λ and preventing at the same time the existence of solutions with action arbitrarily close to such infimum level; the second attracting nonconvergent sequences of solutions of lower and lower level.In fact, the gap between c λ (G) and σ λ (G) reflects the coexistence of this pair of necessarily different problems at infinity.This seems to be a new phenomenon and it is what makes quite involved the construction of a graph exhibiting it.
As a byproduct, we notice that in cases A2 and B2, the fact that σ λ (G) is not attained immediately implies the existence of infinitely many positive solutions for (1.2), with accumulating levels, which we believe to be a remarkable fact.
From the technical point of view, the proofs of the aforementioned results exploit deeply the role of both the topology and the metric of graphs to determine existence/non-existence of solutions to specific variational problems.On the one hand, non-existence of ground states is obtained via by-now standard arguments in the theory of NLS on metric graphs.On the other hand, the construction of noncompact sequences of solutions in S λ (G) with specific action level is achieved, in both cases A2 and B2, through a careful analysis of doubly-constrained minimization problems in the form inf where is the subset of H 1 functions attaining their L ∞ norm on a given bounded edge e of G.A rather general existence result of independent interest is derived for this kind of problems in Section 3. Precisely, for a wide class of noncompact graphs, given λ > 0 we show that the infimum in (1.9) is attained whenever the length of e is larger than a threshold depending only on λ and p (Theorem 3.2).Moreover, such a minimizer is a solution of problem (1.2) provided e is sufficiently long (Theorem 3.3), the threshold depending this time also on inf e∈E |e|, where E is the set of all edges of G.This approach was originally introduced for mass-constrained critical points of the energy functional in [5], where it proved suitable to obtain multiplicity results.However, in that paper a crucial assumption is that the (prescribed) mass be sufficiently large.By scaling properties, this is equivalent to the assumption that the length of all bounded edges is large.Here, on the contrary, it is sufficient that a single edge is long enough.A direct consequence of these results is the existence of multiple positive solutions, each attaining its maximum on one of the edges longer than the threshold (Theorem 3.5).
To conclude this introduction, let us point out that, as is well-known, to look at solutions of (1.2) as critical points of the action functional (1.3) is not the unique variational characterization at disposal.In particular, moving from the seminal papers [20,30], in the past decade a lot of attention has been devoted, both on metric graphs and on domains in R N , to normalized solutions, i.e. critical points of the energy functional E : constrained to the space of functions with prescribed mass µ In this setting, the parameter λ appearing in (1.2) is not known a priori and pops up as a Lagrange multiplier associated to the mass constraint.It is evident that one can consider definitions of energy ground states and least energy solutions analogous to those given above when dealing with where 2) for some λ ∈ R , one has the following mutually exclusive four alternatives (the analogue of A1-B2) A1) c µ (G) = σ µ (G), and they are attained; A2) c µ (G) = σ µ (G), and they are not attained; , and neither is attained.
As a matter of fact, the analysis we develop here for J λ can be naturally adapted to prove (with the very same constructions) that also in the context of normalized critical points of E all cases A1− B2 do actually occur.Note that, even though both the approaches have been widely exploited in the literature, a detailed discussion of the relation between ground states (and more generally local minima) of J λ and E was started only recently in [24,31].
The paper is organized as follows.Section 2 recalls some preliminary results, whereas Section 3 deals with doubly-constrained variational problems for the action functional in a general setting, proving the existence results in Theorems 3.2-3.3-3.5.Section 4 is devoted to the proof of Theorem 1.3.

Notation.
In what follows, we will write e.g.u p , . . ., in place of u L p (G) , . . ., whenever possible.When needed, the full notation will be used to indicate explicitly the domain of integration.

Preliminaries
In this paper we use a number of properties and results that have been established (mostly) in the recent literature.For the ease of the reader we collect them in the present section, referring each time to the original papers where proofs can be found.
We assume that the reader is familiar with the concept of metric graph.However, we make precise that in this paper we consider metric graphs G = (V, E) satisfying the following definition.
Definition 2.1.We denote by G the class of metric graphs G = (V, E) such that • G is connected and has an at most countable number of edges; • G has at least one unbounded edge (i.e. a half-line); • deg(v) < ∞ for every v ∈ V, where deg(v) denotes the degree of the vertex v, i.e. the number of edges emanating from it; • inf e∈E |e| > 0, where |e| denotes the length of e.
There is no loss of generality in assuming that deg(v) = 2 since every vertex of degree two can a priori be eliminated from any metric graph, by melting the two edges incident at v into a single edge.Note that every G ∈ G is noncompact.Further assumptions will be made when needed in the course of the paper.
In the study of the NLS equation on a metric graph in class G, a fundamental tool is provided by the Gagliardo-Nirenberg inequalities (see [8]) that hold for every u ∈ H 1 (G) and every q ≥ 2, and their (2.2) A second fundamental tool that we will use very frequently in the next sections is provided by the rearrangement techniques of H 1 functions on a generic graph G, for the details of which we refer to Section 3 of [7].For the reader's convenience we recall here that, given a nonnegative function u ∈ H 1 (G), the decreasing rearrangement of u is the unique nonincreasing function u * ∈ H 1 (0, |G|) equimeasurable with u.The equimeasurability property entails that Moreover, by the classical Pólya-Szegő inequality, we have . By definition, u is symmetric, nonincreasing on [0, −|G|/2) and equimeasurable with u.Furthermore, it is well known (see e.g.[7]) where equality implies that #u −1 (t) = 2 for almost every t ∈ (0, u ∞ ).
The following result, that will be used in Section 4, is essentially a refinement of the Pólya-Szegő inequality and its proof follows combining results of [27] and [28].Proposition 2.2.Let G be any metric graph and let u be a nonnegative function in H 1 (G).Let T ⊂ [0, +∞[ of positive measure.Assume that, for some integer K ≥ 1, #u −1 (s) ≥ K for a.e.s ∈ T .
Then the decreasing rearrangement u * of u satisfies Next, if G is a metric graph in class G and λ > 0, we define the action functional and the Nehari manifold associated to J λ , It is well known that there exists a natural projection of we have u ∈ N λ (G) if and only if π λ (u) = 1.We will also need the functional L : (2.7) If u solves problem (1.2), then L(u) = λ and, more generally, L(u) = λ if and only if u ∈ N λ (G).When u ∈ N λ (G), the functional J λ takes the simple form so that J λ is positive on N λ (G).Actually more can be said, and we summarize it in the next proposition.
Proposition 2.3.There exists a constant C > 0 depending only on λ and p such that (2.9) which proves (2.9).From (2.8), as sup , we see that u n 2 and u n ∞ are also uniformly bounded away from zero.
When G = R, the non-trivial solutions to (1.2) are called solitons, they are unique up to translations and sign and they are the action ground states of J λ over N λ (R) (see e.g.[36, Proposition 3.12]).Denoting by φ λ the unique positive and even soliton, letting s 1 := J 1 (φ 1 ) and for λ > 0, there results When G = R + , for every λ > 0 there is a unique positive action ground state, given by the restriction of φ λ to R + and inf The level s λ plays a fundamental role in many papers, including the present one.
Lemma 2.4.Let G be a metric graph.Assume that, for every ℓ > 0, G has an edge e ℓ of length at least ℓ.Then there exists a sequence of functions (u ℓ ) ℓ∈N ⊆ N λ , equal to zero outside e ℓ , and such that lim In particular inf Proof.Let φ λ be the soliton in N λ (R) and set δ ℓ = φ λ (ℓ/2) = o(1) as ℓ → ∞.For every ℓ > 0, identify the interval [−ℓ/2, ℓ/2] with a subset of the edge e ℓ and define v ℓ ∈ H 1 (G) as elsewhere on G.
as ℓ → ∞, and likewise for all the L q norms, we see that as ℓ → ∞, and we conclude.
In [7] the authors introduced a topological condition on G under which inequality (2.13) is reversed.In our setting this condition, that we call assumption (H) as in [7], takes the following form.
If a graph G ∈ G satisfies assumption (H), it is easy to see (and proved in [7]) that for every for almost every t ∈ (0, u ∞ ).
Therefore, letting u be the symmetric rearrangement of u, if u ∈ N λ (G) we have π λ ( u) ≤ 1 by (2.5).As π λ ( u) u ∈ N λ (R), we conclude by (2.11) and (2.8) that and since this holds for every u ∈ N λ (G), inequality (2.13) is in fact an equality.As a consequence, with the same techniques as in [7], it is easy to prove the following result.
Theorem 2.6.If G ∈ G satisfies assumption (H), then but it is never achieved, unless G is isometric to R or to one of the exceptional graphs depicted in Example 2.4 of [7].
If more is known on the number of preimages of a function u ∈ N λ (G), one can obtain sharper estimates.The following result will be used in Section 4.
Proposition 2.7.Let G ∈ G and assume that u ∈ N λ (G) is nonnegative and satisfies for some integer Proof.Since G ∈ G we have |G| = +∞.By Proposition 2.2 applied to T = (inf G u, sup G u) = (0, sup G u), the decreasing rearrangement u * of u satisfies u * ∈ H 1 (R + ) and Setting u K (x) := u * (Kx), a standard change of variable shows that and therefore, as π λ (u K )u K ∈ N λ (R + ), by (2.12)

A general existence result
In this section we prove a general existence result for positive solutions to (1.2) attaining their maximum in the interior of a prescribed sufficiently long edge.Throughout this section, we work with metric graphs in class G, most of the time requiring also that the graph satisfies assumption (H).However, the arguments described in this section can be adapted with minor modifications to cover even broader classes of graphs.
Let G ∈ G satisfy assumption (H) and let e be one of its bounded edges.Set and consider the doubly-constrained minimization problem Remark 3.1.The set X e is closed in the weak topology of H 1 (G).Indeed, if u n ∈ X e and u n ⇀ u in H 1 (G), then by semicontinuity the last equality being justified by the uniform convergence of u n to u on e.
The next two theorems state the main results of this section.
Remark 3.4.It is interesting to observe the difference of dependence of the threshold in the two previous results.In the first one, there is no dependence on the rest of the graph while in the second one, there is a slight dependence on the infimum of the length of the other edges.
A straightforward consequence of the preceding theorems is the following multiplicity result.
Theorem 3.5.Under the assumptions of Theorem 3.3, there exists R > 0 depending only on ℓ 0 , λ and p such that for every bounded edge e of length larger than R, problem (1.2) has a positive solution attaining its absolute maximum on e only.Hence, if G has n bounded edges of length greater than R, then problem (1.2) has at least n distinct positive solutions.
For the proof of Theorems 3.2-3.3we need the following lemmas.
where s θ is defined in (2.10).
Proof.Let θ n := L(u n ), so that u n ∈ N θn (G) and θ = lim and the result follows.
The next result describes the behavior of minimizing sequences for problem (3.1).
Lemma 3.7.Let G ∈ G and let e ∈ G be a bounded edge.Let (u n ) n ⊂ N λ (G) ∩ X e be any minimizing sequence for J λ in N λ (G) ∩ X e .Then (u n ) n admits a subsequence (not relabeled) such that Proof.Since (u n ) n is a minimizing sequence, up to subsequences, 1) and 2) can be deduced from Proposition 2.3.Notice that u ≡ 0 since if this were not the case, by L ∞ loc convergence, and hence convergence in L ∞ (e), L 2 (G) → 0, violating 1).Moreover, since X e is weakly closed (see Remark 3.1), u ∈ X e , and 3) is proved.
To prove 4) observe that by lower semicontinuity, since π λ (u)u ∈ N λ (G) ∩ X e , the estimate ∩ X e and (3.3) shows that u is a minimizer, which is 5).
Finally, suppose that L(u) < λ and hence u n − u ≡ 0 for all n large.Obviously, by semicontinuity, m ≤ µ.To prove that the inequality is strict, first observe that by the Gagliardo-Nirenberg inequality (2.1), for every n, since (u n ) n is bounded in H 1 (G).Now, by the Brezis-Lieb Lemma [17], as n → ∞, .
Since L(u) < λ and u ≡ 0, we see that µ = lim n u n 2 2 > u 2 2 = m, since otherwise (3.4) is violated.Letting n → ∞ in the preceding equality, we obtain (3.2) and the proof is complete.
Remark 3.8.As a consequence of Lemma 2.4, for every ε > 0 there exists R ε > 0 such that, if G is any metric graph containing a bounded edge e of length greater than R ε , then We are now ready to prove the main results of this section.
Proof of Theorem 3.2.Fix ε > 0 such that Observe that C depends only on p and, hence, that ε depends only on p and λ but not on G.
Let R be so large that for every R ≥ R, c λ (G, e) < s λ+ε , which is possible by Remark 3.8.Again, we observe that R depends only on p and λ but not on G. Let (u n ) n ⊂ N λ (G) ∩ X e be a minimizing sequence for J λ such that for every n.Applying Lemma 3.7, (u n ) n has (up to subsequences) a weak limit u ∈ X e \ {0} such that L(u) ≤ λ and, in case equality holds, u is the required minimizer.We now show that L(u) < λ cannot happen, and this will end the proof.If L(u) < λ, by (3.2), as otherwise, up to a subsequence, (u n ) n converges to u in L p (G), and by lower semicontinuity we would have As G ∈ G satisfies assumption (H), (3.7), (3.2) and Lemma 3.6 give lim inf Notice that lim and hence we see that and therefore, by the Gagliardo-Nirenberg inequality (2.2) and (3.9), recalling that m = u 2 2 , we have λ Thus, recalling from (2.10) the value of α, we see from (3.10) and (3.13) that with C given by (3.6).
In conclusion, by the Brezis-Lieb Lemma and (3.8), Neglecting the last term, we obtain or, rearranging terms and using (3.14), Using this, we see from Lemma 3.6 that Hence, by (3.15), which contradicts (3.5).
Remark 3.9.Before proving Theorem 3.3 we recall that, letting for every ε > 0 there exists δ > 0 such that, for every u This can be readily seen by standard compactness arguments and the uniqueness of the minimizer of J λ in N λ (R) ∩ D (see e.g [19]).
Proof of Theorem 3.3.By Remark 3.9, there exists δ > 0 such that for every u ∈ N λ (R) ∩ D with J λ (u) ≤ s λ + δ there results and, accordingly to Remark 3.8, let R > 0 be such that for every edge e with length R ≥ R. Observe that R depends only on λ, p and ℓ 0 .Let u R ∈ N λ (G) ∩ X e be a function satisfying Indeed, (3.19) implies that u R belongs to the relative interior of N λ (G) ∩ X e , and therefore it is not only a global minimizer of J λ in the double constraint space, but also a local minimizer in N λ (G), and, as such, solves (1.2).Since |u R | ∈ N λ (G) ∩ X e and J λ (u R ) = J λ (|u R |), we will assume that u R ≥ 0 on G.We proceed by contradiction and assume that , denote by B the set of all bounded edges of G and set The definition of δ R as a maximum is correct even if B contains infinitely many edges.Indeed, as u R 2 is finite and the length of the edges is bounded from below by ℓ 0 , there is only a finite number of edges h where min h u R ≥ t, for every t > 0.
Since G satisfies assumption (H), by Step 1 of the proof of Lemma 4.2 of [5], Notice that the set contains at least one bounded edge of B (the one where the minimum of u R is exactly δ R ) and therefore we have A R ≥ ℓ 0 .
Let now u R be the symmetric rearrangement of u R .By Proposition 2.2 applied to Next, denoting Since Using (3.24) and recalling that J λ (u R ) = c λ (G, e), (3.18) and (3.23) imply that Since, by definition π λ ( u R ) u R belongs to D, with D defined in Remark 3.9, (3.25), (3.16) and the fact that ε ≤ δ imply that In order to obtain a contradiction, we now prove that By (3.24), we have Using the previous inequality, (3.18) and (3.23), we deduce that (3.28) By (3.17), (3.22), (3.28), (3.29) and the fact that 2ℓ R ≥ ℓ 0 for every n, we obtain 3 which concludes the proof of (3.19).
The proof that u R > 0 in G follows by a strong maximum principle as in [7, Proposition 3.3] knowing that u R ≥ 0 on G.

Proof of Theorem 1.3
This section is devoted to the proof of the main result of the paper.In fact, alternatives A1 and B1 are straightforward, whereas A2 will follow as a direct application of the results proved in Section 3. Conversely, case B2 is the most involved and will occupy the largest part of this section.
For the sake of completeness, each case A1-B2 is presented here independently from the others.
4.1 Case A1: c λ = σ λ , attained As already pointed out in the Introduction, this is the easiest case and there is essentially nothing to say.It is the case where c λ (G) is attained by an action ground state, which is of course also a least action solution.Straightforward examples for this are compact graphs, where ground states exist for every value of λ and p (see for example [22]), but many graphs realizing alternative A1 can be identified also in the noncompact setting, as e.g.those presented in [8, Section 3].

not attained
The proof of this alternative is one of the main results of the paper and it relies heavily on Theorems 3.2-3.3above.To exhibit a graph where A2 occurs we will use the following construction.On a real line we insert, for each integer k ≥ 1, a node v k at the point of coordinate k.At each v k we attach a self-loop L k of length k, by identifying v k with the only vertex of L k .We obtain in this way the graph depicted in Figure 1.Proof.On the one hand, G ∈ G satisfies assumption (H) by construction, so that c λ (G) = s λ and c λ (G) is not attained by Theorem 2.6.On the other hand, Theorems 3.2-3.3ensure that, for sufficiently large k, there exists u k ∈ S λ (G) such that J λ (u k ) = c λ (G, L k ).Hence, by Remark 3.8, As anticipated in the Introduction, in view of the existing literature it is easy to produce graphs realizing alternative B1.Indeed, it is for instance enough to let G be a star graph, i.e. a graph made of a finite number N ≥ 3 of half-lines, glued together at their common origin.Star graphs have been widely investigated, as they provide the simplest example of noncompact graphs with half-lines.On the one hand, since star graphs satisfy assumption (H), it is immediate to see that c λ (G) = s λ and it is not attained by Theorem 2.6.On the other hand, one can exploit the simple structure of these graphs to characterize explicitly the set of all solutions S λ (G) (see e.g.[4]) 2) only admits two nonzero solutions ±u, the positive one given by a copy of the restriction of φ λ to R + on each half-line of the graph.
• if N is even, the set of non-zero solutions of (1.Hence, we easily deduce that σ λ (G) = N 2 s λ > s λ and it is attained for instance by a function u ∈ S λ (G) whose restriction to each half-line of the graph coincides with the restriction of the soliton φ λ to R + .

Case
The discussion of alternative B2 requires a deeper analysis with respect to the other cases.To prove that this alternative actually occurs, we will consider the one-parameter family of noncompact graphs constructed as follows.
Let N ∈ N be fixed.Keeping in mind Figure 2, we consider a straight line on which we insert, for every k ∈ Z, a vertex v k at the point of coordinate k.At each v k we attach a copy of the graph R, called R k , by identifying v k with the vertex of R k .Next, denoting by L the self-loop of length N in Figure 2(b), we attach at each v k except v 0 a copy of the graph L, called L k , by identifying v k with the only vertex of L k .Finally, we attach at v 0 the graph B with N edges of length 1 in Figure 2(c), by identifying one of its two vertices with v 0 .We call G N the resulting graph, shown in Figure 3.A second graph we will use below, that plays the role of "limit graph" with respect to G N , is depicted in Figure 4.It is exactly equal to G N except that the subgraph B is replaced by a loop L 0 identical to all other loops.Note that this graph is Z-periodic.We call it G N , and we label all its vertices, edges and subgraphs with the same letters as for those of G N , superposed by a tilde.Note that the graph G N is made of edges of length 1 (the horizontal edges and the N edges of B), of self-loops of length N and of half-lines.Notice also, as it will be important in the sequel, that the total length of B equals the length of the loop L.
Exploiting the dependence of G N on the parameter N we have the following result, which proves the actual occurrence of case B2.Theorem 4.2.For every N ∈ N, let G N be the graph in Figure 3.There exists N ∈ N such that for every N ≥ N , Preliminary to the proof of Theorem 4.2, we introduce some notation.Since λ is fixed we omit to write it in quantities that depend on it, except for the levels s λ , c λ (G N ) and σ λ (G N ) (and the same for quantities relative to G N ).Next, in order to have lighter notation, we omit to write the dependence from N in various quantities, such as the loops L k , and we keep it only in the names of the graphs.It is understood anyway that N is a parameter that we will tune in various proofs.
In what follows, we split the set of solutions to problem (1.2), as where We define analogously the sets S 1 ( G N ), S 2 ( G N ), S 3 ( G N ) so that we also have Remark 4.3.By construction, both G N and G N satisfy assumption (H), so we have immediately that for every and neither infimum is attained as a consequence of Theorem 2.6.
Remark 4.4.Observe that, if G ∈ G satisfies assumption (H) and u is a sign-changing solution, then u + ∈ N λ (G) and u − ∈ N λ (G) and, by Theorem 2.6, The proof of Theorem 4.2 will rely on the next series of lemmas.As J λ (u) = J λ (|u|), we will assume without loss of generality in the rest of this section that all the functions u ∈ N λ (G N ) that we will consider will be non-negative.

Then for every
Moreover, if for t in a set of positive measure, then the inequality (4.2) is strict.
is attained twice on each half-line, and every value in (0, u(v k )) is attained once on each half-line and at least once in G N \ R k .Thus we conclude, exactly as above, that (4.6) holds.
In the second case the restriction of u to R k is the whole soliton φ λ , which is smooth, and in particular the derivatives of φ λ at v k , being opposed, do not contribute to the Kirchhoff condition.Therefore u solves problem (1.2) on G N \ R k and, as such, u ∈ N λ (G N \ R k ).Then, by (2.9), with C depending only on λ and p.In conclusion, and the lemma is proved choosing δ 1 = min 1 2 s λ , κC .Now we prove that an estimate similar to that of the previous lemma holds also for solutions attaining their maximum on an edge of length 1.Then the result will follow via Lemma 4.5 and (1.8).Let u ∈ N 2 ( G N ) and assume that u attains its maximum on a given edge e (of length 1).We first construct a new graph and we rearrange u on it.Let e be an edge of length 1 and attach a pair of half-lines H 1 , H 2 to one of its vertices and another pair H 3 , H 4 to the other one.We obtain in this way an H-shaped graph denoted by G.We now claim that there exists v ∈ N λ (G) ∩ X e such that J λ (v) ≤ J λ (u).Let u 1 and u 2 be the symmetric rearrangements on R of the restrictions of u to G v k , G v k+1 respectively, so that u 1 , u 2 ∈ H 1 (R) and u 1 L q (R) = u L q ( Gv k ) , u 2 L q (R) = u L q ( Gv k+1 ) for every q ∈ [1, ∞], and notice that w δ → w strongly in H 1 ( G N ) as δ → 0. The support of w δ is, by construction, a bounded subgraph G δ of G N , that can also be considered as a subgraph of G N : it suffices to embed it, for every δ, into G N in such a way that it does not contain v 0 .Thus, after extending w δ to 0 in G N \ G δ , we can view it as a function in H 1 (G N ) attaining its maximum on some loop L k δ .Note also that, by strong convergence, Therefore, as δ → 0, and hence, by Lemmas 4.6-4.7, J λ (u) < s λ + ε.
Proof of Theorem 4.2.It is enough to take N as in Lemma 4.11, the result is then a straightforward consequence of Remark 4.3 and Lemma 4.11.

Theorem 3 . 2 .Theorem 3 . 3 .
There exists R > 0 depending only on λ and p such that, if G ∈ G satisfies assumption (H) and has a bounded edge e of length R ≥ R, then c λ (G, e) is attained.Let G ∈ G satisfy assumption (H) and have a bounded edge e of length R. Let ℓ 0 ≤ inf e∈E |e|.Then there exists R depending only on ℓ 0 , λ and p such that if R ≥ R and u is a minimizer for c λ (G, e), then u ∈ S λ (G) and u > 0 or u < 0 on G.Moreover,

Figure 2 :
Figure 2: The building blocks of the graph G N .Two half-lines emanating from a vertex (a); a self-loop of length N (b); N edges of length 1 connecting two vetices (c).

Figure 3 :
Figure 3: The graph G N .

Figure 4 :
Figure 4: The graph G N .

Lemma 4 . 5 .
Let e ∈ G N , N ≥ 2, be any bounded edge.Identify G N \ B with G N \ L 0 and let e ∈ G N be e = e if e / ∈ B L 0 if e ∈ B.

(4. 8 )
To see this, let v k , v k+1 be the vertices of e and let G v k , G v k+1 be the connected components of G N \ e containing v k and v k+1 respectively.Note that both G v k and G v k+1 satisfy assumption (H) and hence#{x ∈ G v k | u(x) = t} ≥ 2 for almost every t ∈ (0, u L ∞ ( Gv k ) ), #{x ∈ G v k+1 | u(x) = t} ≥ 2for almost every t ∈ (0, u L ∞ ( Gv k+1 ) ).