Banach space actions and $L^2$-spectral gap
Tim de Laat, Mikael de la Salle

TL;DR
This paper extends spectral gap criteria for property (T) from Hilbert spaces to uniformly curved Banach spaces, applying to random groups and providing new spectral estimates.
Contribution
It generalizes Żuk's spectral gap criterion for property (T) to Banach spaces beyond Hilbert spaces, including $L^p$ spaces, and applies to random groups in the triangular density model.
Findings
Spectral gap criteria for Banach space actions established.
Results apply to random groups with density > 1/3.
New spectral estimates for $p$-Laplacian and Erdős-Rényi graphs.
Abstract
\.{Z}uk proved that if a finitely generated group admits a Cayley graph such that the Laplacian on the links of this Cayley graph has a spectral gap , then the group has property (T), or equivalently, every affine isometric action of the group on a Hilbert space has a fixed point. We prove that the same holds for affine isometric actions of the group on a uniformly curved Banach space (for example an -space with or an interpolation space between a Hilbert space and an arbitrary Banach space) as soon as the Laplacian on the links has a two-sided spectral gap . This criterion applies to random groups in the triangular density model for densities . In this way, we are able to generalize recent results of Dru\c{t}u and Mackay to affine isometric actions of random groups on uniformly curved Banach spaces. Also, in the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Banach space actions and -spectral gap
Tim de Laat
Tim de Laat
Mathematisches Institut, Westfälische Wilhelms-Universität Münster
Einsteinstrasse 62, 48149, Münster, Germany
and
Mikael de la Salle
Mikael de la Salle
UMPA, CNRS–ENS de Lyon
69364 Lyon cedex 7, France
Abstract.
Żuk proved that if a finitely generated group admits a Cayley graph such that the Laplacian on the links of this Cayley graph has a spectral gap , then the group has property (T), or equivalently, every affine isometric action of the group on a Hilbert space has a fixed point. We prove that the same holds for affine isometric actions of the group on a uniformly curved Banach space (for example an -space with or an interpolation space between a Hilbert space and an arbitrary Banach space) as soon as the Laplacian on the links has a two-sided spectral gap .
This criterion applies to random groups in the triangular density model for densities . In this way, we are able to generalize recent results of Druţu and Mackay to affine isometric actions of random groups on uniformly curved Banach spaces. Also, in the setting of actions on -spaces, our results are quantitatively stronger, even in the case . This naturally leads to new estimates on the conformal dimension of the boundary of random groups in the triangular model.
Additionally, we obtain results on the eigenvalues of the -Laplacian on graphs, and on the spectrum and degree distribution of Erdős-Rényi graphs.
TdL is supported by the Deutsche Forschungsgemeinschaft under Germany’s Excellence Strategy – EXC 2044 – 390685587, Mathematics Münster: Dynamics – Geometry – Structure and through SFB 878
MdlS is supported by the CNRS and by the LABEX MILYON (ANR-10-LABX-0070) of Université de Lyon, within the program “Investissements d’Avenir” (ANR-11-IDEX-0007) operated by the French National Research Agency (ANR). His research is also supported by the ANR projects GAMME (ANR-14-CE25-0004) and AGIRA (ANR-16-CE40-0022).
1. Introduction and main results
1.1. Introduction
Fixed point properties for group actions on metric spaces, e.g. Banach spaces or non-positively curved spaces, are natural rigidity properties that contribute to the understanding of both groups and the spaces on which they act. When considering actions on Banach spaces, the natural actions to consider are affine isometric actions. Given a Banach space , a topological group is said to have property (FX) if every continuous affine isometric action of the group on has a fixed point. In this article, we deal with fixed point properties for countable discrete groups. In this setting, every affine isometric action is automatically continuous.
Property (FX) was introduced by Bader, Furman, Gelander and Monod [2] as a Banach space version of Serre’s property (FH). A topological group has property (FH) if every continuous affine isometric action of the group on a Hilbert space has a fixed point. It is well known that a countable group has property (FH) if and only if it has property (T), which is a rigidity property for groups that was introduced by Kazhdan [23]. A group has property (T) if its trivial representation is isolated in the unitary dual of the group equipped with the Fell topology. Both property (T) and property (FH) have lead to striking results in several areas of mathematics, e.g. group theory, combinatorics, ergodic theory, dynamical systems, measure theory and operator algebras. We refer to [6] for a detailed account of property (T) and property (FH).
Partly because of the aforementioned connections to different areas of mathematics, recent years have seen a growing interest in Banach space versions of both fixed point properties and property (T). Alongside property (FX), as recalled above, Bader, Furman, Gelander and Monod also defined a Banach space version of property (T), which is called property (TX) and is in general weaker than property (FX) (see [2, Theorem 1.3]). Another notable Banach space strengthening of property (T) is strong property (T), which Lafforgue introduced in his work on the Baum-Connes conjecture [27, 28]. He essentially proved that if a group has strong property (T) relative to a Banach space , then the group has property (FX).
The most straightforward non-Hilbertian Banach spaces to consider are -spaces, with . For , a countable group is said to have property (F) if every affine isometric action of the group on an -space has a fixed point. It is known that property (T) implies property (F) for , where may depend on the group (see [2, Theorem 1.3] (and also [16]) for the case and [3, Corollary D] for ). In several cases, there are explicit lower bounds on (see [10, 40, 17]). On the other hand, there are groups with property (T) that are known to fail property (F) for large [42, 12, 48, 15], e.g. cocompact lattices in . However, (lattices in) connected simple higher-rank Lie groups and (lattices in) connected simple higher-rank algebraic groups over non-Archimedean local fields have property (F) for all (see [2, Theorem B] and [3, Corollary D]). Similar results have been established for universal lattices [34].
Bader, Furman, Gelander and Monod conjectured that (lattices in) connected simple higher-rank Lie groups and (lattices in) connected simple higher-rank algebraic groups over non-Archimedean local fields have property (FX) for every superreflexive Banach space [2, Conjecture 1.6]. This conjecture has been proved in the non-Archimedean setting [27, 29], and in the real and complex case, partial results have been obtained [47, 26, 25]. Other results that show fixed point properties by means of an appropriate strengthening of property (T) were obtained by Oppenheim [40]. His examples include certain groups acting on buildings and Kac-Moody-Steinberg groups.
Another effective way of establishing fixed point properties or property (T) for a group is by means of spectral conditions on the links of vertices of certain simplicial complexes on which the group acts. The idea of this method goes back to [19] and was further developed in [43, 49, 50, 4] in order to provide criteria to establish property (T). Nowadays, the most well-known spectral criterion for property (T) may be the one due to Żuk [50], asserting that if is a finitely generated group with finite symmetric generating set (with ) such that the link graph associated with is connected and the smallest non-zero eigenvalue of the Laplacian on is strictly larger than , then has property (T).
In recent years, certain local criteria for fixed point properties for group actions on Banach spaces have been established, by Bourdon [10] for actions on -spaces, and by Nowak [37] and by Oppenheim [39] for actions on reflexive spaces. Oppenheim also explains that the assumption of reflexivity is not needed in his approach, and his proof is elementary.
The use of spectral criteria is particularly beneficial when considering random groups. The framework of random groups provides ways to consider finitely presented groups in which the relators are chosen at random according to some prescribed probability measure on the set of all possible words in the generating set. The theory of random groups goes back to [20], in which Gromov introduced what is now called the Gromov density model (see also [21]), in which the density is a parameter that controls the number of relators. It was proved by Gromov that for , a random group in is infinite and hyperbolic with overwhelming probability (w.o.p.), whereas for , a group in is trivial or w.o.p. [20] (see also [38]). The study of property (T) for random groups was initiated by Żuk [50]. By using his aforementioned criterion, he proved that for , a random group in the triangular density model , which is an adaptation of the Gromov density model that is particularly suitable for the use of the spectral criterion, has property (T) w.o.p. The fact that for , a group in the Gromov density model has property (T) w.o.p., was proved in detail in [24].
Fixed point properties for actions of random groups on -spaces were first considered by Nowak, by applying his spectral criterion mentioned above [37, Section 6]. Moreover, in a recent article, Druţu and Mackay made substantial contributions to the understanding of property (F) in the setting of random groups [17]. The main part of their argument consists of establishing new bounds on the first positive eigenvalue of the -Laplacian on random graphs. By applying Bourdon’s criterion, they obtain fixed point properties of actions of random groups on -spaces. In fact, Druţu and Mackay do not restrict to actions on -spaces, but consider the more general setting of actions on Banach spaces whose finite-dimensional subspaces are -isomorphic to a subspace of an -space, with . Additionally, their results lead to quantitative results on the conformal dimension of the boundary of random groups. We will elaborate more on their results below.
1.2. Statement of the main results
The aim of this article is two-fold. First we establish a criterion for groups that ensures that every affine isometric action of the group on a given uniformly curved Banach space has a fixed point. Uniform curvedness is a property introduced by Pisier (see Section 2.4). Examples of uniformly curved spaces are -spaces with and interpolation spaces between a Hilbert space and an arbitrary Banach space, i.e. strictly -Hilbertian spaces. Uniform curvedness is stable under renorming and finite representability.
Second, we apply our spectral criterion to random groups in the triangular density model, giving the first results on fixed point properties for actions of random groups on Banach spaces that are very different from -spaces. Also, in the setting of -spaces (even in the case ), our results strengthen the known results on fixed point properties of random groups in the triangular density model. We also establish new quantitative results on the conformal dimension of the boundary of random groups.
We only consider complex Banach spaces, but is is straightforward to formulate our results in the setting of real Banach spaces.
In what follows, if is a connected finite (weighted) graph, we denote by the Markov operator of the random walk on (see Section 3 for the definition).
Theorem A**.**
Let be a uniformly curved Banach space. Then there exists an such that the following holds: If is a group that admits a properly discontinuous cocompact action by simplicial automorphisms on a locally finite simplicial -complex such that for all its links , we have , then has property (FX).
Theorem A provides a widely applicable criterion for fixed point properties for finitely presented groups, since such groups naturally act on the Cayley complex associated with the presentation. For general uniformly curved spaces, Theorem A relies on Pisier’s renorming theorem [44], which states that superreflexive spaces can be renormed in such a way that a generalization (see (2)) of the classical variance formula holds for -valued random variables. However, in many concrete examples of spaces , our proof is entirely self-contained and we have explicit estimates for (see Remark 5.2).
Theorem A is a direct analogue of Żuk’s spectral criterion mentioned above, since the condition means that the spectrum of , apart from a simple eigenvalue , is contained in , or equivalently, that the spectrum of the Laplacian on , apart from a simple eigenvalue [math], is contained in . This condition can be viewed as a two-sided spectral gap.
One significant advantage of our spectral criterion is that it is entirely Hilbertian: It only relies on the eigenvalues of the (-)Laplacian, although the conclusion is on fixed point properties on uniformly curved spaces. In fact, as a corollary, we obtain bounds on the first positive eigenvalue of the -Laplacian for other values of , by means of interpolation (see Theorem 3.11).
Theorem A follows from the following more general criterion for fixed point properties that we prove, which is formulated in terms of the norm of the Markov operator acting on vector-valued -spaces.
Theorem B**.**
Let , and let be a superreflexive Banach space. Then there exists an such that the following holds: If is a group that admits a properly discontinuous cocompact action by simplicial automorphisms on a locally finite simplicial -complex such that for all its links , we have , then has property (FX).
In the proof of Theorem B, working with the Markov operator rather than the Laplacian makes a real difference, since one can use interpolation techniques.
The essential part of the proof of Theorem B is to derive a -Poincaré inequality with small constant from the fact that the Markov operator has small norm. From that point, the result follows from the proof of the aforementioned result of Bourdon or from the result of Oppenheim. For completeness, we also present an elementary proof of the fact that Poincaré inequalities give rise to fixed points (see Theorem 4.1). The line of proof is similar to Oppenheim’s proof, and we claim no originality at this point.
As mentioned above, the second aim of this article is to apply our spectral criterion to random groups in the triangular density model. In the general setting of uniformly curved spaces, we obtain the following result.
Theorem C**.**
Let . There is a constant and a sequence of positive real numbers tending to [math] such that the following holds: For every and satisfying
[TABLE]
with probability , a group in has property (FX) for every uniformly curved space satisfying . In particular, the latter is the case when .
In the setting of -spaces, -Hilbertian spaces with or Banach spaces -isomorphic to a subquotient of a -Hilbertian space with , we obtain the following result.
Corollary D**.**
Let . There is a sequence of positive real numbers tending to [math] such that the following holds: For every integer and satisfying
[TABLE]
with probability , a group in has
- (1)
property (F) for every ; 2. (2)
property (FX) for every that is -isomorphic to a subquotient of a -Hilbertian space with .
Equation (1) is an improvement of the results by Druţu and Mackay. Indeed, in [17, Corollary 1.7], an analogous statement was proved for in the range and for independent from , with weaker results for a slightly larger range of (see also [17, Remark 9.5]). Corollary D is even new for (corresponding to property (T)). Indeed, before it was only known that random groups in have property (T) with probability in the regime
[TABLE]
for some constant (see [1]).
Our results on fixed point properties of actions on -spaces naturally lead to new estimates on the conformal dimension. The conformal dimensional of the boundary of a hyperbolic group is a canonically defined quasi-isometry invariant, which was introduced by Pansu [41] (see also [30]). Relying on a result of Bourdon (see [11]), we obtain, along the same lines as Druţu and Mackay, the following strengthening of the lower bound in [17, Theorem 1.11] as an immediate consequence of Corollary D.
Corollary E**.**
Let . There is a sequence of positive real numbers tending to [math] such that the following holds: For every integer and satisfying
[TABLE]
with probability , a group in is hyperbolic and satisfies
[TABLE]
1.3. Relation to other work
In an earlier version of this article, we applied our criterion, i.e. Theorem A, to another model of random groups. Indeed, we followed the approach of [24] and obtained the following result, which is much weaker than Theorem C.
Proposition 1.1**.**
Let be a uniformly curved Banach space. For every density , a random group in the triangular model has property (FX) w.o.p., that is
[TABLE]
The novelty of this result was mainly the fact that we obtained fixed point properties for actions of random groups on Banach spaces very different from -spaces, but in the setting of -spaces, Proposition 1.1 is weaker than the results of [17].
After this earlier version, it was suggested to us by Druţu and Mackay to work with the binomial triangular model for random groups and Erdős-Rényi graphs rather than following the approach of [24]. They expected (see [17, Section 1.4]) that this would give results that are quantitative improvements of their results, which, as explained in Section 1.2, indeed turns out to be the case.
In [17], Druţu and Mackay also obtained results for random groups in the Gromov density model and for the critical density . We expect that our results can be transferred to these settings as well.
1.4. Organization of the article
The article is organized as follows. Section 2 covers some preliminaries on the geometry of Banach spaces. In Section 3, we explain how small Markov operators give rise to Poincaré inequalities. This section also includes some new results that may be of independent interest. In particular, we prove some bounds on the eigenvalues of -Laplacians. In Section 4, we explain how Poincaré inequalities give rise to fixed points. Theorem B and Theorem A are proved in Section 5. In order to prove Theorem C, we first establish some new results on the spectrum and degree distribution of Erdős-Rényi graphs in Section 6. These may be of independent interest. Fixed point properties for random groups are investigated in Section 7. In particular, Theorem C and Corollary D are proved in that section.
Acknowledgements
We are indebted to Cornelia Druţu and John Mackay for their suggestion to work in the binomial triangular model and with Erdős-Rényi graphs (as described above). We also thank them for interesting discussions.
We thank Marc Bourdon and Gilles Pisier for useful comments on an earlier version of this article.
2. Preliminaries on Banach spaces
2.1. Superreflexivity and uniform convexity
Two Banach spaces and are called -isomorphic if there exists an isomorphism such that . The Banach-Mazur distance between and is defined as the infimum of such , where the infimum is taken over all linear isomorphisms between and .
A Banach space is said to be finitely representable in a Banach space if for every finite-dimensional subspace of and every , there exists a subspace of such that , where is the Banach–Mazur distance. A Banach space is called superreflexive if every Banach space that is finitely representable in is reflexive. Equivalently, a Banach space is superreflexive if and only if all its ultrapowers are reflexive.
A Banach space is uniformly convex if
[TABLE]
for all . The function is called the modulus of convexity of .
Every uniformly convex Banach space is superreflexive, and every superreflexive Banach space admits an equivalent uniformly convex norm [18].
Let . A Banach space is called -uniformly convex if there exists a such that for all . Equivalently [44, Proposition 2.4] (see also [33, Lemma 6.5]), is -uniformly convex if there exists a constant such that for every -valued random variable ,
[TABLE]
It is in the form of (2) that we will use -uniform convexity. This inequality provides quantitative estimates on the error term in Jensen’s inequality . It can be seen as a generalization of the classical variance equality for Hilbert space-valued random variables:
[TABLE]
By a famous theorem of Pisier [44], every uniformly convex Banach space has an equivalent norm with respect to which it is -uniformly convex for some .
It is well known that if is an -space with or, more generally, a strictly -Hilbertian space with (see Section 2.3), then is -uniformly convex. In the case of strictly -Hilbertian spaces, (2) holds with (Proposition 2.1).
2.2. Complex interpolation
We refer to [8] and [46] for details on complex interpolation for compatible couples of (complex) Banach spaces. We recall that a compatible couple of Banach spaces is a pair of Banach spaces together with continuous linear embeddings from and into the same topological vector space , which can always be assumed to be a Banach space. Complex interpolation is a way to assign to such a couple a family of Banach spaces (subspaces of ) that interpolate between and . For example, if is a measure space and (seen as subspaces of the topological vector space of all measurable maps from to ), then is the space , where . More generally, if is a compatible couple, then the complex interpolation space of parameter for the couple is . A fundamental property of complex interpolation is Stein’s interpolation theorem, which roughly says the following: If and are compatible couples and if there is a holomorphic family of linear operators , with , such that for all with , we have , then for all with , where .
2.3. -Hilbertian spaces
A strictly -Hilbertian space is a Banach space that can be written as an interpolation space , where is a Hilbert space and (see [45]). -spaces are clearly strictly -Hilbertian: If is an -space with , then , where , and .
In the setting of strictly -Hilbertian spaces, we can derive (2) with an explicit constant .
Proposition 2.1**.**
If is isometric to a subquotient of a strictly -Hilbertian space, then (2) holds with .
Proof.
If is a subquotient of , then the best constant in (2) is smaller for than for . Therefore, it is sufficient to consider the case when is strictly -Hilbertian. Consider a complex interpolation space between a Hilbert space and an arbitrary Banach space , continuously embedded into the same Banach space . Fix a probability space , and consider the holomorphic family . If , then we have , and for , we have . By the results recalled in Section 2.2, the complex interpolation space of parameter between and (respectively and ) is (respectively ), where . By Stein’s interpolation theorem, we have . This is exactly (2) with constant . ∎
More generally, one can consider the class of -Hilbertian spaces, as introduced by Pisier in [46], which is a natural class of Banach spaces that includes the strictly -Hilbertian spaces, but also certain interpolation spaces between compatible families (rather than couples) of Banach spaces as well as there ultraproducts. Every result that we mention for strictly -Hilbertian spaces can be extended to the class of -Hilbertian spaces by considering complex interpolation for families of Banach spaces.
2.4. Uniform curvedness
The notion of uniformly curved Banach space was introduced by Pisier in [46]. Let be a Banach space, and let an operator. If extends to a bounded operator from to , then we denote by its norm. Otherwise, we set . For a Banach space , we set , where the supremum is taken over all measure spaces and and operators satisfying , and .
Definition 2.2**.**
A Banach space is uniformly curved if when .
Pisier proved that uniformly curved spaces are superreflexive [46], and hence, by the results recalled in Section 2.1, every uniformly curved space has an equivalent -uniformly convex norm for some . Pisier also showed that the Banach spaces for which for some are exactly the spaces that are isomorphic to a subquotient of a -Hilbertian space for some .
3. Graphs, eigenvalues and Poincaré inequalities
3.1. -Poincaré inequalities
In this article, we consider unoriented connected graphs, potentially weighted. Thus, a graph is a pair , where is a set (the vertices) and is a function (the weight function) such that for every . A finite graph is a graph for which is finite. Unweighted graphs correspond to the case when takes values in , in which case is the indicator function of the edge set. The degree of a vertex in a graph is defined as the number .
Let be a finite graph. Equip with the probability measure and with the probability measure . Note that is the stationary probability measure for the random walk on with transition probability . It is also the pushforward measure of under both maps and .
The gradient of a function is defined by if .
Definition 3.1**.**
Let be a connected finite graph, and let . For a Banach space , we denote by the smallest real number such that for all , the inequality
[TABLE]
holds. We call the -valued -Poincaré constant of .
Let be the random walk on with (and hence for all ) distributed as . In this setting, the -valued -Poincaré constant of is the smallest real number such that for all , the following inequality holds:
[TABLE]
Remark 3.2**.**
The validity of the above inequality for every with can be used to define the -valued -Poincaré constant of an arbitrary irreducible Markov chain on a set with -finite stationary measure . In the case when the measure is infinite (the terminology is that the Markov chain is not positively recurrent), the definition of -Poincaré constant becomes simpler: It is the smallest such that for every ,
[TABLE]
All results in this section hold in this generality, except for the interpretation in terms of the eigenvalues of (-)Laplacians, where one needs reversibility of the Markov chain. The only adaptation in the proof of Theorem 3.4 when is infinite is that in that case, is replaced by .
Let us point out that our -Poincaré constant differs (by a factor or power) from the -Poincaré constants in [10] and [37], neither does it exactly coincide with the conventions of [33].
Let be a connected finite graph with . We denote by (or simply if no confusion should arise) the Markov operator of the random walk on , which acts on functions on by the formula
[TABLE]
The operator is self-adjoint on . Indeed for , we have
[TABLE]
We denote by the norm of the restriction of to the orthogonal complement of the constant functions in . We denote the eigenvalues of by . The largest eigenvalue is .
The (normalized) Laplacian on is the operator , which maps a function to
[TABLE]
The following result summarizes some elementary properties of the -Poincaré constant.
Proposition 3.3**.**
For every connected finite graph and ,
- (i)
for every if has at least two vertices, 2. (ii)
, 3. (iii)
is equal to .
Proof.
We always have by the triangle inequality, and therefore if has at least two vertices. Assertion (ii) follows from Fubini’s theorem. Assertion (iii) is classical and follows from the equality , which holds for all . ∎
For , the constant is related to the eigenvalues of the -Laplacian (see Section 3.4).
3.2. From small Markov operators to Poincaré inequalities
The validity of a -Poincaré inequality is a very robust property (see [35, 36]). Indeed, it is obvious that if a Banach space is at Banach-Mazur distance from another Banach space , then . Also, the -Poincaré inequality implies the validity of a -Poincaré inequality for all (see Section 3.3).
For applications to fixed point properties, the crucial point is to prove that . The aforementioned fact is therefore not useful, because the property “” is not robust. The next result, which is one of the main points in this article, expresses that the property “” is a consequence of another property, which is actually very robust.
In what follows, .
Theorem 3.4**.**
Let be a -uniformly convex Banach space. Then there exist (depending on ) such that for every connected finite graph the following holds: If , then for every , we have
[TABLE]
In particular, .
In the random walk notation, we have to prove that
[TABLE]
for every with .
The proof is divided in several steps. The first one is standard.
Lemma 3.5**.**
For every , we have .
Proof.
If has norm , then has norm . ∎
The triangle inequality implies, without any condition on , that , and hence . This is, however, not strong enough. The next lemma improves this inequality.
Recall that since is -uniformly convex, there exists a constant such that (2) holds for every -valued random variable .
Lemma 3.6**.**
For every , we have
[TABLE]
Proof.
Let be the -valued random variable . With this notation we have and . So applying (2) conditionally to and then averaging with respect to proves the lemma. ∎
Proof of Theorem 3.4.
By the triangle inequality and the fact that is distributed as , we have
[TABLE]
Taking into account the two lemmas above, we obtain
[TABLE]
from which we deduce
[TABLE]
If is small enough, so that , then the theorem follows for . ∎
Remark 3.7**.**
If is an -space for some (or more generally a subquotient of a -Hilbertian space with ), then it follows from Proposition 2.1 and from the proof above that in that case, Theorem 3.4 holds when ; for instance, as soon as .
Remark 3.8**.**
Consider a bipartite connected finite graph . This means that can be partitioned as in such a way that every edge connects to . Equivalently, is an eigenvalue of . In particular, , so Theorem 3.4 does not say anything about . This is not an accident: If is the complete bipartite graph with vertices, in which both parts of the partition consist of vertices (so that has spectrum ), it was shown in [17, Proposition 11.6] that for all large enough if . However, an easy adaptation of our proof yields (with the same and ): If for every that has zero mean on and on , then for every such , we have
[TABLE]
In particular, if is defined as the smallest constant such that the inequality
[TABLE]
holds, then we have .
3.3. Matoušek’s extrapolation result
In this section, we elaborate on the robustness of the validity of Banach space valued -Poincaré inequalities, as indicated at the beginning of Section 3.2. By an argument of Matoušek [31] (see also [5, Lemma 5.5]), the classical -Poincaré inequality implies the validity of a -Poincaré inequality for all , with a multiplicative loss () on the Poincaré constant. The following proposition provides a Banach space valued generalization of this result, which is essentially due to Cheng [13] (see [36, 35] for related results). We state and prove a slightly different version of this result, which in particular does not depend on the maximal degree of the graph. This section is independent from and not needed in the rest of this article.
Proposition 3.9**.**
For every , there is a constant such that for every Banach space and every graph ,
[TABLE]
Proof.
The proof is an adaptation of the original argument by Matoušek. Suppose that a graph has -valued -Poincaré constant equal to . For and , we set if and . The map defined by is a version of the classical Mazur map for vector-valued -spaces. The next lemma shows that it has the same regularity properties as in the classical case .
Lemma 3.10**.**
For every , there exists a constant such that
[TABLE]
for every measure space , every Banach space and every two functions and in the unit ball of .
Proof.
For -valued functions the lemma is classical (see [32]). In particular, there exists a (depending on and ) such that for all with , we have
[TABLE]
Let be in the unit ball of , and define in (the unit ball of) by . Let . We write with and in the unit sphere of , so that . By the triangle inequality, we have , and
[TABLE]
Writing , we obtain
[TABLE]
The first term is less than by (4). We can view the second term as the norm of in . If , then this norm is less than the norm of in , i.e. less than . If , then by Hölder’s inequality this norm is less than the geometric mean of its norm in and its norm is , i.e. less than . The previous inequality therefore becomes
[TABLE]
This proves the lemma, because was defined as . ∎
Proof of Proposition 3.9 (continuation). Let . We have to prove that
[TABLE]
By homogeneity, we may assume that , and by replacing by for a suitable , we may assume that .
Let . It has norm in . By the previous lemma, we have
[TABLE]
In particular, there is a constant (depending on ) such that . By definition of , we have
[TABLE]
By the previous lemma, we obtain
[TABLE]
or equivalently,
[TABLE]
This concludes the proof of the result. ∎
3.4. Eigenvalues of the -Laplacian
For and , we write if and we extend the definition by continuity to .
Let be a connected finite graph, and let be the measure on defined at the beginning of this section. If , then the -Laplacian on is the non-linear map defined by
[TABLE]
where denotes the degree of a vertex .
In our opinion, it would be more natural to define the -Laplacian by , but we use the conventional definition here.
A scalar is called an eigenvalue of if there exists an such that . Bourdon proved [10, Lemme 1.3] that the eigenvalues of coincide with the critical values of . In [10, Proposition 1.2], he proved that the smallest nonzero eigenvalue of is related to the smallest constant for which the inequality
[TABLE]
holds, by the formula . Hence, the crucial inequality corresponds to the inequality .
In the case of , we can reformulate Theorem 3.4 in order to obtain spectral information on the -Laplacian.
Theorem 3.11**.**
Let be a connected finite graph, and let . If the spectrum of is contained in for some , then
[TABLE]
In particular, if .
Proof.
The assumption that the spectrum of is contained in means that has norm as an operator on , or equivalently, that the operator has norm as an operator on , where is the projection onto the constant functions. Since has norm as an operator on , by interpolation, this implies that has norm as an operator on . In particular, has norm on . By Theorem 3.4 and Remark 3.7, we obtain that for every ,
[TABLE]
This implies that the Poincaré inequality holds with constant . The proposition follows from the relationship between the Poincaré constant and alluded to above. ∎
4. From Poincaré inequalities to fixed point properties
Recall that if is a simplicial -complex and , then the link is the graph with vertex set the set of -simplices in containing and is the number of -simplices in having and as two of its faces. In the following, we give, as mentioned in the introduction, a direct proof of the fact that Poincaré inequalities give rise to fixed points. The approach is similar to the one of Oppenheim [39] and we claim no originality. We have chosen to leave out some computations.
Theorem 4.1**.**
Let , let be a Banach space, and let be a connected and locally finite simplicial -complex. Suppose that for every . If is a group that admits a properly discontinuous cocompact action by simplicial automorphisms on , then has property (FX).
Proof.
Suppose that is a group action by simplicial automorphisms that is properly discontinuous and cocompact. Let denote a set of representatives of the -orbits in , and for a vertex , let denote the stabilizer of . Then is a finite set (resp. is a finite group), because the action is cocompact (resp. properly discontinuous).
For , we set . Let be the affine space of -equivariant maps , which is naturally identified with and is, in particular, nonempty.
Lemma 4.2**.**
For and , we have
[TABLE]
We denote this quantity by , or simply by when . Moreover, we have the inequality
[TABLE]
Proof of Lemma 4.2.
If , then (5) is exactly [10, Lemma 4.1]. For , the same computation proves the equality. For (6), we decompose the function as . By the triangle inequality, we obtain
[TABLE]
This is (6), because . ∎
Proof of Theorem 4.1 (continuation). We now define a complete distance on by
[TABLE]
Take such that for every , and let . By definition of , for every , there is a such that
[TABLE]
Moreover, by the -equivariance of , the quantity is unchanged if is replaced by an element of the -orbit of . Therefore, by replacing by the average on its -orbit, we can assume that is -invariant. This means that , defined so far only on , can be extended to an element of . Summing the -th power of the previous expression over , yields . By (6), this implies .
On the other hand, using the triangle inequality, we obtain that for ,
[TABLE]
where denotes the norm on . It follows that
[TABLE]
The conclusion of the preceding discussion is that for every , there is a (namely ) such that and . If we start from some , by induction we obtain a sequence in with and . The sequence is a Cauchy sequence and therefore converges to some satisfying . For a general complex , the formula means that is constant on the connected components of for every . Here the assumption that implies that is connected, and hence the assumption that is connected implies that is constant and is necessarily equal to a fixed point. This proves the theorem. ∎
Remark 4.3**.**
As pointed out in [17, Proposition 11.6], for bipartite graphs and large , the condition is in general not satisfied, even not for the complete bipartite graphs. As a consequence, Theorem 4.1 is not applicable when has a link that is bipartite.
Question 4.4**.**
Does Theorem 4.1 hold if the assumption is replaced by when is bipartite?
By Remark 3.8 and the argument in the following section, a positive answer to this question would imply that Theorem A holds when, for bipartite links , the assumption is replaced by “ does not intersect the spectrum of ”. This would in particular improve the results of [17] and imply that for every , random groups in the Gromov density model with densities have property (F) with probability tending to .
5. Proofs of Theorem B and Theorem A
If is -uniformly convex, then Theorem B is a direct combination of Theorem 3.4 and Theorem 4.1. Moreover, if is an -space with (or more generally a subquotient of a -Hilbertian space with ), then we see from Remark 3.7 that Theorem B holds with .
We now prove the general case of Theorem B. The idea of the proof is to reduce to the case of -uniformly convex Banach spaces.
Proof of Theorem B.
Let , and let be a superreflexive Banach space. As was recalled in Section 2, by a famous result of Pisier [44], there exists a and an equivalent norm on that is -uniformly convex. Pisier’s proof has the feature that every isometry of remains an isometry of , but even if this were not the case, we could always assume this by replacing by the equivalent norm (see the proof of in [2, Proposition 2.3]). Denote the Banach space by . We now use the following interpolation result, which was already used in a similar context in [46].
Lemma 5.1**.**
There exists a constant and a such that for every graph , we have
[TABLE]
Proof.
Let and such that . The operator has norm less than on , since this operator is the composition of the operator with norm at most with the restriction of to . Therefore, by interpolation we have
[TABLE]
which we simply bound by . The conclusion now follows, because is less than the product of and the Banach-Mazur distance between and . ∎
Proof of Theorem B (continuation). Since is -uniformly convex, by the case already proved, there exists an such that a group with a properly discontinuous cocompact action by simplicial automorphisms on a simplicial -complex with all its links satisfying has property (FY). Therefore, if satisfies , then every such group has property (FY). In particular it has property (FX) because by construction every action by affine isometries on is an action by affine isometries on . ∎
Finally, we explain how Theorem A follows from Theorem B.
Proof of Theorem A.
Let be a uniformly curved Banach space. As recalled in Section 2.4, the space is superreflexive. Let be given by Theorem B for . We claim that for a finite graph , we have the inequality
[TABLE]
Indeed, let be the operator . Then has norm on and and norm on , so by definition of , we have . We obtain (7) by considering the restriction to . Since is uniformly curved, there is an such that . It follows from (7) that Theorem A follows for this value of . ∎
Remark 5.2**.**
In many cases, we can give a direct proof of Theorem A (not relying on [44]) and compute the constants explicitly.
- (i)
If is an -space with , then Theorem A holds with . 2. (ii)
If is stricly -Hilbertian, or more generally a subquotient of a stricly -Hilbertian space, then Theorem A also holds with . 3. (iii)
If is isomorphic to a space as in (i) or (ii), with Banach-Mazur distance , then Theorem A holds with , where is a universal constant.
Proof.
As above, we consider the operator . If is a Hilbert space and , then its norm on is equal to (say by decomposing in an orthonormal basis), whereas for and arbitrary, we have the trivial bound . So if and is an -space (or more generally a strictly -Hilbertian space), then interpolation directly gives the inequality
[TABLE]
for every graph . So, by Remark 3.7, we obtain that Theorem A holds as soon as , i.e. as soon as . The same argument works if is a subquotient of a stricly -Hilbertian space. The additional argument is to observe that the quantity can only decrease when is replaced by a subquotient of .
Finally, consider the case when is at Banach-Mazur distance from a subquotient of a strictly -Hilbertian space . First, suppose that (2) holds for with . Second, we will reduce to this case. By the above proof for , for every finite graph , we have , and therefore,
[TABLE]
Hence, by the proof of Theorem 3.4, we have that as soon as with . Elementary computations show that this holds as soon as , where is a universal constant.
To conclude the proof, we explain how we can reduce to the case in which (2) holds for with . We identify and in such a way that the norms and satisfy for all . Denote by the group of linear isometries of and define the norm , so that for all . By construction, every action by affine isometries on is an action by isometries on . We have to prove that for (2) holds with . This follows from Proposition 2.1, which asserts that (2) holds for with . Indeed, if is an -valued random variable, then for every we can apply (2) to the random variable and obtain
[TABLE]
In particular, by the inequality , we obtain
[TABLE]
By taking the supremum over we obtain
[TABLE]
which finishes the proof. ∎
6. Erdős-Rényi graphs: spectrum and degree distribution
In this section, we collect and establish some results on the spectrum and degree distribution of Erdős-Rényi graphs, which will be used in Section 7.
For future reference, we first recall a form of Chernoff’s inequality (see for example the first pages of [9]), which provides standard concentration bounds for binomial random variables. If is a binomial random variable (meaning that takes integer values with probability , then for every positive , we have
[TABLE]
6.1. Erdős-Rényi graphs
If is a positive integer and , an Erdős-Rényi graph is a random graph with vertices in which each unoriented edge with occurs independently with probability .
It is well known (see e.g. [9]) that the connectivity threshold occurs at : For every , the probability that is connected is if and if .
We will need a lemma stating that, above the connectivity threshold, all vertices have degree of the same order.
Lemma 6.1**.**
Let . There are constants and a sequence of positive real numbers tending to [math] such that the following holds: For every , with probability , the degree of every vertex in an Erdős-Rényi graph is in the interval .
Proof.
The degree of every vertex in is a binomial random variable. For , the lemma is a straightforward application of Chernoff’s inequalities (8) and (9), say with and . For , the lemma follows for example from [9, Exercise 3.4], which provides the optimal values for and . We could not find a solution to this exercise in the literature, so for the reader’s convenience, we provide a proof of the only nontrivial inequality, i.e. the lower bound (the upper bound for is also a direct application of Chernoff’s inequality (9)).
Suppose that . Let be a constant to be determined later. We have
[TABLE]
by bounding . For small enough, we have that , so the whole sum is less than twice the last term. But if is the integer part of , we have
[TABLE]
[TABLE]
and
[TABLE]
So
[TABLE]
In particular, if is small enough so that , we obtain
[TABLE]
for all large enough and
[TABLE]
By a union bound we obtain
[TABLE]
This proves the lemma. ∎
By [9, Exercise 3.4], it is easy to see that the previous lemma is essentially optimal, in the sense that for every and , the ratio maximal degree/minimal degree converges to a constant as , and that . We shall need, however, that in -average, the degree sequence is well concentrated. This is the content of the next lemma.
Lemma 6.2**.**
There is a constant such that the following holds. Let be the degree sequence of an Erdős-Rényi graph , and let . If , then
[TABLE]
and
[TABLE]
Proof.
We will prove both equalities for sufficiently large, i.e. we will prove that there exists a and an such that for all , the inequalities above hold. By the monotonicity properties of both inequalities, the inequalities then follow for all , possibly after replacing by a larger constant.
Let us first prove the first inequality, the proof of which is similar to the proof of Chernoff’s inequality: We obtain tight concentration bounds from exponential moments. First, note that there exists an such that for all . It follows that for every and , whenever is a random variable equal to with probability and [math] with probability , then
[TABLE]
As a consequence, if is a binomial random variable , then
[TABLE]
Write , where is the number of edges between and a vertex , and is the number of edges between and a vertex . In this way, the random variables are independent, and so are the random variables . Write and .
By (10), it follows that for , we have
[TABLE]
and by independence, we have
[TABLE]
Fix . Using (the exponential version of) Chebyshev’s inequality, we deduce that for every ,
[TABLE]
Taking (which is indeed in if , because we assumed that ), we obtain
[TABLE]
Since the random variables and are identically distributed, we have the same inequality for . Hence, taking into account that , we obtain
[TABLE]
for every . The first inequality of the lemma follows.
The second inequality is a direct consequence of the first one. Indeed, by the triangle inequality, we have
[TABLE]
and therefore,
[TABLE]
Let be the event where , so that by the first inequality (which we have just proved), we have . On , we have
[TABLE]
which is greater than for . So by (11), we obtain
[TABLE]
on if . This proves the second inequality for with replaced by . ∎
We will also need that, above the connectivity threshold, Erdős-Rényi graphs have a good two-sided spectral gap.
Theorem 6.3** ([22]).**
Let . There are constants and a sequence of positive real numbers tending to [math] such that for every , with probability , an Erdős-Rényi graph satisfies .
Proof.
This result was announded in [22] (see [14] for the statement when is sufficiently large). Formally, the result in [22] deals with the giant component, but in the regime , which we are interested in, an Erdős-Rényi graph is connected with high probability. The theorem also follows by combining Lemma 6.1 and Theorem 3.2 in [7]. Indeed the results in [7] deal with the unnormalized adjacency matrix, which is unitarily conjugate to , where is the Markov operator and the matrix with diagonal entries equal to the degrees. ∎
6.2. Spectral gap and union of graphs
We end this section by two results that indicate how a two-sided spectral gap behaves when one takes the union of two (non-random) graphs on the same vertex set.
For a weight , let denote the space of square-integrable functions on equipped with the inner product given by
[TABLE]
(Note that this is different from Section 3, in which we considered -functions with respect to a stationary measure .)
In the situation of Lemma 6.4 and Proposition 6.5, define and by the formal identities and . For all , we have
[TABLE]
so that .
The first lemma deals with the situation when one of the graphs is a small pertubation of the other. We could not locate this precise statement in the literature, but the argument is completely standard (see [24, Lemma 4.5], [1, Lemma 1.7] or [17, Lemma 9.2]).
Lemma 6.4**.**
Let be a finite set, let be two weight functions, and let be the corresponding degree functions. As before, let denote the restriction of to .
If for some , then
[TABLE]
Proof.
Suppose that . Using the standard min-max formulas for the eigenvalues of a self-adjoint matrix, and using that (and similar for ), we obtain
[TABLE]
which is just a sharper version of (14). ∎
The second result deals with the situation where the degree sequence in each graph is well concentrated in -average. When the degree sequence is uniformly () concentrated, such a result is well-known (see [24, 1, 17]), but we will be in the situation where the degree sequence is not -concentrated, and we need the following strong result. To our knowledge, this result is new, and it is the main result of this section.
Proposition 6.5**.**
Let be a finite set, let be two weight functions, and let be the corresponding degree functions. As before, let denote the restriction of to .
Also, let be the total degree for , and let
[TABLE]
Then
[TABLE]
Proof.
Denote by (with ) the eigenvalues of , so that . We will prove that
[TABLE]
for every of norm one, which directly implies the proposition. The first inequality is obvious by (12). For the second one, write where is the orthogonal projection of onto the constant functions in . We have
[TABLE]
and similarly for . By (13), we obtain
[TABLE]
Using that
[TABLE]
and writing , we obtain
[TABLE]
So the lemma will be proved once we show that . Actually, we will show that
[TABLE]
and
[TABLE]
By symmetry, it suffices to show (15). By definition, is the orthogonal projection onto the constant functions in , so it is the constant function equal to , which we write as the scalar product, in , of with the function . Using the fact that is orthogonal to the constant functions (in ), this scalar product is equal to the scalar product of with
[TABLE]
By the Cauchy-Schwarz inequality in , we obtain
[TABLE]
Using the following estimate:
[TABLE]
we obtain
[TABLE]
By the triangle inequality, we have
[TABLE]
where (as before). Finally, summing over yields
[TABLE]
Since
[TABLE]
we obtain (15), which concludes the proof of the lemma. ∎
7. Fixed point properties for random groups
In this section, we apply our spectral criterion (Theorem A) to random groups in the triangular model. In particular, we will prove Theorem C and Corollary D.
Let . Roughly speaking, a random group generated by is a group given by a representation , where is a set of relators, i.e. words in , that are chosen randomly with respect to some probability measure. In what follows, we only consider relators that are cyclically reduced, i.e. relators of the form with for and . The number of cyclically reduced words of length is .
The triangular density model was introduced by Żuk in [50]. For a fixed density , a group in the model is a group , where and is a set of relators, chosen uniformly among all subsets of cardinality (rounded to the nearest integer) of the set of cyclically reduced relators of length . A property for groups is said to hold with overwhelming probability (w.o.p.) in the triangular density model if
[TABLE]
In the proofs below, we will use the following – to our purposes more convenient – version of the triangular model, which was also used by Druţu and Mackay [17].
Definition 7.1**.**
For natural numbers and with , a group in the triangular model is a group , where and is a random set of relators, chosen uniformly among all subsets of cardinality of the set of cyclically reduced relators of length .
A closely related model is the binomial triangular model (see [1]).
Definition 7.2**.**
For , a group in the binomial triangular model is a group , where and is a random set of relators, where each cyclically reduced relator of length is chosen independently with probability .
A property for groups is said to hold with overwhelming probability (w.o.p.) in the binomial triangular model if
[TABLE]
In the model , each relator appears with probability , so the models and are closely related when and are related through .
In order to prove structural properties in the binomial triangular model, one can typically rely on results on Erdős-Rényi graphs. In particular, we will heavily rely on the results that we proved in Section 6.
We prove the following result for fixed point properties of actions of random groups in the binomial triangular model, and then we explain how it implies Theorem C.
Theorem 7.3**.**
Let . There is a constant and a sequence of positive real numbers tending to [math] such that the following holds: Let and . If , then, with probability , a group in has property (FX) for every uniformly curved Banach space satisfying . In particular, the latter is the case when .
By the relationship between the models and (see [17, Section 10]) this theorem immediately implies the following result.
Corollary 7.4**.**
Let . There is a constant and a sequence of positive real numbers tending to [math] such that the following holds: Let and . With probability , a group in has property (FX) for every uniformly curved Banach space satisfying . In particular, the latter is the case when .
Proof.
If , then there exists an such that the condition implies . ∎
We can now prove Theorem C.
Proof of Theorem C.
The proof is a direct application of Corollary 7.4. Indeed, let satisfy (1) for some , i.e.
[TABLE]
It follows that there is an such that for all sufficiently large, we have
[TABLE]
which implies the result. ∎
We deduce Corollary D.
Proof of Corollary D.
This is a direct application of Theorem C, since for every , for all sufficiently large, we have the following:
- •
The condition implies .
- •
For every real , the condition implies
[TABLE]
In particular using the explicit estimates for in Remark 5.2, we obtain the following:
- •
The condition implies .
- •
For every and every Banach space which is -isomorphic to a subquotient to a -Hilbertian space, the condition implies .
∎
Let us now prove Theorem 7.3. For every triangular presentation , i.e. a presentation in which every relator has length , the associated Cayley complex is a simplicial complex, in which the links are all isomorphic to the graph decribed as follows. The graph has vertex set and edges , and whenever . Note that the edges come in three types, corresponding to the order in which the generators , and occur in the relation . This order yields a decomposition of into three graphs , and , where has the same vertices as , but only the edges corresponding to the appropriate place in the relation. Since such links often have multiple edges, we will work in the setting of weighted graphs.
When , is finite with overwhelming probability [50], and in particular Theorem 7.3 holds for trivial reasons. For Theorem 7.3 is an immediate consequence of Theorem A and of the following result.
Proposition 7.5**.**
Let . There is a constant and a sequence tending to [math] such that the following holds: Let and . If , then the link of a group presentation in satisfies
[TABLE]
with probability at least .
The proof of Proposition 7.5 partly follows the strategy of [1]. However, we need some adaptations because we want to deal with a more general range of where the degree sequence in the links is not well concentrated (see Lemma 6.4), and we aim for a stronger conclusion.
Proof.
It is explained in [1] that each (as defined above) is essentially an Erdős-Rényi graph with .
Let us recall how the reduction to the Erdős-Rényi model works. It follows from the definition that each is a graph with vertex set , in which the weights (for a set of vertices of cardinality ) are independent and with binomial distribution if and otherwise. Of course, the weights , and are not independent.
Let be the graph obtained from by adding, independently, to every edge of the form with a binomial , so that the weights are independent and identically distributed binomial random variables . The total number of edges that are added in this way to each vertex is a sum of independent binomial variables. Hence, it is a random variable. Since the probability that a binomial is strictly greater than is less than , we have that with probability , to each we have added at most edges.
Let be the graph obtained from by replacing all multiple edges by simple edges, i.e. by replacing by . The graph is an Erdős-Rényi graph , where , and for sufficiently large. We make the following claims:
- (i)
satisfies the conclusion of the proposition for a certain constant . 2. (ii)
There is a constant such that with high probability, we have for every . 3. (iii)
There exists a constant such that with probability , we have .
These claims imply the proposition, possibly by replacing the constants. Indeed, by (ii) and (iii) we see that, with high probability, is obtained from by adding and then removing edges in a way that changes the degree of every vertex by a factor in . Lemma 6.4 therefore implies that, with high probability,
[TABLE]
By (i) we obtain the conclusion.
Let us prove the claims.
(i): It follows from Theorem 6.3 that there is a constant such that if , then a graph in satisfies with high probability. Here we have and , so we get that, with high probability, . One concludes by Lemma 6.2 and Proposition 6.5.
(iii): Denote by the random variable equal to if and equal to [math] otherwise. These are independent and identically distributed Bernoulli variables with expectation . Since the probability that is strictly greater than is , we obtain that with probability , we have , i.e. . So it is enough to prove that
[TABLE]
with probability . But for each , is a binomial random variable with expectation . Moreover by the assumption that , , so (16) follows from the standard concentration phenomenon for binomial random variables. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] S. Antoniuk, T. Łuczak and J. Świątkowski. Random triangular groups at density 1/3. Compos. Math. , 151(1):167–178, 2015.
- 2[2] U. Bader, A. Furman, T. Gelander and N. Monod. Property (T) and rigidity for actions on Banach spaces. Acta Math. , 198(1):57–105, 2007.
- 3[3] U. Bader, T. Gelander and N. Monod. A fixed point theorem for L 1 superscript 𝐿 1 L^{1} spaces. Invent. Math. , 189(1):143–148, 2012.
- 4[4] W. Ballmann and J. Świątkowski. On L 2 superscript 𝐿 2 L^{2} -cohomology and property (T) for automorphism groups of polyhedral cell complexes. Geom. Funct. Anal. , 7(4):615–645, 1997.
- 5[5] Y. Bartal, N. Linial, M. Mendel and A. Naor. On metric Ramsey-type phenomena. Ann. of Math. (2) , 162(2):643–709, 2005.
- 6[6] B. Bekka, P. de la Harpe and A. Valette. Kazhdan’s Property (T) . Cambridge University Press, Cambridge, 2008.
- 7[7] F. Benaych-Georges, C. Bordenave and A. Knowles. Spectral radii of sparse random matrices. Preprint (2017), ar Xiv:1704.02945.
- 8[8] J. Bergh and J. Löfström. Interpolation Spaces. An Introduction . Springer-Verlag, Berlin, 1976.
