# Frustration index and Cheeger inequalities for discrete and continuous magnetic Laplacians

- First Online:

- Received:
- Accepted:

## Abstract

We discuss a Cheeger constant as a mixture of the frustration index and the expansion rate, and prove the related Cheeger inequalities and higher order Cheeger inequalities for graph Laplacians with cyclic signatures, discrete magnetic Laplacians on finite graphs and magnetic Laplacians on closed Riemannian manifolds. In this process, we develop spectral clustering algorithms for partially oriented graphs and multi-way spectral clustering algorithms via metrics in lens spaces and complex projective spaces. As a byproduct, we give a unified viewpoint of Harary’s structural balance theory of signed graphs and the gauge invariance of magnetic potentials.

### Mathematics Subject Classification

05C50 (35P15, 58J50)## 1 Introduction

Cheeger’s inequality is one of the most fundamental and important estimates in spectral geometry. It was first proved by Cheeger for the Laplace-Beltrami operator on a Riemannian manifold [7] and later extended to the setting of discrete graphs, see e.g., [1, 2, 6, 11], demonstrating the close relationship between the spectrum and the geometry of the underlying space. This inequality has a tremendous impact in discrete and continuous theories and is an important intersection point for interactions between both communities. For example, it stimulated research in discrete mathematics such as spectral clustering algorithms for data mining [36], or the construction of expander graphs [25]. Cheeger inequalities have also been considered on metric graphs, see, e.g., [42] and, using a coarea formula in the proof [44]. We recently witness several fruitful interactions in the other direction: Lee, Oveis Gharan and Trevisan’s higher order Cheeger inequalities [28, 29] on finite graphs were used by Miclo [40] to prove that hyperbounded, ergodic, and self-adjoint Markov operators admit a spectral gap, solving a 40-year-old conjecture of Simon and Høegh–Krohn [50]. For further developments, see [32, 57]. Another example is an improved Cheeger’s inequality for finite graphs by Kwok et al. [27], which was subsequently used to establish an optimal dimension-free upper bound of eigenvalue ratios for weighted closed Riemannian manifolds with nonnegative Ricci curvature [33] (see also [34]). This answers open questions of Funano and Shioya [15, 16].

Spectral theory of discrete and continuous magnetic Laplacians attracted a lot of attention and literature on this subject developed rapidly, see, e.g., [9, 13, 14, 17, 24, 31, 41, 43, 47, 48, 49, 53]. Shigekawa proved the following comparison result in [47]: the least eigenvalue of the magnetic Laplacian on a closed Riemannian manifold is bounded from above by the least eigenvalue of a related Schrödinger operator. He also proved Weyl’s asymptotic formula for magnetic Laplacians. Paternain [43] obtained an upper bound of the least eigenvalue in terms of the so-called harmonic value and Mañé’s critical value of the corresponding Lagrangian. On finite planar graphs, Lieb and Loss [31] solved physically motivated extremality problems for eigenvalue expressions of the discrete magnetic Laplacian.

In this paper, we discuss a definition of Cheeger constants (Definitions 3.5, 3.6 and 7.3) reflecting the nontriviality of the magnetic potentials in terms of the frustration index (see Definitions 3.4 and 7.2) and the global connectivity of the underlying space. This definition works for both discrete and continuous magnetic Laplacians, and graph Laplacians with *k*-cyclic signatures (\(k \in {\mathbb N}\)). Recall that discrete magnetic Laplacians can be considered as graph Laplacians with a *U*(1)-signature. We would like to point out that our definition of Cheeger constants provides invariances under switching operations (Definition 2.3) or gauge transformations (Eq. 7.8). Furthermore, we prove the corresponding Cheeger inequalities and higher order Cheeger inequalities (Theorems 4.1, 4.6, 5.1, 7.4, and 7.7). We notice that our Theorem 4.6, the Cheeger inequality for discrete magnetic Laplacian, overlaps with a Cheeger inequality of Bandeira, Singer and Spielman [4, Theorem 4.1] in the framework of graph connection Laplacians [51]. See Remark 4.9 for a more detailed explanation. It is known in physics that “a magnetic field raises the energy” [31]. Roughly speaking, our estimates tell us that a magnetic field raises the energy via raising the frustration index. We focus on finite graphs and compact Riemannian manifolds in this paper.

Cheeger inequalities are essentially coarea inequalities. In the proof, we obtain in particular coarea inequalities related to the frustration index on graphs as well as on manifolds (Lemmas 4.3 and 7.5).

In fact, we were led to our Cheeger constant definition by an investigation of graph Laplacians with *k*-cyclic signatures, aiming at extending a previous spectral interpretation [3] of Harary’s structural balance theory [21, 22] for graphs with \((\pm 1)\)-signatures. It turns out that the Cheeger inequalities for graph Laplacians with *k*-cyclic signatures and their proofs provide spectral clustering algorithms for partially oriented graphs (alternatively called mixed graphs without loops and multiple edges [23, 45, 46, 60]), aiming at detecting interesting substructures. A partially oriented graph may contain both oriented and unoriented edges. In the proof of such inequalities, we develop a random *k*-partition argument, which is algorithmic (see Lemma 4.2 and Proposition 6.6). Recall that, in the setting of \((\pm 1)\)-signed graphs (i.e., \(k=2\)), the eigenfunctions are real valued and a bipartition of the underlying graph can be given naturally according to the sign of the eigenfunction. But here we have complex valued eigenfunctions. Hence we do not have any natural *k*-partitions. That is why new ideas are needed. The generally non-symmetric graph Laplacians of partially oriented graphs are hardly useful for the purpose of spectral clustering. Our idea is to associate to a partially oriented graph and a natural number \(k \in {\mathbb N}\) an unoriented graph with a special *k*-cyclic signature. We then perform spectral clustering algorithms employing eigenfunctions of the graph Laplacian with the associated signature. According to our Cheeger constant definition, we can obtain interesting *k*-cyclic substructures. See Sect. 6 for details.

To prove higher order Cheeger inequalities, we develop new multi-way spectral clustering algorithms using metrics on *lens spaces* and *complex projective spaces*. This provides a deeper understanding of earlier spectral clustering algorithms via metrics on real projective spaces presented in [32] and [3]. These clustering algorithms were initially designed to find almost bipartite subgraphs of a given graph [32], and then extended to find almost balanced subgraphs of a signed graph [3]. While all operators studied in [3, 32] are bounded, we show that finding proper metrics for clustering is also useful for unbounded operators: the spectral clustering algorithms via metrics on complex projective spaces are crucial to prove the higher order Cheeger inequalities of the magnetic Laplacian on a closed Riemannian manifold (Lemma 7.8).

The paper is organized as follows. In Sect. 2, we set up notation for the discrete setting and recall basic spectral theory of related graph operators. In Sect. 3, we define the frustration index and the (multi-way) Cheeger constants. We prove the corresponding Cheeger’s inequality in Sect. 4 and higher order Cheeger inequalities in Sect. 5. In Sect. 6, we discuss applications of Cheeger inequalities for spectral clustering on partially oriented graphs. In Sect. 7, we extend the results developed on discrete graphs to magnetic Laplacians on closed Riemannian manifolds.

## 2 Notations and basic spectral theory

*N*vertices with vertex set

*V*and edge set

*E*. We denote edges of

*G*by \(\{u,v\}\), and \(u \sim v\) means that \(u \in V\) and \(v \in V\) are connected by an edge. For any subset \(\widetilde{V}\subseteq V\), let \(\widetilde{G}=(\widetilde{V},\widetilde{E})\) be the subgraph of

*G*induced by \(\widetilde{V}\), that is, an edge \(\{ u,v\}\) of \(\widetilde{G}\) is an edge of

*G*with \(u,v\in \widetilde{V}\). We tacitly associate to every edge \(e=\{u,v\} \in E\) a positive symmetric weight \(w_{uv} = w_{vu} = w_e\) and define the weighted degree \(d_u\) of a vertex \(u\in V\) by \(d_u:=\sum _{v,v\sim u}w_{uv}\). For a positive measure \(\mu : V \rightarrow {\mathbb R}^+\) on

*V*, we define the

*maximal*\(\mu \)-

*degree*of the graph

*G*as

*u*and terminating at

*v*, and by \(\bar{e}=(v,u)\) the oriented edge with the reversed orientation. Let \(E^{or}:=\{(u,v), (v,u)\mid \{u,v\}\in E\}\) be the set of all oriented edges.

**Definition 2.1**

*G*be a graph and \(\Gamma \) be a group. A

*signature*of

*G*is a map \(s: E^{or} \rightarrow \Gamma \) such that

*s*(

*e*) in \(\Gamma \). The

*trivial signature*\(s \equiv 1\), where 1 stands for the identity element of \(\Gamma \), is denoted by \(s_1\). For an oriented edge \(e=(u,v) \in E^{or}\), we will also write \(s_{uv}:=s(e)\) for convenience.

For \(k \in {\mathbb N}\), we use the standard combinatorial notation \([k] = \{1,2,\dots ,k\}\). In this paper, we will restrict ourselves to the case that the signature group \(\Gamma \) is the cyclic group \(S_k^1:=\{\xi ^{j} \mid j \in [k] \}\) of order *k*, generated by the primitive *k*-th root of unity \(\xi :=e^{2\pi i/k}\in \mathbb {C}\), and the case that \(\Gamma \) is the unitary group \(U(1) = \{ z \in {\mathbb C} \mid |z| = 1 \}\). The notation \(S_k^1\) emphasizes the fact that the elements in \(S_k^1\) lie on the unit circle.

*G*,

*w*) with signature \(s: E^{or} \rightarrow \Gamma \) and vertex measure \(\mu : V \rightarrow {\mathbb R}^+\). For any function \(f: V\rightarrow \mathbb {C}\), and any vertex \(u\in V\), we have

*v*adjacent to

*u*can also be understood as a summation over the oriented edges \(e=(u,v) \in E^{or}\), and the signature is evaluated at (

*u*,

*v*).

*D*and \(D_{\mu }\) are the diagonal matrices with \(D_{uu}=d_u\) and \((D_{\mu })_{uu}=\mu (u)\) for all \(u\in V\) while \(A^s\) is the (weighted) signed adjacency matrix with

*k*-cyclic signature. When \(\Gamma =U(1)\), this is the discrete magnetic Laplacian studied in Sunada [53] (see also Shubin [48]). By (2.2), the matrix \(\Delta ^s_{\mu }\) is Hermitian, and hence all its eigenvalues are real which can be listed with multiplicity as follows:

*Rayleigh quotient*\(\mathcal {R}_{\mu }^s(f)\) of a function \(f: V\rightarrow \mathbb {C}\) is

*Remark 2.2*

*G*with measure \(\mu _d(u):=d_u\) for all \(u \in V\) and signature group \(\Gamma =U(1)\) or \(\Gamma = S^1_k\),

*k*even, Eq. (2.8) implies the following relations between eigenvalues

*s*(as complex numbers). This generalizes [3, Lemma 1] where \(\Gamma = S^1_2 = \{\pm 1\}\).

There is a natural operation, called switching, acting on the signatures [58, 59].

**Definition 2.3**

*G*be a graph with signature

*s*. For any function \(\tau : V\rightarrow \Gamma \) we can define a new signature \(s^{\tau }:E^{or}\rightarrow \Gamma \) as follows:

*switching function*. The signature

*s*and \(s'\) are said to be

*switching equivalent*if there exists a switching function \(\tau \) such that \(s'=s^{\tau }\).

*Remark 2.4*

The concept of switching is developed in the study of Harary’s balance theory for signed graphs [21], i.e. graphs with signatures \(s:E^{or}\rightarrow S_2^1=\{+1,-1\}\), which we briefly review in the next section. The corresponding terminology in the magnetic theory is the gauge transformation, see, e.g., [9, 47]. Note that switching is an operation acting on the signatures \(s_{uv}:=e^{i\alpha _{uv}}\), while the gauge transformation is acting on the magnetic potentials \(\alpha _{uv}\), where \((u,v)\in E^{or}\). We will only use the terminology of the magnetic theory in the manifold case, see Sect. 7. Switching equivalent signatures are called cohomologous weight functions in [53].

## 3 Frustration index and Cheeger constants

*G*be a finite graph with (possibly non-abelian) signature group \(\Gamma \) and signature \(s: E^{or} \rightarrow \Gamma \), and \(\mathcal {C}\) be a cycle, which is a graph of the sequence \((u_1,u_2), (u_2,u_3), \ldots , (u_{l-1}, u_l), (u_l,u_1)\) of distinct edges. Then the signature of \(\mathcal {C}\) is the conjugacy class of the element

**Definition 3.1**

A signature \(s:E^{or}\rightarrow \Gamma \) is said to be *balanced* if the signature of every cycle of *G* is (the conjugacy class of the) identity element \(1\in \Gamma \).

For convenience, we will also say that the graph *G* or a subgraph of *G* is balanced if the signature restricted on it is balanced. Since the signature of a cycle is switching invariant, the property of being balanced is also switching invariant. We have the following characterization of being balanced using switching operations.

**Proposition 3.2**

([58], Corollary 3.3]) A signature \(s: E^{or}\rightarrow \Gamma \) is balanced if and only if it is switching equivalent to the trivial signature \(s_{1}\).

*Remark 3.3*

The concept of balance has been studied in the literature under various terminologies. For example, a balanced cycle is said to be satisfying Kirchhoff’s Voltage Law in [19]. In [9], the related concept to the signature of a cycle is the holonomy map. In magnetic theory, it is related to the magnetic flux [31].

We define the following frustration index to quantify how far a signature on a subset is from being balanced.

**Definition 3.4**

*G*be a finite graph with signature

*s*and \(V_1\subseteq V\) nonempty with induced subgraph \((V_1,E_1)\). The

*frustration index*\(\iota ^s(V_1)\) of \(V_1\) is defined as

*G*is unweighted and \(\Gamma =\{+1,-1\}\), then

*E*in order to make \(G=(V, E)\) balanced. The quantity \(e_{min}^s(V)\) is exactly the

*line index of balance*of Harary [22]. Having the work of Vannimenus and Toulouse [56] in mind, Zaslavsky suggested later the term “frustration index” to Harary (T. Zaslavsky 2014, private communication).

*boundary measure*of \(V_1\) by

*V*. The \(\mu \)-

*volume*of \(V_1\) is given by

**Definition 3.5**

*G*be a finite graph with a signature

*s*. The

*Cheeger constant*\(h_1^s(\mu )\) is defined as

The choice of \(V_1\) achieving the minimum in (3.7) can be viewed as a subset of vertices which balances the two complementary goals of minimizing its frustration index and its expansion, measured by the edges \(E(V_1, V_1^c)\) connecting \(V_1\) with its complement.

A *nontrivial n-subpartition* of *V* is given by *n* pairwise disjoint nonempty subsets \(V_1,\dots ,V_n \subset V\) and a *nontrivial n-partition* additionally satisfies \(\bigcup _{p \in [n]} V_p=V\). We abbreviate a nontrivial *n*-(sub)partition \(\{V_1, \ldots , V_n\}\) by \(\{V_p\}_{[n]}\). In the spirit of Miclo [39], we define the multi-way Cheeger constants as follows.

**Definition 3.6**

*G*be a finite graph with a signature

*s*. The

*n-way Cheeger constant*\(h_n^s(\mu )\) of

*G*is defined as

*n*-subpartitions \(\{V_p\}_{[n]}\) of

*V*.

Observe that the *n*-way Cheeger constant of a graph *G* is monotone with respect to *n*, that is, \(h_n^s(\mu )\le h_{n+1}^s(\mu )\).

Using (3.3) and the fact that the frustration index is switching invariant, we obtain the following properties of the Cheeger constants.

**Proposition 3.7**

The n-way Cheeger constants \(h_n^s(\mu )\) of a graph *G* are switching invariant. Moreover, \(h_n^s(\mu )=0\) if and only if *G* consists of at least *n* connected components and at least *n* of them are balanced.

*Remark 3.8*

Due to equation (3.4), the *n*-way Cheeger constant in (3.9) reduces to the signed Cheeger constant introduced on signed graphs [3] with signature group \(\Gamma =\{+1,-1\}\). We mention that the signed Cheeger constant in [3] is a unification of the classical Cheeger constant, the non-bipartiteness parameter in [10], the bipartiteness ratio in [54, 55], and the dual Cheeger constant in [5].

*n*subpartition of

*V*that achieves \(h_n^s(\mu )\), we have \(\phi _\mu ^{s_b}(\widetilde{V}_p)\le \phi _\mu ^s(\widetilde{V}_p)\) since \(\iota ^{s_b}(\widetilde{V}_p)=0\le \iota ^{s_b}(\widetilde{V}_p)\). Hence, (3.11) follows by Definition 3.6. The inequality (3.11) is similar, in spirit, with Kato’s inequality for noncompact spaces [12, Lemma 1.2, Corollary 1.3] (alternatively, also called the diamagnetic inequality for both compact and noncompact spaces in [31]) where the bottom of the spectrum increases when a balanced signature is replaced by an unbalanced signature.

For \(n=1\) we have the following result. Recalling \(h_1^{s_b}(\mu )=0\), Proposition 3.9 tells us that this change of the first Cheeger constant (by choosing an unbalanced signature) can be quite large.

**Proposition 3.9**

*G*be an unweighted connected finite

*d*-regular graph and \(M = \max _{v \in V} \mu (v)\). Then, for every \(k \ge 2\), there exists a

*k*-cyclic signature \(s_0: E^{or}\rightarrow S_k^1\) such that

*Proof*

Extending a result of [37, 38], it is shown in [35, Theorem 2] that there exists a *k*-cyclic signature \(s_0\) such that the maximal eigenvalue of the matrix \(A^{s_0}\) is no greater than \(2\sqrt{d-1}\). The estimate (3.12) is then an immediate consequence of this result, combined with Cheeger’s inequality (4.1), given at the beginning of the next section. \(\square \)

## 4 Cheeger’s inequality

In this section, we prove Cheeger’s inequality relating \(\lambda _1(\Delta _{\mu }^s)\) to the first Cheeger constant \(h_1^{s}(\mu )\) for graph Laplacians with cyclic signatures (Theorem 4.1) and for discrete magnetic Laplacians (Theorem 4.6).

**Theorem 4.1**

*G*be a finite graph with signature \(s: E^{or}\rightarrow S_k^1\). Then we have

*r*. For \(\theta \in [0, 2\pi )\) and \(k \in {\mathbb N}\), we define the following

*k*disjoint sectorial regions

*k*-th primitve root of unity.

The following lemma plays a key role.

**Lemma 4.2**

*Proof*

Lemma 4.2 can be considered as an extension of [3, Lemma 5] and [54, 55, Section 3.2]. The novel point here is that we introduce an extra degree of randomness in the argument of *z* in order to handle the difficulty caused by cyclic signatures. Actually, this provides a random *k*-partition parametrized by an angle \(\theta \), which will be discussed further in Sect. 6. This lemma is a version of a coarea inequality, which becomes transparent from the following direct consequence.

*G*and any \(t\in [0, \max _{u\in V}|f(u)|]\), we define the following non-empty subset of

*V*:

**Lemma 4.3**

*G*. For any function \(f:V\rightarrow \mathbb {C}\) with \(\max _{u\in V}|f(u)|=1\), we have

*Proof*

The coarea inequality is particularly useful to prove Lemma 4.4.

**Lemma 4.4**

*G*and \(f:V\rightarrow \mathbb {C}\) be a nonzero function. Then there exists \(t'\in [0, \max _{u\in V}|f(u)|^2]\) such that

*Proof*

*f*is non-zero, we may assume (after rescaling) that \(\max _{u\in V}|f(u)|=1\). Moreover,

*Proof of Theorem 4.1*

The upper estimate in (4.1) follows from Lemma 4.4 by setting *f* to be the eigenfunction corresponding to the eigenvalue \(\lambda _1(\Delta _{\mu }^s)\).

*V*that achieves the Cheeger constant \(h_1^s(\mu )\) in (3.7) with induced subgraph \((\widetilde{V}, \widetilde{E})\) and \(\widetilde{\tau }: \widetilde{V}\rightarrow S_k^1\) be the switching function that achieves the frustration index \(\iota ^s(\widetilde{V})\) in (3.1). Define the function \(\widetilde{f}: V\rightarrow \mathbb {C}\) via:

*Remark 4.5*

Since the signature is \(S_k^1\)-valued, the constant 2 in (4.21) can be slightly improved to be \(|1-\xi ^{(k-1)/2}|\) when *k* is odd.

For \(\Gamma =U(1)\) we have the following Cheeger’s inequality.

**Theorem 4.6**

*G*be a finite graph with signature \(s: E^{or} \rightarrow U(1)\). Then

The constant in the upper bound of (4.22) is slightly better than the constant in (4.1). This is due to Lemma 4.7 below.

**Lemma 4.7**

*Proof*

With this lemma at hand, the proofs of Theorems 4.1 and 4.6 are very similar. We omit the details but mention the following analogue of Lemma 4.4.

**Lemma 4.8**

*G*and \(f:V\rightarrow \mathbb {C}\) be a nonzero function. Then there exists \(t'\in [0, \max _{u\in V}|f(u)|^2]\) such that

*Remark 4.9*

*G*discussed by Bandeira, Singer and Spielman [4] to solve a partial synchronization problem. The connection Laplacian \(\mathcal {L}\) is defined for a simple graph

*G*where a matrix \(O_{uv}\in O(l)\) is assigned to each \((u,v)\in E^{or}\) such that \(O_{vu}=(O_{uv})^{-1}\). For any vector-valued function \(f: V\rightarrow \mathbb {R}^l\) and any vertex \(u\in V\), we then have

*G*with signature \(s: E^{or} \rightarrow U(1)\) we consider the particular positive measure \(\mu \) on

*V*defined as \(\mu (u):=d_u\) and rewrite the value \(s_{uv}:=a_{uv}+ib_{uv}\in U(1)\) for each \((u,v)\in E^{or}\) as

*(partial)*\(\ell _1\)-

*frustration constant*as

*G*(instead of

*O*(2)), we observe that

A direct corollary of Theorems 4.1 and 4.6 as well as Proposition 3.7 is the following characterization of the case that the first eigenvalue vanishes.

**Corollary 4.10**

\(\lambda _1(\Delta _{\mu }^s)=0\) if and only if the underlying graph has a balanced connected component.

We remark that Corollary 4.10 can also be easily derived by the min–max principle (2.8).

## 5 Spectral clustering via lens spaces and complex projective spaces

In this section, we prove the following higher order Cheeger inequalities.

**Theorem 5.1**

*G*with signature

*s*and all \(n \in [N]\), we have

Note that in Theorem 5.1 the signature group \(\Gamma \) can be either \(S_k^1\) or *U*(1).

The upper bound of \(h_n^s(\mu )\) in (5.1) is the essential part of Theorem 5.1 and its proof relies on the development of a proper spectral clustering algorithm for the operator \(\Delta _{\mu }^s\). In other words, we aim to find an *n*-subpartition \(\{ V_p \}_{[n]}\) with small constants \(\phi _{\mu }^s(V_p)\), based on the information contained in the eigenfunctions of the operator \(\Delta _{\mu }^s\).

*F*is also bounded by \(\lambda _n(\Delta _\mu ^s)\):

*n*maps \(\Psi _p: V \rightarrow {\mathbb C}^n\), \(p \in [n]\), with pairwise disjoint supports such that

- (1)
each \(\Psi _p\) can be viewed as a localization of

*F*, i.e., \(\Psi _p\) is the product of*F*and a cut-off function \(\eta : V\rightarrow \mathbb {R}\) (see 5.13 below), - (2)
each Rayleigh quotient satisfies \(\mathcal {R}_{\mu }^s(\Psi _p)\le C(n) \mathcal {R}_{\mu }^s(F)\), where

*C*(*n*) is a constant only depending on*n*.

This strategy is adapted from the proof of the higher order Cheeger inequalities for unsigned graphs due to Lee et al. [28, 29]. A critical new point here is to find a proper metric on the space of points \(\{F(u)|u\in V\}\subset \mathbb {C}^n\) for the spectral clustering algorithm. In other words, we need a proper metric to localize the map *F*. The original algorithm in [28, 29] used a spherical metric. The second author [32] studied a spectral clustering via metrics on real projective spaces to prove higher order dual Cheeger inequalities for unsigned graphs. Later in [3], the above two algorithms and, hence, the corresponding two kinds of inequalities, were unified in the framework of Harary’s signed graphs, i.e., graphs with signatures \(s: E^{or}\rightarrow \{+1,-1\}\). In particular, the metrics on real projective spaces were shown to be the proper metrics for clustering in the framework of signed graphs. In our current more general setting of graphs with signatures \(s:E^{or}\rightarrow \Gamma \), where \(\Gamma =S_k^1\) or \(\Gamma =U(1)\), the new metrics will be defined on lens spaces and complex projective spaces.

### 5.1 Lens spaces and complex projective spaces

In this subsection, we provide metrics of lens spaces and complex projective spaces for the spectral clustering algorithms in the case of \(\Gamma =S_k^1\) and \(\Gamma =U(1)\), respectively. Both lens spaces and complex projective spaces are important objects in geometry and topology. See, e.g., [26, Chapter 5] for details about these spaces.

*d*and \(d_{quot}\) on \(\mathbb {S}^{2n-1}/\Gamma \) are equivalent, i.e., there exist two constants \(c_1, c_2 > 0\) such that for all \([z_1], [z_2] \in S^{2n-1}/\Gamma \),

*B*in \(\mathbb {X}\) can be covered by \(\rho \) balls of half the radius of

*B*.

**Proposition 5.2**

*C*is an absolute constant.

*Proof*

*d*on \(\mathbb {S}^{2n-1}/\Gamma \) induces a pseudo metric on the space \(\mathbb {C}^n\setminus \{0\}\), which—by abuse of notation—will again be denoted by

*d*:

*d*on \(S^{2n-1}/\Gamma \) from (5.5). This reason will become clear in the next Sect. 5.2.

**Proposition 5.3**

The considerations of the next two subsections prepare the ground for the study of the Rayleigh quotient \(\mathcal {R}_{\mu }^s(F)\) of the map \(F: V\rightarrow \mathbb {C}^n\) defined in (5.2).

### 5.2 Localization of the map *F*

*d*via

*F*via \(\eta \) as

In the next lemma, \(G_F=(V_F,E_F)\) denotes the induced subgraph on \(V_F\) of *G*.

**Lemma 5.4**

*Proof*

*F*(

*v*) in (5.15) by \(s_{uv}F(v)\) and use Proposition 5.3 to obtain (5.14). By the definition of the metric

*d*, we obtain (5.15) as follows:

Lemma 5.4 enables us to prove the following result.

**Lemma 5.5**

*Proof*

*F*(

*u*) and

*F*(

*v*) is equal to zero, then the estimate (5.16) holds trivially. Hence, we suppose that \(u,v\in V_F\). W.l.o.g., we can assume that \(\Vert F(u)\Vert \le \Vert F(v)\Vert \) and calculate

Note that the inequality (5.16) is useful for the estimate of the numerator of the Rayleigh quotient of \(\Psi \).

### 5.3 Decomposition of the underlying space via orthonormal functions

For later purposes, we work on a general measure space \((\mathcal {V},\mu )\) in this subsection, where \(\mathcal {V}\) is a topological space and \(\mu \) is a Borel measure. Two particular cases we have in mind are a vertex set *V* of a finite graph with a measure \(\mu : V\rightarrow \mathbb {R}^+\), and a closed Riemannian manifold with its Riemannian volume measure. We will apply the results in this subsection to the latter case in Sect. 7.

*n*measurable functions

*x*,

*y*in \(\mathcal {V}_F:=\{x\in \mathcal {V}: F(x)\ne 0\}\), we have the distance between them

**Theorem 5.6**

*n*-subpartition \(\{T_i\}_{[n]}\) of \(\mathcal {V}_F\) such that

- (i)
\(d_F(T_p, T_q)\ge \frac{2}{C_0n^{5/2}}\), for all \(p,q\in [n]\), \(p\ne q\),

- (ii)
\(\mu _F(T_p)\ge \frac{1}{2n}\mu _F(\mathcal {V}_F)\), for all \(p\in [n]\).

The difficulty for the construction of the above *n*-subpartition is to achieve the property (*ii*). That is, we have to find a subpartition which possesses large enough measure. When \(d_F(x,y)\) is given by the spherical distance \(\left\| \frac{F(x)}{\Vert F(x)\Vert }-\frac{F(y)}{\Vert F(y)\Vert }\right\| \), Theorem 5.6 was proved in [28, 29, Lemma 3.5]. In our situation, we have to deal with the metrics, given in (5.17), of lens spaces or complex projective spaces. We refer the reader to [18] for another interesting decomposition result.

An important ingredient of the proof is the following lemma derived from the random partition theory [20, 30]. Note that a partition of a set *A* can also be considered as a map \(P:A\rightarrow 2^A\), where \(x\in A\) is mapped to the unique set *P*(*x*) of the partition that contains *x*. A random partition \(\mathcal {P}\) of *A* is a probability measure \(\nu \) on a set of partitions of *A*. Then \(\mathcal {P}(x)\) is understood as a random variable from the probability space to subsets of *A* containing *x*.

**Lemma 5.7**

*d*recall 5.5). Then for every \(r>0\) and \(\delta \in (0,1)\), there exists a random partition \(\mathcal {P}\) of

*A*, i.e., a distribution \(\nu \) over partitions of

*A*such that

- (i)
\(\mathrm {diam}(S)\le r\) for any

*S*in every partition*P*in the support of \(\nu \), - (ii)
\(\mathbb {P}_{\nu }\left[ B_{r/\alpha }(x)\subseteq \mathcal {P}(x)\right] \ge 1-\delta \) for all \(x\in A\), where \(\alpha =32\log _2(\rho _{\Gamma })/\delta \).

*r*/ 4-net of \(\mathbb {S}^{2n-1}/\Gamma \), that is, \(d(x_i, x_j)\ge r/4\), for any \(i\ne j\), and \(\mathbb {S}^{2n-1}/\Gamma =\bigcup _{i\in [m]}B_{r/4}(x_i)\). Since \((\mathbb {S}^{2n-1}/\Gamma , d)\) is compact,

*m*is a finite number. For \(R\in [r/4,r/2]\), we construct a partition of \((\mathbb {S}^{2n-1}/\Gamma , d)\) as follows. A permutation \(\sigma \) of the set [

*m*] provides an order for all points in the net which is used to define, for every \(i\in [m]\),

*x*is contained in \(B_R(x_i)\). Then \(P^{R,\sigma }=\{S_{i}^{R,\sigma }\}_{[m]}\) constitutes a partition of \(\mathbb {S}^{2n-1}/\Gamma \). Now let \(\sigma \) be a uniformly random permutation of [

*m*], and

*R*be chosen uniformly random from the interval [

*r*/ 4,

*r*/ 2]. These choices define a random partition \(\mathcal {P}\). If we choose

*R*uniformly from a fine enough discretization of the interval [

*r*/ 4,

*r*/ 2], we can make \(\mathcal {P}\) to be finitely supported. In fact, this random partition fulfills the two properties in Lemma 5.7.

*Remark 5.8*

Lemma 5.7 holds true for any metric space. In particular, the finiteness of the *r* / 4-net is not necessary. This is shown in [30, Lemma 3.11].

Lemma 5.7 leads to the following result. Note that, the property (*ii*) in Lemma 5.7 ensures the existence of at least one subpartition which captures a large fraction of the whole measure.

**Lemma 5.9**

- (i)
\(\mathrm {diam}(\widehat{S}_i, d_F)\le r\) for any \(i\in [m]\),

- (ii)
\(d_F(\widehat{S}_i, \widehat{S}_j)\ge 2r/\alpha \), where \(\alpha =32\log _2(\rho _\Gamma )/\delta \),

- (iii)
\(\sum _{i\in [m]}\mu _F(\widehat{S}_i)\ge (1-\delta )\mu _F(\mathcal {V}_F)\).

*Proof*

*F*. Let \(I_{B_{r/\alpha }(x)\subseteq \mathcal {P}(x)}\) be the indicator function for the event that \(B_{r/\alpha }(x)\subseteq \mathcal {P}(x)\) happens. Then we obtain from Lemma 5.7 (

*ii*)

*m*such that

In order to prove Theorem 5.6, we also need the following result.

**Lemma 5.10**

*Proof*

*Proof of Theorem 5.6*

*l*, such that

*ii*). One can then verify the property (

*i*) by Proposition 5.2 and Lemma 5.9. \(\square \)

### 5.4 Proof of Theorem 5.1

*S*there by \(T_p\)). Then the maps \(\Psi _p:=\eta _{p}F\), \(p\in [n]\), have pairwise disjoint support. Recalling that \(\Psi _p|_{T_p}=F|_{T_p}\), and applying Lemma 5.5 as well as fact (

*ii*) of Theorem 5.6, we obtain that for any \(p\in [n]\),

*C*is an absolute constant. For every \(p\in [n]\), the map \(\Psi _p\) has at least one coordinate function \(\psi _p\) that satisfies \(\mathcal {R}_{\mu }^s(\psi _p) \le \mathcal {R}_{\mu }^s(\Psi _p)\). In particular, we find functions \(\psi _p\), \(p\in [n]\), with pairwise disjoint support and an absolute constant

*C*such that

*n*-way Cheeger constant \(h_n^{s}(\mu )\) is achieved by the nontrivial

*n*-subpartition \(\{\widetilde{V}_p\}_{[n]}\) and that the function \(\widetilde{\tau }_p: \widetilde{V}_p\rightarrow \Gamma \) achieves the frustration index \(\iota ^s(\widetilde{V}_p)\) for each \(p\in [n]\). Moreover, consider functions \(\widetilde{f}_p: V \rightarrow {\mathbb C}\) with pairwise disjoint support given for \(p\in [n]\) by:

## 6 Application: spectral clustering on oriented graphs and mixed graphs

In this section, we discuss an application of the Cheeger inequalities (and their proofs) in the case \(\Gamma = S_k^1\). These results indicate algorithms to find interesting substructures in an oriented graph or a mixed graph.

### 6.1 Generalization of Harary’s balance theorem

Let us first discuss an equivalent definition of the Cheeger constant \(h_1^s(\mu )\) if \(\Gamma =S_k^1\). For a nonempty subset \(\widetilde{V}\) of *V*, let \(\widetilde{V}_{0},\ldots ,\widetilde{V}_{k-1}\) be an *ordered k-partition* of \(\widetilde{V}\), that is, \(\widetilde{V}_{i}\) are pairwise disjoint sets and their union is \(\widetilde{V}\). In contrast to a nontrivial *k*-partition, all but one \(\widetilde{V}_{i}\) may be empty. We write \(\mathscr {V}_k(\widetilde{V})\) for an ordered *k*-partition \(\widetilde{V}_{0},\ldots ,\widetilde{V}_{k-1}\) of \(\widetilde{V}\).

*k*-partition \(\mathscr {V}_k(\widetilde{V})\) of \(\widetilde{V} \subseteq V\), we define, for \(0\le i,j \le k-1\) and \(l\in {\mathbb Z}\),

**Definition 6.1**

*G*be a finite graph with signature \(s:E^{or}\rightarrow S_k^1\). For any nonempty subset \(\widetilde{V}\) of

*V*, the

*k-partiteness ratio*of an ordered

*k*-partition \(\mathscr {V}_k(\widetilde{V})\) of \(\widetilde{V}\) is defined as

*minimal k-partiteness ratio*\(\beta _{\mu }^{s}(\widetilde{V},k)\) of \(\widetilde{V}\) is defined as

*k*-partitions \(\mathscr {V}_k(\widetilde{V})\) of \(\widetilde{V}\).

The next goal is to prove that the Cheeger constant for \(\Gamma = S_k^1\) can also be expressed in terms of the k-partiteness ratio, see Corollary 6.3 below.

**Lemma 6.2**

*G*be a finite graph with signature \(s:E^{or} \rightarrow S_k^1\). For any nonempty \(\widetilde{V} \subseteq V\), we have

*Proof*

*k*-partition \(\mathscr {V}_k(\widetilde{V})\) of \(\widetilde{V}\) given by

*k*-partitions of \(\widetilde{V}\) given by (6.5) is one-to-one. Hence, we obtain by definition of the frustration index

**Corollary 6.3**

*G*be a finite graph with signature \(s: E^{or} \rightarrow S_k^1\). Then

This enables us to prove the following structural balance theorem.

**Theorem 6.4**

*G*be a finite connected graph with a signature \(s: E^{or} \rightarrow S_k^1\). Then the following statements are equivalent:

- (i)
The signature

*s*is balanced. - (ii)
There exists an ordered

*k*-partition \(V_0, \ldots , V_{k-1}\) of*V*such that all edges that begin in \(V_i\) and terminate in \(V_j\) have signature \(\xi ^{i-j}\) for all \(0\le i,j\le k-1\).

*Proof*

Recall that \(h_1^s(\mu )=0\) if and only if the signature is balanced. The theorem is then a direct consequence of (6.8). \(\square \)

*Remark 6.5*

Harary’s balance theorem [21] states that a signature \(s:E^{or}\rightarrow \{\pm 1\}\) is balanced if and only if there exists a bipartition \(V_0, V_1\) of *V* such that an edge has signature \(-1\) if and only if it has one end point in \(V_0\) and one in \(V_1\). Theorem 6.4 is a natural generalization of Harary’s theorem.

*i*,

*j*, the class of edges with endpoints in \(V_i\) and \(V_j\) are represented by an oriented edge that begins in \(V_i\) and terminates in \(V_j\) with \(i<j\). These oriented edges are labeled by \(\xi ^{i-j}\).

### 6.2 Finding a good substructure

The proof of Cheeger’s inequality in Sect. 4, especially Lemma 4.4, actually indicates an algorithm to find a subset \(\widetilde{V} \subseteq V\) with a constant \(\phi _{\mu }^s(\widetilde{V})\) close to the Cheeger constant \(h_1^s(\mu )\) of *G*. In other words, \(\phi _{\mu }^s(\widetilde{V})\) is not larger than the upper bound for \(h_1^s(\mu )\) given in Cheeger’s inequality (Theorem 4.1): for every nonzero function \(f: V \rightarrow {\mathbb C}\), Lemma 4.4 provides a nonempty subset \(\widetilde{V} := V^f(\sqrt{t'}) \subseteq V\) satisfying (4.14). If we choose *f* to be the eigenfunction corresponding to \(\lambda _1(\Delta _\mu ^s)\), we see that \(\widetilde{V}\) is a nonempty subset of *V* with the required property.

Now consider a finite graph *G* with a *k*-cyclic signature *s*. From Lemma 6.2, we know that \(\phi _\mu ^s(\widetilde{V})\) agrees with the minimum of the *k*-partiteness ratios of all ordered *k*-partitions \(\mathscr {V}_k(\widetilde{V})\). Having found a nonempty subset \(\widetilde{V} := V^f(\sqrt{t'}) \subseteq V\) satisfying (4.14), we explain in this subsection, how to find a finer substructure of \(\widetilde{V}\), namely an ordered *k*-partition \(\mathscr {V}_k(\widetilde{V})\) with a *k*-partiteness ratio that is at most the upper bound given in (4.14). The precise statement is given in Proposition 6.6 below.

*k*-partition \(\mathscr {V}_k(V^f(\sqrt{t},\theta ))\) of \(V^f(\sqrt{t},\theta )\subseteq V\) by

**Proposition 6.6**

*G*. For any nonzero function \(f:V\rightarrow \mathbb {C}\) with \(\max _{u\in V}|f(u)|=1\), there exist \(t'\in [0, 1]\) and \(\theta '\in [0,2\pi )\) such that

*Proof*

This Proposition provides the following spectral clustering algorithm to find an ordered *k*-subpartition of *V* with a *k*-partiteness ratio bounded above by the upper bound in Cheeger’s inequality. Firstly, find the eigenfunction \(f_1: V\rightarrow \mathbb {C}\) corresponding to \(\lambda _1(\Delta _{\mu }^s)\). For convenience, we can normalize \(f_1\) such that \(\max _{u\in V}|f(u)|=1\). Secondly, find the required ordered *k*-subpartion from the sets (6.9) by running over fine enough discretizations of the parameters *t* and \(\theta \).

### 6.3 Applications to partially oriented graphs

*mixed graphs*instead of undirected graphs which are studied in scheduling problems, for example [45, 52]. Recall that a

*mixed graph*is a graph \(G=(V, E_U\cup E_O)\) that consists of unoriented edges (the set \(E_U\)) as well as oriented edges (the set \(E_O\)) such that no two vertices \(u,v \in V\) form more than one edge of \(E_U \cup E_O\). As mentioned in the introduction, we call such a graph also

*partially oriented*. Clearly, a partially oriented graph is an

*oriented graph*if and only if \(E_U=\emptyset \). The algorithm discussed in the previous subsection has interesting applications for partially oriented graphs.

*k*, we now want to find a nonempty subset \(\widetilde{V} \subseteq V\) and an ordered

*k*-subpartition \(\mathscr {V}_k(\widetilde{V})=\{V_0, V_1, \ldots , V_{k-1}\}\) of \(\widetilde{V}\) which approximates the following ideal substructure:

- (i)
The subset \(\widetilde{V}\) has empty boundary.

- (ii)
An edge \(e\in E_U \cup E_O\) with endpoints \(u,v\in V_i\) for some \(0\le i\le k-1\) is unoriented, that is, \(e\in E_U\).

- (iii)
The partially oriented subgraph \(G_{\widetilde{V}}\) induced by \(\widetilde{V}\) has the following

*cyclic property*: the only oriented edges of \(G_{\widetilde{V}}\) begin in \(V_i\) and end in \(V_{i-1}\) for some \(0\le i\le k-1\) where we identify \(V_{-1}\) and \(V_{k-1}\).

*k*-cyclic signature

*s*from a given partially oriented graph \(G=(V,E_U \cup E_O)\). More precisely, we consider the new edge set \(E:=E_U\cup E_O\) where the orientations in \(E_O\) are dropped and define a signature \(s: E^{or}\rightarrow S_k^1\) by assigning to every edge \(\{u,v\}\in E\) the value

*G*is set up in such a way that the signature is balanced if and only if

*G*has the above ideal structure. Using the eigenfunction of the eigenvalue \(\lambda _1(\Delta _{\mu }^s)\), we apply the spectral clustering algorithm discussed in the Sect. 6.2 to find a

*k*-subpartition \(\mathscr {V}_k(\widetilde{V})\) of some \(\widetilde{V} \subseteq V\) with

*k*-partiteness ratio \(\beta _\mu ^s(\mathscr {V}_k(\widetilde{V}))\) at most the upper bound given in Cheeger’s inequality. Note that the

*k*-partiteness ratio can be viewed as a measure to quantify the quality of an approximation to the ideal case which is achieved if and only if \(\beta _\mu ^s(\mathscr {V}_k(\widetilde{V})) = 0\). By Corollary 6.3, the

*k*-partiteness ratio \(\beta _\mu ^s(\mathscr {V}_k(\widetilde{V}))\) is bounded from below by the Cheeger constant \(h_1^s(\mu )\).

We remark that in the special situation were we start with an oriented graph, the ordered *k*-subpartition \(V_0, V_1, \ldots , V_{k-1}\) of *V* approximates an ideal substructure with no edges having both endpoints in \(V_i\) for some \(0\le i\le k-1\).

These considerations can clearly be extended to obtain multi-way spectral clustering algorithms. Combining the method here with the spectral clustering via metrics on lens spaces in Sect. 5, we can find *n* subgraphs where each subgraph defines a sparse cut and approximates an ideal substructure as described above.

## 7 Magnetic Laplacians on Riemannian manifolds

In this section, we transfer the ideas related to Cheeger constants and Cheeger inequalities from discrete magnetic Laplacians to the Riemannian setting.

*M*be a closed connected Riemannian manifold. We consider a real smooth 1-form \(\varvec{\alpha }\) and the corresponding

*magnetic Laplacian*\(\Delta ^{\varvec{\alpha }}\) on

*M*, defined as

*d*is the exterior differential, maps smooth complex valued functions to smooth complex valued 1-forms and \(D^*\) is the formal adjoint of

*D*w.r.t. the \(L^2\)-inner product of functions and 1-forms:

*magnetic potential*. One can check that for any smooth function \(f: M\rightarrow \mathbb {C}\),

*M*is compact, \(\Delta ^{\varvec{\alpha }}\) has only discrete spectrum, and the eigenvalues can be listed with multiplicity as follows (see [47, Theorem 2.1])

*U*(1) as a subset \(\{z\in \mathbb {C}\mid |z|=1\}\) of \(\mathbb {C}\) and denote the set of smooth maps from

*M*to

*U*(1) by \(C^{\infty }(M, U(1))\). For \(\tau \in C^{\infty }(M, U(1))\), we then define by

**Theorem 7.1**

- (i)
\(\lambda _1(\Delta ^{\varvec{\alpha }})=0\);

- (ii)
\(\varvec{\alpha }\in \mathfrak {B}\);

- (iii)
\(d\varvec{\alpha }=0\) and \(\int _C\varvec{\alpha }=0\mod 2\pi \), for any closed curve

*C*in*M*.

This result can be compared with Corollary 4.10: the set \(\mathfrak {B}\) is comparable to the set of balanced signatures in the discrete setting. Locally, we can find a smooth real-valued function \(\theta \) such that \(\tau =e^{i\theta }\) and \(\varvec{\alpha }_{\tau }=d\theta \).

*gauge transformations*in the smooth setting. Recall that a gauge transformation

**Definition 7.2**

*M*. For any nonempty Borel subset \(\Omega \subseteq M\), the

*frustration index*\(\iota ^{\varvec{\alpha }}(\Omega )\) of \(\Omega \) is defined as

Clearly, the frustration index \(\iota ^{\varvec{\alpha }}(\Omega )\) is invariant under gauge transformations of the potential \(\varvec{\alpha }\). Roughly speaking, the frustration index measures how far the potential \(\varvec{\alpha }\) is from the set \(\mathfrak {B}_{\Omega }\).

*r*-neighborhood of \(\Omega \). Let us denote

**Definition 7.3**

*M*be a closed Riemannian manifold with a magnetic potential \(\varvec{\alpha }\). The

*n-way Cheeger constant*\(h_n^{\varvec{\alpha }}\) is defined as

*n*-subpartitions \(\{\Omega _p\}_{[n]}\) of

*M*with \(\mathrm {vol}(\Omega _p)>0\) for every \(p\in [n]\).

In particular, the Cheeger constant \(h_1^{\varvec{\alpha }}\) vanishes if and only if \(\varvec{\alpha }\in \mathfrak {B}\). We prove the following lower bound for the first eigenvalue \(\lambda _1(\Delta ^{\varvec{\alpha }})\).

**Theorem 7.4**

*M*. Then we have

We first prove the following Lemma which is an analogue of Lemma 4.3.

**Lemma 7.5**

*M*. For any nonzero smooth function \(f: M\rightarrow \mathbb {C}\), we have

*Proof*

For convenience, we denote \(f_0:=|f|\). W.l.o.g., we assume that \(f_0(x)>0\), for any \(x\in M\). Otherwise, we first consider integration over \(\Omega ^f(\varepsilon )\) in the right hand side of (7.15), \(\varepsilon >0\), and then let \(\varepsilon \rightarrow 0\).

*f*, we have the following associated 1-form in \(\mathfrak {B}\):

Similarly as in Sect. 4 for the discrete setting, we derive the following lemma from the coarea inequality, which is the continuous analogue of Lemma 4.8.

**Lemma 7.6**

*M*. For any nonzero smooth function \(f: M\rightarrow \mathbb {C}\), there exists \(t'\in [0,\max _{x\in M}|f(x)|^2]\) such that

*Proof*

Theorem 7.4 is proved by applying Lemma 7.6 to the corresponding eigenfunction of \(\lambda _1(\Delta ^{\varvec{\alpha }})\). We also have the following higher order Cheeger inequalities for the magnetic Laplacian \(\Delta ^{\varvec{\alpha }}\).

**Theorem 7.7**

*M*with a magnetic potential \(\varvec{\alpha }\) and \(n \in {\mathbb N}\), we have

**Lemma 7.8**

*Proof*

*x*

Note that the pseudometric (7.26) induced from the metric on a complex projective space played an important role in the proof.

*Proof of Theorem 7.7*

- (i)
\(d_F(T_p, T_q)\ge \frac{2}{C_0n^{5/2}}\), for all \(p,q\in [n]\), \(p\ne q\),

- (ii)
\(\int _{T_p}\Vert F(x)\Vert ^2dx\ge \frac{1}{2n}\int _M\Vert F(x)\Vert ^2dx\), for all \(p\in [n]\),

## Notes

### Acknowledgments

We like to express our gratitude to Afonso S. Bandeira for pointing out the relation between magnetic and connection Laplacians and useful references. SL is very grateful to Alexander Grigor’yan for inspiring discussions about decompositions of spaces. CL, SL and NP acknowledge the support of the EPSRC Grant EP/K016687/1 “Topology, Geometry and Laplacians of Simplicial Complexes”. CL also acknowledges the support of the SFB TRR109 “Discretization in Geometry and Dynamics”, the kind hospitality of the Department of Mathematical Sciences of Durham University and of the Grey College.

### References

- 1.Alon, N.: Eigenvalues and expanders. Combinatorica
**6**(2), 83–96 (1986)MATHMathSciNetCrossRefGoogle Scholar - 2.Alon, N., Milman, V.: \(\lambda _1\), isoperimetric inequalities for graphs, and superconcentrators. J. Combin. Theory Ser. B
**38**(1), 73–88 (1985)MATHMathSciNetCrossRefGoogle Scholar - 3.Atay, F.M., Liu, S.: Cheeger constants, structural balance, and spectral clustering analysis for signed graphs. arXiv:1411.3530. (2014)
- 4.Bandeira, A.S., Singer, A., Spielman, D.A.: A Cheeger inequality for the graph connection Laplacian. SIAM J. Matrix Anal. Appl.
**34**(4), 1611–1630 (2013)MATHMathSciNetCrossRefGoogle Scholar - 5.Bauer, F., Jost, J.: Bipartite and neighborhood graphs and the spectrum of the normalized graph Laplacian. Commun. Anal. Geom.
**21**(4), 787–845 (2013)MATHMathSciNetCrossRefGoogle Scholar - 6.Bauer, F., Keller, M., Wojciechowski, R.K.: Cheeger inequalities for unbounded graph Laplacians. J. Eur. Math. Soc. (JEMS)
**17**(2), 259–271 (2015)MATHMathSciNetCrossRefGoogle Scholar - 7.Cheeger, J.: A lower bound for the smallest eigenvalue of the Laplacian, Problems in analysis (Papers dedicated to Salomon Bochner, 1969), pp. 195–199, Princeton Univ. Press, Princeton, NJ (1970)Google Scholar
- 8.Coifman, R., Weiss, G.: Analyse harmonique non-commutative sur certains espaces homogènes. Lecture Notes in Mathematics, vol. 242. Springer, Berlin-New York (1971)Google Scholar
- 9.Colin de Verdière, Y., Torki-Hamza, N., Truc, F.: Essential self-adjointness for combinatorial Schrödinger operators III-Magnetic fields. Ann. Fac. Sci. Toulouse Math. (6) 20(3), 599–611 (2011)Google Scholar
- 10.Desai, M., Rao, V.: A characterization of the smallest eigenvalue of a graph. J. Graph Theory
**18**(2), 181–194 (1994)MATHMathSciNetCrossRefGoogle Scholar - 11.Dodziuk, J.: Difference equations, isoperimetric inequality and transience of certain random walks. Trans. Am. Math. Soc.
**284**(2), 787–794 (1984)MATHMathSciNetCrossRefGoogle Scholar - 12.Dodziuk, J., Mathai, V.: Kato’s inequality and asymptotic spectral properties for discrete magnetic Laplacians. The ubiquitous heat kernel (Boulder, CO, 2003), 69–81, Contemp. Math., 398, Am. Math. Soc. Providence, RI (2006)Google Scholar
- 13.Erdős, L.: Rayleigh-type isoperimetric inequality with a homogeneous magnetic field. Calc. Var.
**4**, 283–292 (1996)CrossRefGoogle Scholar - 14.Frank, R.L., Laptev, A., Molchanov, S.: Eigenvalue estimates for magnetic Schrödinger operators in domains. Proc. Am. Math. Soc.
**136**(12), 4245–4255 (2008)MATHMathSciNetCrossRefGoogle Scholar - 15.Funano, K.: Eigenvalues of Laplacian and multi-way isoperimetric constants on weighted Riemannian manifolds. arXiv:1307.3919v1. (2013)
- 16.Funano, K., Shioya, T.: Concentration, Ricci curvature, and eigenvalues of Laplacian. Geom. Funct. Anal.
**23**(3), 888–936 (2013)MATHMathSciNetCrossRefGoogle Scholar - 17.Golénia, S.: Hardy inequality and asymptotic eigenvalue distribution for discrete Laplacians. J. Funct. Anal.
**266**, 2662–2688 (2014)MATHMathSciNetCrossRefGoogle Scholar - 18.Grigor’yan, A., Netrusov, Y., Yau, S.-T.: Eigenvalues of elliptic operators and geometric applications. Surveys in differential geometry. Vol. IX, pp. 147–217. Int. Press, Somerville, MA (2004)Google Scholar
- 19.Gross, J.L.: Voltage graphs. Discr. Math.
**9**, 239–246 (1974)MATHCrossRefGoogle Scholar - 20.Gupta, A., Krauthgamer, R., Lee, J.R.: Bounded geometries, fractals, and low-distortion embeddings In: 2003 IEEE 44th annual symposium on foundations of computer science-FOCS 2003. IEEE Computer Soc., pp. 534–543. Washington, DC(2003)Google Scholar
- 21.Harary, F.: On the notion of balance of a signed graph. Michigan Math. J.
**2**(2), 143–146 (1953)MathSciNetCrossRefGoogle Scholar - 22.Harary, F.: On the measurement of structural balance. Behav. Sci.
**4**, 316–323 (1959)CrossRefGoogle Scholar - 23.Harary, F., Palmer, E.: Enumeration of mixed graphs. Proc. Am. Math. Soc.
**17**, 682–687 (1966)MATHMathSciNetCrossRefGoogle Scholar - 24.Hinz, M., Teplyaev, A.: Dirac and magnetic Schrödinger operators on fractals. J. Funct. Anal.
**265**, 2830–2854 (2013)MATHMathSciNetCrossRefGoogle Scholar - 25.Hoory, S., Linial, N., Wigderson, A.: Expander graphs and their applications. Bull. Am. Math. Soc.
**43**(4), 439–561 (2006)MATHMathSciNetCrossRefGoogle Scholar - 26.Jost, J.: Riemannian Geometry and Geometric Analysis, 4th edn. Universitext, Springer, Berlin (2005)Google Scholar
- 27.Kwok, T.-C., Lau, L.-C., Lee, Y.-T., Oveis Gharan, S., Trevisan, L.: Improved Cheeger’s inequality: analysis of spectral partitioning algorithms through higher order spectral gap. In: STOC’13-proceedings of the 2013 ACM symposium on theory of computing, 11–20, ACM, New York (2013)Google Scholar
- 28.Lee, J. R., Oveis Gharan, S., Trevisan, L.: Multi-way spectral partitioning and higher-order Cheeger inequalities. In: STOC’12-proceedings of the 2012 ACM symposium on theory of computing, 1117–1130, ACM, New York (2012)Google Scholar
- 29.Lee, J. R., Oveis Gharan, S., Trevisan, L.: Multiway spectral partitioning and higher-order Cheeger inequalities. J. ACM
**61**(6), 37:1–30 (2014)Google Scholar - 30.Lee, J.R., Naor, A.: Extending Lipschitz functions via random metric partitions. Invent. Math.
**160**(1), 59–95 (2005)MATHMathSciNetCrossRefGoogle Scholar - 31.Lieb, E., Loss, M.: Fluxes, Laplacians, and Kasteleyn’s theorem. Duke Math. J.
**71**(2), 337–363 (1993)MATHMathSciNetCrossRefGoogle Scholar - 32.Liu, S.: Multi-way dual Cheeger constants and spectral bounds of graphs. Adv. Math.
**268**, 306–338 (2015)MATHMathSciNetCrossRefGoogle Scholar - 33.Liu, S.: An optimal dimension-free upper bound for eigenvalue ratios. arXiv:1405.2213. (2014)
- 34.Liu, S., Peyerimhoff, N.: Eigenvalue ratios of nonnegatively curved graphs. arXiv:1406.6617. (2014)
- 35.Liu, S., Peyerimhoff, N., Vdovina, A.: Signatures, lifts and eigenvalues of graphs. arXiv:1412.6841. (2014)
- 36.von Luxburg, U.: A tutorial on spectral clustering. Stat. Comput.
**17**(4), 395–416 (2007)MathSciNetCrossRefGoogle Scholar - 37.Marcus, A.W., Spielman, D.A., Srivastava, N.: Interlacing families I: bipartite Ramanujan graphs of all degrees. In: 2013 IEEE 54th annual symposium on foundations of computer science - FOCS 2013. IEEE Computer Soc., pp 529–537. Los Alamitos, CA (2013)Google Scholar
- 38.Marcus, A.W., Spielman, D.A., Srivastava, N.: Interlacing families I: bipartite Ramanujan graphs of all degrees. Ann. Math.
**182**, 307–325 (2015)Google Scholar - 39.Miclo, L.: On eigenfunctions of Markov processes on trees. Probab. Theory Rel Fields
**142**(3–4), 561–594 (2008)MATHMathSciNetCrossRefGoogle Scholar - 40.Miclo, L.: On hyperboundedness and spectrum of Markov operators. Invent. Math.
**200**(1), 311–343 (2015)MathSciNetCrossRefGoogle Scholar - 41.Morame, A., Truc, F.: Counting function of the embedded eigenvalues for some manifold with cusps, and magnetic Laplacian. Math. Res. Lett.
**19**(2), 417–429 (2012)MATHMathSciNetCrossRefGoogle Scholar - 42.Nicaise, S.: Spectre des réseaux topologiques finis. Bull. Sci. Math. (2)
**111**(4), 401–413 (1987)MATHMathSciNetGoogle Scholar - 43.Paternain, G.P.: Schrödinger operators with magnetic fields and minimal action functionals. Israel J. Math.
**123**, 1–27 (2001)MATHMathSciNetCrossRefGoogle Scholar - 44.Post, O.: Spectral analysis of metric graphs and related spaces. In: Arzhantseva, G., Valette, A. (eds.) Limits of graphs in group theory and computer science, pp. 109–140. EPFL Press, Lausanne, (2009)Google Scholar
- 45.Ries, B.: Coloring some classes of mixed graphs. Discr. Appl. Math.
**155**(1), 1–6 (2007)MATHMathSciNetCrossRefGoogle Scholar - 46.Sadeghi, K., Lauritzen, S.: Markov properties for mixed graphs. Bernoulli
**20**(2), 676–696 (2014)MATHMathSciNetCrossRefGoogle Scholar - 47.Shigekawa, I.: Eigenvalue problems for the Schrödinger operator with the magnetic field on a compact Riemannian manifold. J. Funct. Anal.
**75**(1), 92–127 (1987)MATHMathSciNetCrossRefGoogle Scholar - 48.Shubin, M.A.: Discrete magnetic Laplacian. Commun. Math. Phys.
**164**(2), 259–275 (1994)MATHMathSciNetCrossRefGoogle Scholar - 49.Shubin, M.A.: Essential self-adjointness for semi-bounded magnetic Schrödinger operators on non-compact manifolds. J. Funct. Anal.
**186**(1), 92–116 (2001)MATHMathSciNetCrossRefGoogle Scholar - 50.Simon, B., Høegh-Krohn, R.: Hypercontractive semigroups and two dimensional self-coupled Bose fields. J. Funct. Anal.
**9**, 121–180 (1972)MATHCrossRefGoogle Scholar - 51.Singer, A., Wu, H.-T.: Vector diffusion maps and the connection Laplacian. Commun. Pure Appl. Math.
**65**(8), 1067–1144 (2012)MATHMathSciNetCrossRefGoogle Scholar - 52.Sotskov, Y.N.: Scheduling via mixed graph coloring. In: Operations research proceedings 1999 (Magdeburg), 414–418. Springer, Berlin (2000)Google Scholar
- 53.Sunada, T.: A discrete analogue of periodic magnetic Schrödinger operators. Geometry of the spectrum (Seattle, WA, 1993), 283–299, Contemp. Math., 173, Am. Math. Soc., Providence, RI (1994)Google Scholar
- 54.Trevisan, L.: Max cut and the smallest eigenvalue. In: STOC’09-Proceedings of the 2009 ACM international symposium on theory of computing, 263–271, ACM, New York (2009)Google Scholar
- 55.Trevisan, L.: Max cut and the smallest eigenvalue. SIAM J. Comput.
**41**(6), 1769–1786 (2012)MATHMathSciNetCrossRefGoogle Scholar - 56.Vannimenus, J., Toulouse, G.: Theory of the frustration effect: II. Ising spins on a square lattice. J. Phys. C: Solid State Phys.
**10**, L537 (1977)CrossRefGoogle Scholar - 57.Wang, F.-Y.: Criteria of spectral gap for Markov operators. J. Funct. Anal.
**266**, 2137–2152 (2014)MATHMathSciNetCrossRefGoogle Scholar - 58.Zaslavsky, T.: Signed graphs. Discr. Appl. Math.
**4**(1), 47–74 (1982)MATHMathSciNetCrossRefGoogle Scholar - 59.Zaslavsky, T.: Matrices in the theory of signed simple graphs. Advances in discrete mathematics and applications (Mysore, 2008). Ramanujan Math. Soc. Lect. Notes Ser. 13. RamanujanMath. Soc., pp. 207–229. Mysore (2010)Google Scholar
- 60.Zhang, X.-D., Li, J.-S.: The Laplacian spectrum of a mixed graph. Linear Algebra Appl.
**353**, 11–20 (2002)MATHMathSciNetCrossRefGoogle Scholar

## Copyright information

**Open Access**This article is distributed under the terms of the Creative Commons Attribution 4.0 International
License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.