Searcharxiv⌕ Search

arXiv subjects

Shiping Liu

Publications and source records attributed to Shiping Liu.

At least 73 records · Page 4Linked to original sources

Cheeger constants, structural balance, and spectral clustering analysis for signed graphs

We introduce a family of multi-way Cheeger-type constants $\{h_k^σ, k=1,2,\ldots, n\}$ on a signed graph $Γ=(G,σ)$ such that $h_k^σ=0$ if and only if $Γ$ has $k$ balanced connected components. These constants are switching invariant and bring together in a unified viewpoint a number of important graph-theoretical concepts, including the classical Cheeger constant, those measures of bipartiteness introduced by Desai-Rao, Trevisan, Bauer-Jost, respectively, on unsigned graphs,, and the frustration index (originally called the line index of balance by Harary) on signed graphs. We further unify the (higher-order or improved) Cheeger and dual Cheeger inequalities for unsigned graphs as well as the underlying algorithmic proof techniques by establishing their corresponding versions on signed graphs. In particular, we develop a spectral clustering method for finding $k$ almost-balanced subgraphs, each defining a sparse cut. The proper metric for such a clustering is the metric on a real projective space. We also prove estimates of the extremal eigenvalues of signed Laplace matrix in terms of number of signed triangles ($3$-cycles).

math.CO↗

Rigidity of the Bonnet-Myers inequality for graphs with respect to Ollivier Ricci curvature

We introduce the notion of Bonnet-Myers and Lichnerowicz sharpness in the Ollivier Ricci curvature sense. Our main result is a classification of all self-centered Bonnet-Myers sharp graphs (hypercubes, cocktail party graphs, even-dimensional demi-cubes, Johnson graphs $J(2n,n)$, the Gosset graph and suitable Cartesian products). We also present a purely combinatorial reformulation of this result. We show that Bonnet-Myers sharpness implies Lichnerowicz sharpness. We also relate Bonnet-Myers sharpness to an upper bound of Bakry-Émery $\infty$-curvature, which motivates a generalconjecture about Bakry-Émery $\infty$-curvature.

math.CO↗

Comparative analysis of two discretizations of Ricci curvature for complex networks

We have performed an empirical comparison of two distinct notions of discrete Ricci curvature for graphs or networks, namely, the Forman-Ricci curvature and Ollivier-Ricci curvature. Importantly, these two discretizations of the Ricci curvature were developed based on different properties of the classical smooth notion, and thus, the two notions shed light on different aspects of network structure and behavior. Nevertheless, our extensive computational analysis in a wide range of both model and real-world networks shows that the two discretizations of Ricci curvature are highly correlated in many networks. Moreover, we show that if one considers the augmented Forman-Ricci curvature which also accounts for the two-dimensional simplicial complexes arising in graphs, the observed correlation between the two discretizations is even higher, especially, in real networks. Besides the potential theoretical implications of these observations, the close relationship between the two discretizations has practical implications whereby Forman-Ricci curvature can be employed in place of Ollivier-Ricci curvature for faster computation in larger real-world networks whenever coarse analysis suffices.

math.DG↗

Eigenvalue ratios of nonnegatively curved graphs

We derive an optimal eigenvalue ratio estimate for finite weighted graphs satisfying the curvature-dimension inequality $CD(0,\infty)$. This estimate is independent of the size of the graph and provides a general method to obtain higher order spectral estimates. The operation of taking Cartesian products is shown to be an efficient way for constructing new weighted graphs satisfying $CD(0,\infty)$. We also discuss a higher order Cheeger constant ratio estimate and related topics about expanders.

math.SP↗

Ricci-flat cubic graphs with girth five

We classify all connected, simple, 3-regular graphs with girth at least 5 that are Ricci-flat. We use the definition of Ricci curvature on graphs given in Lin-Lu-Yau, Tohoku Math., 2011, which is a variation of Ollivier, J. Funct. Anal., 2009. A graph is Ricci-flat, if it has vanishing Ricci curvature on all edges. We show, that the only Ricci-flat cubic graphs with girth at least 5 are the Petersen graph, the Triplex and the dodecahedral graph. This will correct the classification in Lin-Lu-Yau, Comm. Anal. Geom., 2014, that misses the Triplex.

math.CO↗

Curvature calculations for antitrees

In this article we prove that antitrees with suitable growth properties are examples of infinite graphs exhibiting strictly positive curvature in various contexts: in the normalized and non-normalized Bakry-Émery setting as well in the Ollivier-Ricci curvature case. We also show that these graphs do not have global positive lower curvature bounds, which one would expect in view of discrete analogues of the Bonnet-Myers theorem. The proofs in the different settings require different techniques.

math.CO↗

The Graph Curvature Calculator and the curvatures of cubic graphs

We classify all cubic graphs with either non-negative Ollivier-Ricci curvature or non-negative Bakry-Émery curvature everywhere. We show in both curvature notions that the non-negatively curved graphs are the prism graphs and the Möbius ladders. We also highlight an online tool for calculating the curvature of graphs under several variants of these curvature notions that we use in the classification. As a consequence of the classification result we show, that non-negatively curved cubic expanders do not exist.

math.CO↗

Magnetic sparseness and Schrödinger operators on graphs

We study magnetic Schrödinger operators on graphs. We extend the notion of sparseness of graphs by including a magnetic quantity called the frustration index. This notion of magnetic sparse turn out to be equivalent to the fact that the form domain is an $\ell^{2}$ space. As a consequence, we get criteria of discreteness for the spectrum and eigenvalue asymptotics.

math.SP↗

Bakry-Émery curvature functions of graphs

We study the Bakry-Émery curvature function $\mathcal{K}_{G,x}:(0,\infty]\to \mathbb{R}$ of a vertex $x$ in a locally finite graph $G$ systematically. Here $\mathcal{K}_{G,x}(\mathcal{N})$ is defined as the optimal curvature lower bound $\mathcal{K}$ in the Bakry-Émery curvature-dimension inequality $CD(\mathcal{K},\mathcal{N})$ that $x$ satisfies. We prove the curvature functions of the Cartesian product of two graphs $G_1,G_2$ equal an abstract product of curvature functions of $G_1,G_2$. We relate the curvature functions of $G$ with various spectral properties of (weighted) graphs constructed from local structures of $G$. We explore the curvature functions of Cayley graphs, strongly regular graphs, and many particular (families of) examples including Johnson graphs and complete bipartite graphs. We construct an infinite family of $6$-regular graphs which satisfy $CD(0,\infty)$ but are not Cayley graphs.

math.CO↗

Ollivier-Ricci idleness functions of graphs

We study the Ollivier-Ricci curvature of graphs as a function of the chosen idleness. We show that this idleness function is concave and piecewise linear with at most $3$ linear parts, with at most $2$ linear parts in the case of a regular graph. We then apply our result to show that the idleness function of the Cartesian product of two regular graphs is completely determined by the idleness functions of the factors.

math.CO↗

Rigidity properties of the hypercube via Bakry-Emery curvature

We give rigidity results for the discrete Bonnet-Myers diameter bound and the Lichnerowicz eigenvalue estimate. Both inequalities are sharp if and only if the underlying graph is a hypercube. The proofs use well-known semigroup methods as well as new direct methods which translate curvature to combinatorial properties. Our results can be seen as first known discrete analogues of Cheng's and Obata's rigidity theorems.

math.DG↗

Auslander-Reiten components with bounded short cycles

We study Auslander-Reiten components of an artin algebra with bounded short cycles, namely, there exists a bound for the depths of maps appearing on short cycles of non-zero non-invertible maps between modules in the given component. First, we give a number of combinatorial characteri\-zations of almost acyclic Auslander-Reiten components. Then, we show that an Auslander-Reiten component with bounded short cycles is closely related to the connec\-ting component of a tilted quotient algebra. In particular, the number of such components is finite and each of them is almost acyclic with only finitely many DTr-orbits. As an application, we show that an artin algebra is representation-finite if and only if its module category has bounded short cycles. This includes a well known result of Ringel's, saying that a representation-directed algebra is representation-finite.

math.RT↗

Bakry-Emery curvature and diameter bounds on graphs

We prove diameter bounds for graphs having positive Ricci-curvature bound in Bakry-Emery sense. One result using only curvature and maximal vertex degree is sharp in case of hypercubes. The other result depends on an additional dimension bound, but is independent of the vertex degree. In particular, the second result is the first Bonnet-Myers type theorem for unbounded graph Laplacians. Moreover, our results improve diameter bounds from [6] and [10].

math.DG↗

The bounded derived categories of an algebra with radical squared zero

Let $\La$ be an elementary locally bounded linear category over a field with radical squared zero. We shall show that the bounded derived category $D^b(\ModbLa)$ of finitely supported left $\La$-modules admits a Galois covering which is the bounded derived category of almost finitely co-presented representations of a gradable quiver. Restricting to the bounded derived category $D^b({\rm mod}^b\hspace{-2pt}\La)$ of finite dimensional left $\La$-modules, we shall be able to describe its indecomposable objects, obtain a complete description of the shapes of its Auslander-Reiten components, and classify those $\La$ such that $D^b({\rm mod}^b\hspace{-2.3pt}\La)$ has only finitely many Auslander-Reiten components.

math.RT↗

Curvature and higher order Buser inequalities for the graph connection Laplacian

We study the eigenvalues of the connection Laplacian on a graph with an orthogonal group or unitary group signature. We establish higher order Buser type inequalities, i.e., we provide upper bounds for eigenvalues in terms of Cheeger constants in the case of nonnegative Ricci curvature. In this process, we discuss the concepts of Cheeger type constants and a discrete Ricci curvature for connection Laplacians and study their properties systematically. The Cheeger constants are defined as mixtures of the expansion rate of the underlying graph and the frustration index of the signature. The discrete curvature, which can be computed efficiently via solving semidefinite programming problems, has a characterization by the heat semigroup for functions combined with a heat semigroup for vector fields on the graph.

math.SP↗

Frustration index and Cheeger inequalities for discrete and continuous magnetic Laplacians

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.

math.SP↗