Spatio–Spectral Limiting on Replacements of Tori by Cubes

: A class of graphs is deﬁned in which each vertex of a discrete torus is replaced by a Boolean hypercube in such a way that vertices in a ﬁxed subset of each replacement cube are adjacent to corresponding vertices of a neighboring replacement cube. Bases of eigenvectors of the Laplacians of the resulting graphs are described in a manner suitable for quantifying the concentration of a low-spectrum vertex function on a single vertex replacement. Functions that optimize this concentration on these graphs can be regarded as analogues of Slepian prolate functions that optimize concentration of a bandlimited signal on an interval in the classical setting of the real line. Comparison to the case of a simple discrete cycle shows that replacement allows for higher concentration.


Introduction
Spatio-spectral limiting refers to the composition of a spatial cutoff, meaning multiplication by the characteristic function of a set, with a spectral cutoff, meaning projection onto the span of eigenfunctions indexed by a subset of eigenvalues.In the classical case of the real line this is known as time and band limiting or duration-bandwidth limiting and arises in applications such as super-resolution [1,2], channel estimation [3] and spectrum estimation [4] among others (see, e.g., [5]).In this setting, it is known that the number of eigenvalues of the so-called time and band limiting operator close to 1 is essentially the time-bandwidth product (the product of the lengths of the time localization interval and of the frequency localization band).No clear analogue of this fact has been established in R n , where geometry is more complicated (e.g., [6]).
More recently, some authors have taken up the study of spatio-spectral limiting on graphs, addressing the behavior of operators that first multiply a vertex function by the characteristic function of a specific set of vertices, then project onto some part of the spectrum defined in terms of the graph Laplacian.This has been studied both for specific types of graphs [7] as well as in relation to graph signal processing more generally (e.g., [8][9][10][11][12]).In [9], a connection is made between spatio-spectral limiting and clustering.However, none of these works provide concrete methods to predict the number of independent low-spectrum graph signals that can have a specified fraction of their energies localized on a particular set of nodes-the analogue in this setting of the number of eigenvalues of time and band limiting that are close to 1 [13], or larger than 1/2 [14]-a hallmark of the classical theory [15].
The primary purpose of this work is to study a specific family of graphs for which addressing this question about counting independent spatially concentrated and lowspectrum limited modes is possible, but not simply by referring to the finite version of the one-dimensional theory of time and band limiting [16].The graphs under consideration capture locally high-dimensional behavior on the one hand and globally cyclical structure on the other, and they can be viewed as (very symmetric) models for networks that contain highly connected clusters in which a fraction of vertices are connected to other clusters.In such settings, it is of interest to quantify the extent to which low-spectrum vertex functions in the span of Laplacian eigenvectors having small eigenvalues can be localized or concentrated on a single cluster or group of clusters.Various practical problems in high dimensions are addressed in [17][18][19][20].The graphs at hand amount to replacements of discrete tori by hypercubes.When regarded as graphs whose vertices are elements of Z d m and Z N 2 , respectively, one replaces each element of Z d m by a copy of Z N 2 (d ≤ N), in such a way that certain distinguished antipodal pairs of elements of Z N 2 become boundary elements that are adjacent to corresponding replacements of vertices of Z d m , while the remaining vertices of each copy of Z N 2 remain insulated.The Laplacian eigenmodes can be described in terms of two types: those that are supported in a single copy of Z N 2 (and typically vanish on the boundary vertices) and those that pass through replacement boundary vertices.We will show that the latter can be described in terms of eigenfunctions of an augmented Laplacian on Z N 2 that extend via modulation by values of global eigenvectors of Z d m .Numerical examples in Section 4 indicate that corresponding eigenvectors of spatio-spectral limiting on the replacement graphs can be more concentrated than eigenvectors of a comparable cycle.
The rest of this work is outlined as follows.In the next section, we review discrete tori T d m (with vertices indexed by Z d m ) and hypercube graphs B N (with vertices Z N 2 ) and define the replacement graphs T d m r B N .Our main contributions are found in Sections 3 and 4. In Section 3, we characterize the Laplacian spectrum of T d m r B N in terms amenable to spatio-spectral analysis (Theorem 2).Then, in Section 4, we study the ability to localize or concentrate low-spectrum vertex functions on a single copy of B N within T d m r B N , focusing primarily on the case d = 1, comparing to the case of concentration for a simple cycle C m×(N+1) , but also considering a numerical example for d = 2 (see Figures 1 and 2).In the case d = 1 (with C m = T 1 m ), we establish that there is a basis of vertex functions for the space of low-spectrum vertex functions on C m r B N (for a suitable value of the spectrum width parameter), such that each basis element has at least half of its squared norm concentrated in a single copy of B N (Proposition 1 and Theorem 3).

Discrete Tori and (Hyper)Cube Graphs
We denote by T d m the (simple Cayley) graph whose vertices are elements of , where e i is the vertex with entry 1 in the ith coordinate and 0s in the other coordinates.Z d m is sometimes called a discrete torus.In the case m = 2, we instead refer to the corresponding graph B N (= T N 2 ) with vertices Z N 2 as a (Boolean) hypercube, or cube for short.
For a finite, undirected, unweighted graph G with vertices V and edges E ⊂ V × V, |V| = n, we assume an ordering v 1 , . . ., v n of V. We denote the space of vertex functions f : , the real and imaginary parts of the complex eigenvector e 2πiν/m , ν ∈ Z m .As T d m is a d-fold Cartesian product of C m , its eigenvalues are d-term sums of the eigenvalues of C m and its corresponding eigenvectors are The eigenvectors of L(B N ) can be indexed by γ = (γ 1 , . . ., γ N ) ∈ {0, 1} N and have the form (up to normalization) In particular, the spectrum of L(B N ) is 2 × {0, 1, . . ., N}.It is simple to verify that the vectors h γ are mutually orthogonal and that h γ 2 = 2 N .One can re-organize the eigenvectors of L(B N ) as follows.For each k = 0, . . ., N, set Here, 0 = (0, . . ., 0) and 1 = (1, . . ., 1).One can check that the functions h k,rad are constant on Hamming spheres composed of points equidistant from 0, and we refer to them as radial eigenvectors.Suppose now that ψ lies in the 2k-eigenspace of L(B N ).Then, one can write ψ = ∑ |γ|=k c γ h γ .One then has Thus, if ψ, h k,rad = 0 then ∑ c γ = 0.As h γ (0) = 1 and h γ (1) = (−1) k when |γ| = k, it follows that ψ(0) = ∑ c γ = 0 and ψ(1) = (−1) k ∑ c γ = 0. Thus, we have proved the following.
For fixed v 0 ∈ V(B N ) we refer to the mapping that sends v ∈ V(B N ) to v + v 0 as a rotation of B N .Rotations of Laplacian eigenvectors on B N are also Laplacian eigenvectors.Suppose that f is a λ-eigenvector of L(B N ), and set As the vectors {h γ } |γ|=k form an orthogonal basis for the 2k-eigenspace of L(B N ), so do the vectors {h γ (• + v 0 )} |γ|=k for fixed v 0 .In what follows, for a vertex v 0 ∈ V(B N ), we refer to ṽ0 = v 0 + 1 as the antipodal vertex of v.
Proof.The proof is the same as that of Lemma 1, replacing 0 and 1 by v 0 and ṽ0 , respectively.As in the proof of Lemma 1,

Replacements of Tori by Cubes
Replacement graphs are usually defined as (r + 1)-regular graphs G R H, where G is d-regular, H is r-regular with |V(H)| = d and each vertex v ∈ V(G) is replaced by a copy H v of H with the adjacencies between the replaced vertices being consistent with the adjacencies of G (e.g., [22,23]).Previte [24] considered a version of replacement graphs according to more general substitution rules that allow vertices v of G to be replaced by H having more than deg G (v) vertices, by designating a boundary set ∂H of V(H) that accounts for the adjacencies among the different replaced vertices of G.We consider a version of this here, in which each vertex of G (in our case, G is a discrete torus) is replaced by the same substitution graph H (in our case, H is a cube B N ).
For toral dimension d fixed, one distinguishes ∑ |γ|=k h γ will be referred to as a radial eigenvector of L(B N ).Given a distinguished set ∂B N = {v 1 , . . ., v d ; ṽ1 , . . ., ṽd }, d ≤ N, one refers to the rotations h k,rad (v + v i ) as radial-type eigenvectors of L(B N ) and to any vector in the orthogonal complement of the span of the radial-type eigenvectors as a Dirichlet-type vector on B N .Any vertex function on T d m r B N whose restriction to each B N ( ∈ Z m d ) is in the span of the radial-type eigenvectors will be called a radial-type vector on T d m r B N .Any vector in the orthogonal complement of the radial-type vectors on T d m r B N will be called a Dirichlet-type vector on T d m r B N .(10, 0) (10, 1) (10, 2)

Laplacian Spectrum of T d m r B N 3.1. Augmented Laplacian
The structure of T d m r B N (d ≤ N) allows certain eigenfunctions of L(T d m r B N ) to be produced by a type of forcing from global eigenvectors of L(T d m ) in their complex exponential form, E (ν 1 ,...,ν d ) ( 1 , . . ., d ) = ∏ d j=1 e 2πiν j j /m .The ratio of successive values of E (ν 1 ,...,ν d ) in the jth coordinate is ω ν j = e 2πiν j /m .The ratio of an eigenvector of L(T d m r B N ) at the jth antipodal boundary pair in successive replacements B N is also ω ν j : f ( ṽ j ) = ), if f ( ṽ0 j ) = 0. We use this to express eigenvectors of L(T d m r B N ) in terms of those of L(B N ) augmented by operators C ω ν j that account for boundary adjacencies: if In what follows, we let n(v) ∈ {1, . . ., 2 N } be an indexing of the vertices of B N .
Observe that if φ is of Dirichlet type, meaning that φ vanishes at each of the antipodal pairs, then φ is in the kernel of C ω ν ,v ν for each ν = 1, . . ., d and, therefore, where, in the last identity, we use the fact that (C ω ν i ,v i φ)(v j ) = 0 unless i = j (the nonzero entries of the matrices C ω ν j ,v j are in different rows and columns for different j).Thus, φ is an eigenvector of L(T d m r B N ) if and only if φ restricted to B N is an eigenvector of L(v 1 , . . . ,v d ; ω ν 1 , . . . ,ω ν d ).As k ranges from 0 to N, the number of Dirichlet eigenvalues plus the number of radial eigenvalues (with multiplicity) is equal to The last statement indicates that the Dirichlet-type and radial-type eigenvectors together form a basis for 2 (T d m r B N ).Before proceeding to the proof of Theorem 2, we provide some preliminary results.Lemma 2. Let N ≥ 3.For each 1 ≤ d ≤ N there are vertices v 1 , . . ., v d , such that for each k = 1, . . ., N − 1 the rotated radial vectors h k,rad (v j + •) are linearly independent.
Henceforth, we shall always assume that boundary vertex pairs (v 1 , ṽ1 ), . . ., (v d , ṽd ) are chosen such that the vectors h k,rad (v j + •), j = 1, . . ., d (d ≤ N) are linearly independent.The proof of Lemma 2 can be found in Appendix A. The Hermitian matrices C α,v are positive semidefinite of norm two.For v = v ∈ V(B N ) (and ṽ = v ) the matrices C α,v and C α ,v have their nonzero entries in different rows and columns.Therefore, also, ∑ d ν=1 C v ν ,ω ν is positive semidefinite of norm two.It is then a straightforward consequence of the Courant-Fischer min-max theorem (e.g., [25]) that L(v 1 , . . . ,v d ; ω ν 1 , . . . ,ω ν d ) has (at least) d eigenvalues in [2k, 2k + 2) for k = 1, . . ., N − 1 and that the corresponding eigenvectors lie in the span of the radial-type eigenvectors of L(B N ).For the same reason, for k = 0 and k = N there is a single eigenvector of The proof of Lemma 3 shows that the collection B rad consisting of radial-type eigenvectors of L(B N ) of the form h k,rad (v j + •), j = 1, . . ., d, k = 1, . . .N − 1, together with h 0 (the constant vector on B N ) and h N (L(B N )h N = 2Nh N ), forms a basis for the span of the radial-type eigenvectors of L(v 1 , . . ., v d ; ω ν 1 , . . ., ω ν d ) for each choice of (ν 1 , . . ., ν N ) ∈ Z d m .In particular, span(B rad ) is equal to the orthogonal complement of D N , the span of the Dirichlet-type eigenvectors of L(B N ) and, hence, by the proof of Lemma 3, equal to the span of the radial-type eigenvectors of L(v 1 , . . ., v d ; ω ν 1 , . . ., ω ν d ), regardless of (ν 1 , . . ., ν N ).As the vectors E (ν 1 ,...,ν N ) ( ) = ∏ d j=1 ω j ν j = ∏ d j=1 e 2πiν j j /m form a basis for 2 (Z d m ) (the Fourier basis), it follows that the tensor products of elements of B rad and the vectors E (ν 1 ,...,ν N ) form a tensor product basis for the span of the radial-type eigenvectors of L(T d m r B N ) Therefore, the dimension of this span is the number of elements in the tensor product basis, which is m d ((N − 1)d + 2) by Lemma 3. As above, for each of the m d choices of (ν 1 , .

Spatio-Spectral Limiting
As they vanish at boundary vertices, Dirichlet-type eigenvectors of L(T d m r B N ) can be spatially supported in a single replacement B N .For small k, the 2k-Dirichlet eigenvectors can be regarded as low-spectrum eigenvectors corresponding to small Laplacian eigenvalues.This phenomenon of localized low-spectrum eigenmodes is very different from the traditional Euclidean setting in which the Paley-Wiener theorem (e.g., [26]) prohibits bandlimited signals from having compact support and which has analogues in the finite setting of a discrete cycle.Similar uncertainty principles apply in discrete settings, such as tori T d m (e.g., [27], cf., [16]).However, localization of a global Laplacian eigenvector on a single cluster is less surprising when the full graph can be viewed as a collection of weakly connected clusters whose eigenvectors may vanish at cluster boundaries.Definition 3.For a replacement graph G r H and v ∈ G, we define by Q v the operator, such that is a vertex in the replacement of v by H, and f (w) = 0 otherwise.We define by P K the projection onto the Paley-Wiener space PW K spanned by eigenvectors of L(G r H) having eigenvalues less than or equal to K. When choices of v and K are clear from context we will abbreviate Q v as Q and P K as P.

Radial-Type Eigenvectors of PQ, d = 1 Case
We focus here mainly on the case of replacement of a cycle (d = 1) because the analogue of time and band limiting in Euclidean space (and tori) itself is substantially more complicated than the one-dimensional theory.For a vertex function , where π λ f is the orthogonal projection onto the λ-eigenspace of C m r B N .Here, π λ f = ∑ ϕ λ f , ϕ λ ϕ λ , where the sum runs over an orthonormal basis of the λ-eigenspace of L(C m r B N ).We can write PW K (C m r B N ) = D K ⊕ R K , where D K is spanned by those Laplacian eigenvectors of Dirichlet type with eigenvalue at most K and R K is spanned by corresponding eigenvectors of radial type.By Theorem 2, dim For N fixed, let {h k,rad } N k=0 be the orthonormal radial eigenvectors on B N defined as above.For fixed ν ∈ Z m , let {ϕ k,ν } N k=0 be orthonormal radial-type eigenvectors of the augmented Laplacian L(0; ω ν ).Let c κ,k,ν = h κ,rad , ϕ k,ν be the coefficients of the change of basis with respect to {h κ,rad } and {ϕ k,ν } on the radial space of 2 The radial-type eigenvectors ϕ k,ν of L(0; ω ν ) may be viewed as perturbations of those of L(B N ), as indicated by the following hypothesis.The corresponding eigenvectors of L(C m r B N ) have the form where {v n } 2 N −1 n=0 now refers to an indexing of the vertices of B N .We state the following as a hypothesis, as technical details do little to illuminate the consequences of interest here.

Hypothesis 1.
For fixed integers N ≥ 3 and m odd, the matrix of the change of basis from {ϕ k,ν } to {h κ,rad } on the radial subspace of 2 (B N ) is diagonally dominant.Specifically, |c k,k,ν | 2 > 2/3 for each k = 0, . . ., N and ν = 0, . . ., m − 1, whereas Here, m is odd simply to avoid the degenerate case ω ν = −1 when ν = m/2.The hypothesis can be verified for computable N using tools mentioned in our Data Availability Statement.It can be shown that as N → ∞, |c k,k,ν | → 1.A proof of this fact requires detailed analysis of the values h k,rad (0), which tend to zero as N → ∞, along with the trace identity tr L(0; Proposition 1. Assuming Hypothesis 1, there exist N + 1 linearly independent vectors in the span of the extensions to C m r B N of the augmented radial-type eigenvectors {ϕ k,ν } N,m−1 k=0,ν=0 that have at least half of their squared 2 -norms concentrated in the = 0 block B 0 N of C m r B N .
Proof.The proof boils down to identifying suitable linear combinations Φ k of radial-type eigenvectors on C m r B N .Set where ϕ k,ν is the sum of the terms with where 1 B N is the indicator function of B N .Assuming Hypothesis 1, one has where we use Plancherel's theorem for Fourier series on Z m in the second identity and the orthonormal expansion of ϕ k,ν in h κ,rad 's in the third.As mh k,rad ).This applies to each k = 0, . . ., N and the proposition follows.
Theorem 3. Assuming Hypothesis 1, let 0 < K ≤ N. Let > 0 be such that, for each ν = 0, . . ., m − 1, the extensions ϕ K−1,ν have Laplacian eigenvalues smaller than 2K − .Then, there is a basis of PW 2K− (C m r B N ) of functions Ψ, such that for each basis element there is some Proof.The vectors Φ k in the proof of Proposition 1 form a set of N + 1 linearly independent vectors satisfying They are linearly independent from one another and also from the vectors Φ k for = as a consequence of their concentrations.Thus, as k ranges over 0, . . ., N and ranges over Z m the vectors Φ k form a collection of m(N + 1) linearly independent vectors.As Φ k is a linear combination of extensions of augmented Laplacian eigenvectors with eigenvalues in [2k, 2k + 2), it follows that each By Theorem 2, for each there is a collection of ∑ K−1 k=1 (( N k ) − 1) linearly independent eigenvectors of L(C m r B N ) of Dirichlet type supported in B N .These are also linearly independent from the vectors Φ k .As (k, ) ranges over {0, . . ., K − 1} × {0, . . ., m − 1}, the vectors Φ k together with the corresponding Dirichlet eigenvectors thus form a collection of linearly independent vectors, which is equal to the dimension of PW 2K− (C m r B N ) for > 0, sufficiently small that PW 2K− (C m r B N ) contains all extended radial-type eigenvectors ϕ k,ν , k = 0, . . ., K − 1.

Examples
Here, we illustrate the facts outlined above by three examples, chosen so that in each case the operator PQ, where Q denotes truncation to a single vertex replacement and P denotes projection onto a suitably chosen low spectrum, has precisely three radial-type eigenvalues of at least 1/2.The examples are: (i) C 21×8 C 21 r P 8 (P 8 is the path on eight vertices), (ii) C 21 r B 7 , and (iii) T 2 11 r B 4 .The distribution of eigenvalues of PQ operators for a cycle C m was characterized in [28].The example of C 21×8 C 21 r P 8 is a special case.Distribution of eigenvalues of PQ operators for general graphs T d m r B N has not been studied previously.The Laplacian eigenvalues of these graphs are plotted on the right (upper graphs) in Figure 2. The eigenvalues of the corresponding PQ operators are plotted in Figure 5.In each case, Q truncates to one instance of vertex replacement: to the first copy of P 8 , B 7 and B 4 , respectively.Also in each case, P denotes projection onto a low-spectrum span of the Laplacian eigenvectors with n smallest eigenvalues for suitable n.
In the case of C 21×8 we choose n = 63 = 3 × 21.Here, we define Q to be the cutoff to the first eight vertices of the cycle and P to be the projection onto the span of the first 63 Laplacian eigenvalues of the cycle.The eigenvalues are shown in the top plot of Figure 5.It is known in the case of a cycle C m that the number of eigenvalues of PQ larger than 1/2 (3 here) is the normalized time-bandwidth product: the length of the support of truncation Q (8 here) times the number of points in the truncated spectrum (3 × 21 here) divided by m (m = 8 × 21 here) (see, e.g., [5,14,[28][29][30]).
In the case of C 21 r B 7 , we take Q to be the cutoff on B 0 7 and P is the projection onto the Laplacian eigenvectors of L(C 21 r B 7 ) whose eigenvalues are less than or equal to 6.The eigenvalues are shown in the middle plot of Figure 5.There are 60 eigenvalues of PQ equal to 1.These correspond to the span of the Dirichlet eigenvectors supported in B 0 7 whose Laplacian eigenvalues are 2 (with multiplicity 6), 4 (20) or 6 (34), according to Theorem 2. The case of C 21 r B 7 also admits 3 eigenvalues of PQ whose eigenvectors are in the span of the radial-type eigenvectors with Laplacian eigenvalues smaller than 6, as explained by Hypothesis 1 above.For other spectrum cutoffs 2K, the number of radial-type eigenvectors of PQ is equal to K, which is the number of radial-type eigenvectors of L(B N ) (K ≤ N) with an eigenvalue smaller than K.
In the case of T 2 11 r B 4 , we take Q to be the cutoff to B .This case also admits three eigenvectors of PQ whose eigenvalues lie in (1/2, 1).These eigenvectors of PQ lie in the span of the radial-type eigenvectors of L(T 2 11 r B 4 ) that extend augmented Laplacian eigenvectors with eigenvalues smaller than 4 (there are 121 = 11 2 such eigenvalues smaller than 2 and 242 between 2 and 4; see Figure 2).
The radial-type eigenvalues of PQ for these three cases are plotted in Figure 1.The eigenvalues are equal to the concentrations ( Qϕ 2 / ϕ 2 ) of the vectors on a single replacement.The case of C 21 r B 7 admits the most concentrated radial-type vectors, followed by T 2 11 r B 4 and then C 21×8 .In the case of C 21 r B 7 , radial-type vectors are constant on vertices v that are equidistant from 0 .This case can thus be viewed as a cycle of length 21 × 8 with periodically weighted edges.The weighting allows for more effective concentration than in the case of an unweighted cycle of equal length.
The case of T 2 11 r B 4 is more complicated, but comparison with C 21 r P 8 in Figure 1 suggests that B 4 provides sufficient degrees of freedom for low-spectrum oscillations to be concentrated more than in the case of a simple cycle.
In each of the three cases (C 21 r P 8 , C 21 r B 7 and T 2 11 r B 4 ) considered, there are three radial-type eigenvectors of PQ concentrated on P 8 , B 7 and B 4 , respectively.For each case, we plot the third-most concentrated radial-type eigenvector of PQ in Figure 2. Specifically, the third radial-type eigenvector of PQ corresponding to the third eigenvalue shown in Figure 1 is plotted on the left in Figure 2 for cases of C 21×8 (top), C 21 r B 7 (middle) and T 2 11 r B 4 (bottom).Their Fourier coefficients (inner products with Laplacian eigenvectors) are plotted on the right in Figure 2 below plots of the corresponding Laplacian eigenspectra.One can verify that, together with the corresponding Dirichlet-type eigenvectors of PQ, counting an equal number of eigenfunctions of PQ for a shifted version Q v of the cutoff Q corresponding to each vertex replacement B v N , one obtains bases of the corresponding Paley-Wiener space PW K for each case consisting of eigenvectors that are concentrated on a single vertex replacement.This is an analogue of the shifted prolate bases of the Paley-Wiener subspaces of L 2 (R) studied in [31].

Discussion
The graphs T d m r B N serve as simple models for networks that have a high degree of local connectivity and relatively low-dimensional global geometry.These graphs are highly structured.But what we lose in generality we gain in precision, formulating and verifying our results in terms of classical techniques of harmonic analysis.We have described the Laplacian spectrum of these graphs in a manner that facilitates analysis of spatio-spectral limiting operators PQ that first truncate to a cluster (i.e., instance of B N inside T d m r B N ), then project onto the low part of the Laplacian spectrum, on these graphs.A relatively high-dimensional Dirichlet-type subspace lies in the span of the Laplacian eigenvectors with eigenvalues smaller than 2K, K < N when d N. We have also quantified radialtype eigenvectors of PQ that are concentrated on a single cluster.In the specific case of cycle replacements C m r B N , we have shown that there are K linearly independent eigenvectors of PQ with eigenvalues larger than 1/2 that lie in the span of radial-type Laplacian eigenvectors having Laplacian eigenvalues smaller than 2K.Shifts of these concentrated vectors onto other clusters, together with those of the corresponding Dirichlet eigenvectors, form a basis of the corresponding Paley-Wiener space of C m r B N .Numerical results show that these basis elements are more concentrated than those of a comparable basis of shifted eigenvectors of the corresponding PQ operator in the case of a simple cycle.
Developing methods to identify suitable bases or frames for low-spectrum Paley-Wiener spaces is an important area of research in graph signal processing, particularly in the case of clustered but otherwise general graphs (e.g, [32]).Analogues of Slepian-type eigenfunctions on graphs [8,9] are a relatively new aspect of this.While the techniques developed here cannot be brought directly to bear on general graphs, we anticipate that versions of the techniques used herein can be developed for certain tinker toy models: graphs in which one of a family {B ν } of structured cluster graphs can be substituted for each vertex v of a global graph S, allowing low-spectrum basis functions spatially concentrated on a single cluster.We also anticipate a parallel numerical study of the concentration of low-spectrum vertex functions on clusters in more general graphs, expressed primarily in terms of local and global connectivity parameters.

Figure 2 .
Figure 2. Plots of radial-type eigenvectors of PQ (left) and their Fourier coefficients (right).

Definition 1 .
and defines T d m r B N as the graph obtained by replacing each vertex = ( 1 , . . ., d ) of Z d m by a copy B N of B N , in such a way that the antipodal vertices in successive copies are made adjacent.Specifically, ṽ i ∼ v +e i i .Vertices of T d m r B N will be denoted v where = ( 1 , . . ., d ) ∈ Z d m and v ∈ V(B N ).See Figure 3 for a representation of C 3 r B 2 and Figure 4 for a partial representation of T 2 m r B 2 .We will suppress in the sequel any dependence of T d m r B N on the particular choice of ∂B N .We will always assume that d ≤ N.This means that the global structure of T d m is relatively low dimensional compared to the local structure of B N and facilitates statements of some results here.The following terminology, justified by Lemma 1 and Corollary 1, will be used in what follows.For each k = 0, . . ., N, the Hadamard sum h k,rad = ( N k ) −1 where R consists of radial-type vectors and D of Dirichlet-type vectors.As a consequence of Corollary 1, Dirichlet vectors vanish at the boundary ∂B N for each ∈ Z m d .

Corollary 2 .Theorem 2 .
If λ is an eigenvalue of L(T d m r B N ) then it is also an eigenvalue of the augmented Laplacian L(v 1 , . . ., v d ; ω ν 1 , . . ., ω ν d ) for specific ω ν j = e 2πiν j /m .The corollary is subsumed in Theorem 2 below.3.2.Laplacian Spectrum of T d m r B N , d ≤ N A complete set of eigenvectors of L(T d m r B N ) is described by the following.Fix integers m > 2, d ≥ 1 and N ≥ d.Let T d m r B N be equipped with boundary vertex pairs v 1 , . . ., v d and ṽ1 , . . ., ṽd , where ṽi = v i + 1 ∈ Z N 2 .The eigenvectors of L(T d m r B N ) are of one of the following two types: (i) Dirichlet type.These are vertex functions ϕ on T d m r B N that vanish on the boundary vertices v i and ṽ i for each ∈ Z d m and each i = 1, . . ., d.The span of the 2k-Dirichlet eigenvectors (k = 1, . . ., N − 1) has dimension m d ( N k ) − d .(ii) Radial type.These are vertex functions ϕ on T d m r B N whose restrictions to any B N are eigenvectors of L(v 1 , . . ., v d ; ω ν 1 , . . ., ω ν d ) for some of (ν 1 , . . ., ν d ) ∈ Z d m .For fixed k, 1 ≤ k < N there are dm d radial-type eigenvectors having eigenvalues in [2k, 2k + 2) and there are m d such with eigenvalues in [0, 2) or in 2[N, N + 1).

Lemma 3 .
The augmented Laplacian L(v 1 , . . . ,v d ; ω ν 1 , . . . ,ω ν d ) (d ≤ N) has d(N − 1) + 2 linearly independent radial-type eigenvectors.Proof.The Dirichlet-type eigenvectors of L(B N ) and of L(v 1 , . . ., v d ; ω ν 1 , . . ., ω ν d ) are the same.Denote by D N the span of all Dirichlet-type eigenvectors.D N has dimension∑ N−1 k=1 (( N k ) − d) = 2 N − 2 − (N − 1)d, so its orthogonal complement has dimension (N − 1)d + 2. By Lemma 2, the span of the radial-type eigenvectors h k,rad (v j + •), j = 1, . . ., d; k = 1, . . ., N − 1, together with the constant vector and the vector h N , has dimension d(N − 1) + 2 and, therefore, forms a basis for the orthogonal complement of D N inside 2 (B N ).Consequently, the eigenvectors of L(v 1 , . . ., v d ; ω ν 1 , . . ., ω ν d ) that are orthogonal to D N are all in the span of the radial-type eigenvectors of L(B N ).As L(v 1 , . . ., v d ; ω ν 1 , . . ., ω ν d ) has full rank 2 N , these vectors also span the orthogonal complement of D N .Proof of Theorem 2. The dimension of the 2k-eigenspace of L(B N ) is ( N k ).Vanishing of an eigenvector at antipodal points (v, ṽ) imposes a linear constraint∑ c k = 0 when ϕ = ∑ |γ|=k c γ h γ (• + v) isan expansion in rotated Hadamard vectors.This implies that there are ( N k ) − d linearly independent 2k-Dirichlet eigenvectors of L(B N ).Such vectors are also 2k-eigenvectors of L(T d m r B N ) that are supported on a single copy B N of B N .As T d m r B N contains m d replacements by B N , the dimension of the 2k-Dirichlet eigenspace of L(T d m r B N ) is m d ( N k ) − d .The augmented Laplacians L(v 1 , . . ., v d ; ω ν 1 , . . ., ω ν d ) have full rank.As the Hadamard vectors are complete in 2 (B N ), the orthogonal complement of the span of the Dirichlet eigenvectors of L(v 1 , . . ., v d ; ω ν 1 , . . ., ω ν d ) is spanned by radial eigenvectors of L(B N ).For k = 1, . . ., N − 1 there are d linearly independent radial-type 2k-eigenvectors of L(B N ).
the number of radial-type eigenvectors of L(T d m r B N ) is m d ((N − 1)d + 2), and as the spans of the Dirichlet eigenvectors and radial-type eigenvectors of L(T d m r B N ) are orthogonal to one another, it follows that the sum of these spans has dimension m d 2 N and, therefore, the Dirichlet and radial-type eigenvectors of L(T d m r B N ) together span 2 (T d m r B N ).This completes the proof.

(0,0) 4 and
P is the projection onto the span of the Laplacian eigenvectors whose eigenvalues are at most 4. The eigenvalues are shown in the bottom plot of Figure 5. PQ admits 2 eigenvalues equal to 1 corresponding to the pair of Dirichlet 2-eigenvectors of L(B 4 ) supported in B (0,0) 4