DOCSLIB.ORG

Lecture 2: Spectra of Graphs 1 Definitions

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Lecture 2: Spectra of Graphs 1 Definitions Spectral Graph Theory and Applications WS 2011/2012 Lecture 2: Spectra of Graphs Lecturer: Thomas Sauerwald & He Sun Our goal is to use the properties of the adjacency/Laplacian matrix of graphs to first under- stand the structure of the graph and, based on these insights, to design efficient algorithms. The study of algebraic properties of graphs is called algebraic graph theory. One of the most useful algebraic properties of graphs are the eigenvalues (and eigenvectors) of the adjacency/Laplacian matrix. 1 Definitions Definition 2.1. Let G = (V; E) be an undirected graph with vertex set [n] := f1; : : : ; ng. The adjacency matrix of G is an n by n matrix A given by ( 1 if i and j are adjacent Ai;j = 0 otherwise If G is a multi-graph, then Ai;j is the number of edges between vertex i and vertex j. • The sum of elements in every row/column equals the degree of the corresponding vertex. • If G is undirected, then A is symmetric. Example. The adjacency matrix of a triangle is 0 0 1 1 1 @ 1 0 1 A 1 1 0 Definition 2.2. We define the Laplacian matrix L of graph G as follows: 8 deg(i) if i = j <> Li;j = −1 if i and j are adjacent :> 0 otherwise where deg(i) is the degree of vertex i. Let D be an n by n diagonal matrix with deg(1);:::; deg(n) as diagonal elements. We can rewrite L as L = D − A: In particular, if G is d-regular, then L = d · I − A. Given a matrix A, a vector x 6= 0 is defined to be an eigenvector of A if and only if there is a λ 2 C such that Ax = λx. In this case, λ is called an eigenvalue of A. 1 Definition 2.3 (graph spectrum). Let A be the adjacency matrix of an undirected graph G with n vertices. Then A has n real eigenvalues, denoted by λ1 ≥ · · · ≥ λn. These eigenvalues associated with their multiplicities compose the spectrum of G. Here are some basic facts about the graph spectrum. Lemma 2.4. Let G be any undirected simple graph with n vertices. Then Pn 1. i=1 λi = 0. Pn 2 Pn 2. i=1 λi = i=1 deg(i). 3. If λ1 = ··· = λn, then E[G] = ;. 4. degavg ≤ λ1 ≤ degmax. p 5. degmax ≤ λ1 ≤ degmax. Proof. We only prove the first three items. (1) Since G does not have self-loops, all the diagonal elements of A are zero. By the definition Pn Pn of trace, we have ı=1 λi = tr(A) = i=1 Ai;i = 0. Pn 2 2 Pn 2 2 (2) By the properties of matrix trace, we have ı=1 λi = tr A = i=1 Ai;i. Since Ai;i is the degree of vertex i, tr(A2) equals the sum of every vertex's degree in G. Pn (3) Combing i=1 λi = 0 with λ1 = ··· = λn, we have λi = 0 for every vertex i. By item (2), we have deg(i) = 0 for any vertex i. Therefore E[G] = ;. k For a graph G with adjacency matrix A and integer k ≥ 1, Au;v is the number of walks of length k from u to v . Pn p 1=p Let kxkp := ( i=1 jxij ) . Then for any 1 ≤ p ≤ q < 1, it holds that 1=p−1=q kxkq ≤ kxkp ≤ n · kxkq: Lemma 2.5. For any graph G with m edges, the number of cycles of length k in G is bounded by O mk=2. Proof. Let A be the adjacency matrix of G with eigenvalues λ1; : : : ; λn. Thus the number of k Pn k Ck (cycles of length k) in G is bounded by tr A =(2k) = i=1 λi =(2k). For any k ≥ 3, it holds that n !1=k n !1=k n !1=2 X k X k X 2 1=2 λi ≤ jλij ≤ jλij = (2 · m) : i=1 i=1 i=1 k k=2 k=2 Hence tr A ≤ (2m) and the number of Ck is at most O m . Example. Some examples for different spectra of graphs: • For the complete graph Kn, the eigenvalues are n − 1 with multiplicity 1 and −1 with multiplicity n − 1. p p • For the complete bipartite graph Km;n, the eigenvalues are + mn, − mn and 0 with multiplicity m + n − 2. • For the cycle Cn, the spectrum is 2 cos(2πj=n)(j = 0; 1; : : : ; n − 1). Two assumptions that we make throughout the course are as follows: 2 1. We only consider undirected graphs. Note that if G is not undirected, then A and L is not symmetric any more and the eigenvalues of A and L could be complex numbers. A matrix A = (ai;j)n×n is called a Hermitian matrix if ai;j = aj;i for any element ai;j. Hermitian matrices always have real eigenvalues. 2. Unless mentioned otherwise, we consider regular graphs. Lemma 2.6. Consider any undirected graph G with adjacency matrix A. 1. If G is d-regular, then λ1 = d and jλij ≤ d for i = 2; : : : ; n. 2. G is connected iff λ2 < d, i.e., the eigenvalue d has multiplicity 1. Moreover, the number of connected components of G equals the multiplicity of eigenvalue d. 3. If G is connected, then G is bipartite iff λn = −d. Lemma 2.7. All eigenvalues of L are non-negative. Proof. Follows from Lemma 2.6 and the definition of L = D − A. For studying regular graphs, it is convenient to work with the normalized adjacency matrix M of graph G. For any d-regular graph with adjacency matrix A, define 1 M := · A: d Throughout this course, we use λ1 ≥ · · · ≥ λn to denote the eigenvalues of matrix M of graph G. For regular graphs, λ1 = 1 and we mainly consider the second largest eigenvalue in absolute value. The formal definition is as follows. Definition 2.8 (spectral expansion). The spectral expansion of graph G is defined by λ := max fjλ2j; jλnjg, i.e. λ = max kAxk kxk=1;x?u Courant-Fischer Formula. Let B be an n by n symmetric matrix with eigenvalues λ1 ≤ · · · ≤ λn and corresponding eigenvectors v1; : : : ; vn. Then T T x Bx λ1 = min x Bx = min ; kxk=1 x6=0 xT · x T T x Bx λ2 = min x Bx = min ; kxk=1 x6=0 xT · x x?v1 x?v1 T T x Bx λn = max x Bx = max : kxk=1 x6=0 xTx It is well known that λ relates to various graph properties. In particular, we shall see that there is a close connection between λ and the expansion of the graph. Lemma 2.9. s n − d λ ≥ : d(n − 1) 3 2 Pn 2 2 Proof. Follows from tr M = n=d = i=1 λi ≤ 1 + (n − 1)λ . Theorem 2.10. [Alo86]p Any infinite family of d-regular graphs fGngn2N has spectral expansion (as n ! 1) at least 2 d − 1=d − o(1). Definitionp 2.11 (Ramanujan graphs). A family of d-regular graphs with spectral expansion at most 2 d − 1=d is called Ramanujan graphs. Although Friedman [Fri91] showed that random d-regular graphs are close to being Ramanu- jan in the sense that λ satisfies p λ ≤ 2 d − 1=d + 2 log(d)=d + o(1); constructing families of Ramanujan graphs with arbitrary degree is one of the biggest open problems in this area. So far, we only know the construction of Ramanujan graphs with certain degrees and these constructions are based on deep algebraic knowledge. See [LPS88] for example. Another quite important problem is to find a combinatorial construction of Ramanujan graphs. At the end of this section, we list some more interesting facts on eigenvalues of graphs: 1. If graphs G and H are isomorphic, then there is a permutation matrix P such that P · A(G) · PT = A(H) and hence the matrices A(G) and A(H) are similar. 2. There are nonisomorphic graphs with the same spectrum. See Figure 1. Figure 1: An example for two graphs which are not isomorphic but have the same spectrum. Their common graph spectrum is 2; 0; 0; 0; −2. 2 Combinatorial Expansion of Graphs For any d-regular graph G = (V; E), let Γ(v) be the set of neighbors of v, i.e., Γ(v) = fu j (u; v) 2 E g: 0 For any subset S ⊆ V , let Γ(S) = [v2SΓ(v) and Γ (S) = Γ(S) [ S. Moreoever, for any set S ⊆ V we define @S := E(S; S). Definition 2.12 (vertex expansion). A graph G with n vertices is said to have vertex expansion (K; A) if jΓ(S)j min ≥ A: S : jS|≤K jSj If K = n=2, then for simplicity we call G an A-expander. Informally expanders are graphs with the property that every subset (under some constraint on their size) has many neighbors outside the set. Moreover, we can use different ways to study expanders: (1) Combinatorically, expanders are highly connected graphs, and to disconnect a large part of the graph, one has to remove many edges; (2) Geometrically, every vertex set has a relatively very large boundary; (3) From the Probabilistic view, expanders are graphs whose behavior is \like" random graphs. (4) Algebraically, expanders are the real-symmetric matrix whose first positive eigenvalue of the Laplace operator is bounded away from zero. 4 Figure 2: Comparison of the vertex expansion and the edge expansion of a set of vertices of size 5.
Load more

Recommended publications
  • Distance Regular Graphs Simply Explained
    Distance Regular Graphs Simply Explained Alexander Coulter Paauwe April 20, 2007 Copyright c 2007 Alexander Coulter Paauwe. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled “GNU Free Documentation License”. Adjacency Algebra and Distance Regular Graphs: In this paper, we will discover some interesting properties of a particular kind of graph, called distance regular graphs, using algebraic graph theory. We will begin by developing some definitions that will allow us to explore the relationship between powers of the adjacency matrix of a graph and its eigenvalues, and ultimately give us particular insight into the eigenvalues of distance regular graphs. Basis for the Polynomial of an Adjacency Matrix We all know that for a given graph G, the powers of its adjacency matrix, A, have as their entries the number of n-walks between two vertices. More succinctly, we know that [An]i,j is the number of n-walks between the two vertices vi and vj. We also know that for a graph with diameter d, the first d powers of A are all linearly independent. Now, let us think of the set of all polynomials of the adjacency matrix, A, for a graph G. We can think of any member of the set as a linear combination of powers of A.
    [Show full text]
  • Constructing an Infinite Family of Cubic 1-Regular Graphs
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Europ. J. Combinatorics (2002) 23, 559–565 doi:10.1006/eujc.2002.0589 Available online at http://www.idealibrary.com on Constructing an Infinite Family of Cubic 1-Regular Graphs YQAN- UAN FENG† AND JIN HO KWAK A graph is 1-regular if its automorphism group acts regularly on the set of its arcs. Miller [J. Comb. Theory, B, 10 (1971), 163–182] constructed an infinite family of cubic 1-regular graphs of order 2p, where p ≥ 13 is a prime congruent to 1 modulo 3. Marusiˇ cˇ and Xu [J. Graph Theory, 25 (1997), 133– 138] found a relation between cubic 1-regular graphs and tetravalent half-transitive graphs with girth 3 and Alspach et al.[J. Aust. Math. Soc. A, 56 (1994), 391–402] constructed infinitely many tetravalent half-transitive graphs with girth 3. Using these results, Miller’s construction can be generalized to an infinite family of cubic 1-regular graphs of order 2n, where n ≥ 13 is odd such that 3 divides ϕ(n), the Euler function of n. In this paper, we construct an infinite family of cubic 1-regular graphs with order 8(k2 + k + 1)(k ≥ 2) as cyclic-coverings of the three-dimensional Hypercube. c 2002 Elsevier Science Ltd. All rights reserved. 1. INTRODUCTION In this paper we consider an undirected finite connected graph without loops or multiple edges. For a graph G, we denote by V (G), E(G), A(G) and Aut(G) the vertex set, the edge set, the arc set and the automorphism group, respectively.
    [Show full text]
  • Three Conjectures in Extremal Spectral Graph Theory
    Three conjectures in extremal spectral graph theory Michael Tait and Josh Tobin June 6, 2016 Abstract We prove three conjectures regarding the maximization of spectral invariants over certain families of graphs. Our most difficult result is that the join of P2 and Pn−2 is the unique graph of maximum spectral radius over all planar graphs. This was conjectured by Boots and Royle in 1991 and independently by Cao and Vince in 1993. Similarly, we prove a conjecture of Cvetkovi´cand Rowlinson from 1990 stating that the unique outerplanar graph of maximum spectral radius is the join of a vertex and Pn−1. Finally, we prove a conjecture of Aouchiche et al from 2008 stating that a pineapple graph is the unique connected graph maximizing the spectral radius minus the average degree. To prove our theorems, we use the leading eigenvector of a purported extremal graph to deduce structural properties about that graph. Using this setup, we give short proofs of several old results: Mantel's Theorem, Stanley's edge bound and extensions, the K}ovari-S´os-Tur´anTheorem applied to ex (n; K2;t), and a partial solution to an old problem of Erd}oson making a triangle-free graph bipartite. 1 Introduction Questions in extremal graph theory ask to maximize or minimize a graph invariant over a fixed family of graphs. Perhaps the most well-studied problems in this area are Tur´an-type problems, which ask to maximize the number of edges in a graph which does not contain fixed forbidden subgraphs. Over a century old, a quintessential example of this kind of result is Mantel's theorem, which states that Kdn=2e;bn=2c is the unique graph maximizing the number of edges over all triangle-free graphs.
    [Show full text]
  • Maximizing the Order of a Regular Graph of Given Valency and Second Eigenvalue∗
    SIAM J. DISCRETE MATH. c 2016 Society for Industrial and Applied Mathematics Vol. 30, No. 3, pp. 1509–1525 MAXIMIZING THE ORDER OF A REGULAR GRAPH OF GIVEN VALENCY AND SECOND EIGENVALUE∗ SEBASTIAN M. CIOABA˘ †,JACKH.KOOLEN‡, HIROSHI NOZAKI§, AND JASON R. VERMETTE¶ Abstract. From Alon√ and Boppana, and Serre, we know that for any given integer k ≥ 3 and real number λ<2 k − 1, there are only finitely many k-regular graphs whose second largest eigenvalue is at most λ. In this paper, we investigate the largest number of vertices of such graphs. Key words. second eigenvalue, regular graph, expander AMS subject classifications. 05C50, 05E99, 68R10, 90C05, 90C35 DOI. 10.1137/15M1030935 1. Introduction. For a k-regular graph G on n vertices, we denote by λ1(G)= k>λ2(G) ≥ ··· ≥ λn(G)=λmin(G) the eigenvalues of the adjacency matrix of G. For a general reference on the eigenvalues of graphs, see [8, 17]. The second eigenvalue of a regular graph is a parameter of interest in the study of graph connectivity and expanders (see [1, 8, 23], for example). In this paper, we investigate the maximum order v(k, λ) of a connected k-regular graph whose second largest eigenvalue is at most some given parameter λ. As a consequence of work of Alon and Boppana and of Serre√ [1, 11, 15, 23, 24, 27, 30, 34, 35, 40], we know that v(k, λ) is finite for λ<2 k − 1. The recent result of Marcus, Spielman, and Srivastava [28] showing the existence of infinite families of√ Ramanujan graphs of any degree at least 3 implies that v(k, λ) is infinite for λ ≥ 2 k − 1.
    [Show full text]
  • Manifold Learning
    MANIFOLD LEARNING Kavé Salamatian- LISTIC Learning Machine Learning: develop algorithms to automatically extract ”patterns” or ”regularities” from data (generalization) Typical tasks Clustering: Find groups of similar points Dimensionality reduction: Project points in a lower dimensional space while preserving structure Semi-supervised: Given labelled and unlabelled points, build a labelling function Supervised: Given labelled points, build a labelling function All these tasks are not well-defined Clustering Identify the two groups Dimensionality Reduction 4096 Objects in R ? But only 3 parameters: 2 angles and 1 for illumination. They span a 3- dimensional sub-manifold of R4096! Semi-Supervised Learning Assign labels to black points Supervised learning Build a function that predicts the label of all points in the space Formal definitions Clustering: Given build a function Dimensionality reduction: Given build a function Semi-supervised: Given and with m << n, build a function Supervised: Given , build Geometric learning Consider and exploit the geometric structure of the data Clustering: two ”close” points should be in the same cluster Dimensionality reduction: ”closeness” should be preserved Semi-supervised/supervised: two ”close” points should have the same label Examples: k-means clustering, k-nearest neighbors. Manifold ? A manifold is a topological space that is locally Euclidian Around every point, there is a neighborhood that is topologically isomorph to unit ball Regularization Adopt a functional viewpoint
    [Show full text]
  • Perfect Domination in Book Graph and Stacked Book Graph
    International Journal of Mathematics Trends and Technology (IJMTT) – Volume 56 Issue 7 – April 2018 Perfect Domination in Book Graph and Stacked Book Graph Kavitha B N#1, Indrani Pramod Kelkar#2, Rajanna K R#3 #1Assistant Professor, Department of Mathematics, Sri Venkateshwara College of Engineering, Bangalore, India *2 Professor, Department of Mathematics, Acharya Institute of Technology, Bangalore, India #3 Professor, Department of Mathematics, Acharya Institute of Technology, Bangalore, India Abstract: In this paper we prove that the perfect domination number of book graph and stacked book graph are same as the domination number as the dominating set satisfies the condition for perfect domination. Keywords: Domination, Cartesian product graph, Perfect Domination, Book Graph, Stacked Book Graph. I. INTRODUCTION By a graph G = (V, E) we mean a finite, undirected graph with neither loops nor multiple edges. The order and size of G are denoted by p and q respectively. For graph theoretic terminology we refer to Chartrand and Lesnaik[3]. Graphs have various special patterns like path, cycle, star, complete graph, bipartite graph, complete bipartite graph, regular graph, strongly regular graph etc. For the definitions of all such graphs we refer to Harry [7]. The study of Cross product of graph was initiated by Imrich [12]. For structure and recognition of Cross Product of graph we refer to Imrich [11]. In literature, the concept of domination in graphs was introduced by Claude Berge in 1958 and Oystein Ore in [1962] by [14]. For review of domination and its related parameters we refer to Acharya et.al. [1979] and Haynes et.al.
    [Show full text]
  • Strongly Regular Graphs
    Chapter 4 Strongly Regular Graphs 4.1 Parameters and Properties Recall that a (simple, undirected) graph is regular if all of its vertices have the same degree. This is a strong property for a graph to have, and it can be recognized easily from the adjacency matrix, since it means that all row sums are equal, and that1 is an eigenvector. If a graphG of ordern is regular of degreek, it means that kn must be even, since this is twice the number of edges inG. Ifk�n− 1 and kn is even, then there does exist a graph of ordern that is regular of degreek (showing that this is true is an exercise worth thinking about). Regularity is a strong property for a graph to have, and it implies a kind of symmetry, but there are examples of regular graphs that are not particularly “symmetric”, such as the disjoint union of two cycles of different lengths, or the connected example below. Various properties of graphs that are stronger than regularity can be considered, one of the most interesting of which is strong regularity. Definition 4.1.1. A graphG of ordern is called strongly regular with parameters(n,k,λ,µ) if every vertex ofG has degreek; • ifu andv are adjacent vertices ofG, then the number of common neighbours ofu andv isλ (every • edge belongs toλ triangles); ifu andv are non-adjacent vertices ofG, then the number of common neighbours ofu andv isµ; • 1 k<n−1 (so the complete graph and the null graph ofn vertices are not considered to be • � strongly regular).
    [Show full text]
  • Contemporary Spectral Graph Theory
    CONTEMPORARY SPECTRAL GRAPH THEORY GUEST EDITORS Maurizio Brunetti, University of Naples Federico II, Italy, [email protected] Raffaella Mulas, The Alan Turing Institute, UK, [email protected] Lucas Rusnak, Texas State University, USA, [email protected] Zoran Stanić, University of Belgrade, Serbia, [email protected] DESCRIPTION Spectral graph theory is a striking theory that studies the properties of a graph in relationship to the characteristic polynomial, eigenvalues and eigenvectors of matrices associated with the graph, such as the adjacency matrix, the Laplacian matrix, the signless Laplacian matrix or the distance matrix. This theory emerged in the 1950s and 1960s. Over the decades it has considered not only simple undirected graphs but also their generalizations such as multigraphs, directed graphs, weighted graphs or hypergraphs. In the recent years, spectra of signed graphs and gain graphs have attracted a great deal of attention. Besides graph theoretic research, another major source is the research in a wide branch of applications in chemistry, physics, biology, electrical engineering, social sciences, computer sciences, information theory and other disciplines. This thematic special issue is devoted to the publication of original contributions focusing on the spectra of graphs or their generalizations, along with the most recent applications. Contributions to the Special Issue may address (but are not limited) to the following aspects: f relations between spectra of graphs (or their generalizations) and their structural properties in the most general shape, f bounds for particular eigenvalues, f spectra of particular types of graph, f relations with block designs, f particular eigenvalues of graphs, f cospectrality of graphs, f graph products and their eigenvalues, f graphs with a comparatively small number of eigenvalues, f graphs with particular spectral properties, f applications, f characteristic polynomials.
    [Show full text]
  • On Cayley Graphs of Algebraic Structures
    On Cayley graphs of algebraic structures Didier Caucal1 1 CNRS, LIGM, University Paris-East, France [email protected] Abstract We present simple graph-theoretic characterizations of Cayley graphs for left-cancellative monoids, groups, left-quasigroups and quasigroups. We show that these characterizations are effective for the end-regular graphs of finite degree. 1 Introduction To describe the structure of a group, Cayley introduced in 1878 [7] the concept of graph for any group (G, ·) according to any generating subset S. This is simply the set of labeled s oriented edges g −→ g·s for every g of G and s of S. Such a graph, called Cayley graph, is directed and labeled in S (or an encoding of S by symbols called letters or colors). The study of groups by their Cayley graphs is a main topic of algebraic graph theory [3, 8, 2]. A characterization of unlabeled and undirected Cayley graphs was given by Sabidussi in 1958 [15] : an unlabeled and undirected graph is a Cayley graph if and only if we can find a group with a free and transitive action on the graph. However, this algebraic characterization is not well suited for deciding whether a possibly infinite graph is a Cayley graph. It is pertinent to look for characterizations by graph-theoretic conditions. This approach was clearly stated by Hamkins in 2010: Which graphs are Cayley graphs? [10]. In this paper, we present simple graph-theoretic characterizations of Cayley graphs for firstly left-cancellative and cancellative monoids, and then for groups. These characterizations are then extended to any subset S of left-cancellative magmas, left-quasigroups, quasigroups, and groups.
    [Show full text]
  • Towards a Classification of Distance-Transitive Graphs
    数理解析研究所講究録 1063 巻 1998 年 72-83 72 Towards a classification of distance-transitive graphs John van Bon Abstract We outline the programme of classifying all finite distance-transitive graphs. We men- tion the most important classification results obtained so far and give special attention to the so called affine graphs. 1. Introduction The graphs in this paper will be always assumed to be finite, connected, undirected and without loops or multiple edges. The edge set of a graph can thus be identified with a subset of the set of unoidered pairs of vertices. Let $\Gamma=(V\Gamma, E\Gamma)$ be a graph and $x,$ $y\in V\Gamma$ . With $d(x, y)$ we will denote the usual distance $\Gamma$ in between the vertices $x$ and $y$ (i.e., the length of the shortest path connecting $x$ and $y$ ) and with $d$ we will denote the diameter of $\Gamma$ , the maximum of all possible values of $d(x, y)$ . Let $\Gamma_{i}(x)=\{y|y\in V\Gamma, d(x, y)=i\}$ be the set of all vertices at distance $i$ of $x$ . An $aut_{omo}rph7,sm$ of a graph is a permutation of the vertex set that maps edges to edges. Let $G$ be a group acting on a graph $\Gamma$ (i.e. we are given a morphism $Garrow Aut(\Gamma)$ ). For a $x\in V\Gamma$ $x^{g}$ vertex and $g\in G$ the image of $x$ under $g$ will be denoted by . The set $\{g\in G|x^{g}=x\}$ is a subgroup of $G$ , called that stabilizer in $G$ of $x$ and will be denoted by $G_{x}$ .
    [Show full text]
  • Learning on Hypergraphs: Spectral Theory and Clustering
    Learning on Hypergraphs: Spectral Theory and Clustering Pan Li, Olgica Milenkovic Coordinated Science Laboratory University of Illinois at Urbana-Champaign March 12, 2019 Learning on Graphs Graphs are indispensable mathematical data models capturing pairwise interactions: k-nn network social network publication network Important learning on graphs problems: clustering (community detection), semi-supervised/active learning, representation learning (graph embedding) etc. Beyond Pairwise Relations A graph models pairwise relations. Recent work has shown that high-order relations can be significantly more informative: Examples include: Understanding the organization of networks (Benson, Gleich and Leskovec'16) Determining the topological connectivity between data points (Zhou, Huang, Sch}olkopf'07). Graphs with high-order relations can be modeled as hypergraphs (formally defined later). Meta-graphs, meta-paths in heterogeneous information networks. Algorithmic methods for analyzing high-order relations and learning problems are still under development. Beyond Pairwise Relations Functional units in social and biological networks. High-order network motifs: Motif (Benson’16) Microfauna Pelagic fishes Crabs & Benthic fishes Macroinvertebrates Algorithmic methods for analyzing high-order relations and learning problems are still under development. Beyond Pairwise Relations Functional units in social and biological networks. Meta-graphs, meta-paths in heterogeneous information networks. (Zhou, Yu, Han'11) Beyond Pairwise Relations Functional units in social and biological networks. Meta-graphs, meta-paths in heterogeneous information networks. Algorithmic methods for analyzing high-order relations and learning problems are still under development. Review of Graph Clustering: Notation and Terminology Graph Clustering Task: Cluster the vertices that are \densely" connected by edges. Graph Partitioning and Conductance A (weighted) graph G = (V ; E; w): for e 2 E, we is the weight.
    [Show full text]
  • Spectral Geometry for Structural Pattern Recognition
    Spectral Geometry for Structural Pattern Recognition HEWAYDA EL GHAWALBY Ph.D. Thesis This thesis is submitted in partial fulfilment of the requirements for the degree of Doctor of Philosophy. Department of Computer Science United Kingdom May 2011 Abstract Graphs are used pervasively in computer science as representations of data with a network or relational structure, where the graph structure provides a flexible representation such that there is no fixed dimensionality for objects. However, the analysis of data in this form has proved an elusive problem; for instance, it suffers from the robustness to structural noise. One way to circumvent this problem is to embed the nodes of a graph in a vector space and to study the properties of the point distribution that results from the embedding. This is a problem that arises in a number of areas including manifold learning theory and graph-drawing. In this thesis, our first contribution is to investigate the heat kernel embed- ding as a route to computing geometric characterisations of graphs. The reason for turning to the heat kernel is that it encapsulates information concerning the distribution of path lengths and hence node affinities on the graph. The heat ker- nel of the graph is found by exponentiating the Laplacian eigensystem over time. The matrix of embedding co-ordinates for the nodes of the graph is obtained by performing a Young-Householder decomposition on the heat kernel. Once the embedding of its nodes is to hand we proceed to characterise a graph in a geometric manner. With the embeddings to hand, we establish a graph character- ization based on differential geometry by computing sets of curvatures associated ii Abstract iii with the graph nodes, edges and triangular faces.
    [Show full text]