DOCSLIB.ORG

Graph Comparison Via the Non-Backtracking Spectrum

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Graph Comparison Via the Non-Backtracking Spectrum GRAPH COMPARISON VIA THE NON-BACKTRACKING SPECTRUM Andrew Mellor* and Angelica Grusovin Mathematical Institute University of Oxford *[email protected] December 14, 2018 ABSTRACT The comparison of graphs is a vitally important, yet difficult task which arises across a number of diverse research areas including biological and social networks. There have been a number of approaches to define graph distance however often these are not metrics (rendering standard data- mining techniques infeasible), or are computationally infeasible for large graphs. In this work we define a new metric based on the spectrum of the non-backtracking graph operator and show that it can not only be used to compare graphs generated through different mechanisms, but can reliably compare graphs of varying size. We observe that the family of Watts-Strogatz graphs lie on a mani- fold in the non-backtracking spectral embedding and show how this metric can be used in a standard classification problem of empirical graphs. 1 Introduction Comparing graph structures is a fundamental task in graph theory. In particular the need to identify similar graph structure arises in order to determine common function, behaviour, or generative process. This need is universal across disciplines and applications range from image processing [11], chemistry [1, 26], and social network analysis [24, 29]. For small graphs, identifying two identical graph structures (up to an isomorphism, or relabelling of vertices) is a trivial and computationally feasible task due to the limited number of possible configurations. For graphs with four vertices there are six possible graph configurations. However, for graphs with ten vertices there are 11; 716; 571 possible configurations. Although there is not a closed formula for the number of graph configurations with n vertices, it is clear that it soon becomes intractable to enumerate or compare large graphs through brute-force. The problem of determining whether two graphs are isomorphic is equivalent to finding a permutation matrix P such arXiv:1812.05457v1 [cs.SI] 13 Dec 2018 that AP = PB where A and B are the adjacency matrices of the two graphs. Despite the difficulty in the task1 there have been a number of attempts to define graph distance by minimising jjAP − PBjj for a suitably defined matrix norm jj · jj. The matrices A and B can also take different forms to shift from a local perspective (adjacency matrix) to consider global properties, where A and B capture the number of paths between vertices. Examples of such distances include the chemical distance [26], CKS distance [8], and edit distance [18, 39]. Recent work has focused on reducing the space over which to find a permutation matrix [6] which makes the problem tractable, although still computationally restrictive for large graphs. Beyond scalability issues, one of the drawbacks of these methods is that they require graphs to be of the same order (i.e. the same number of vertices). For many applications this may be desirable, especially where the addition of a single vertex or edge can have drastic consequences on graph function (in graphs of chemical compounds for example). However for other applications we may be interested in the structure at a coarser level. For example, a ring graph of 100 vertices is structurally similar to a ring graph of 200 vertices, however the two cannot be compared using traditional isomorphism arguments. 1 It is currently unknown as to whether this problem lies in the class of P or NP-hard problems [4] GRAPH COMPARISION VIA THE NON-BACKTRACKING SPECTRUM Contrasting approaches use a number of graph properties, or features, to characterise graph structure [43, 17, 23, 35, 33]. The most promising of these make use of the graph spectrum, either of the adjacency matrix directly, or of a version of the graph Laplacian [13, 44, 46, 16, 28]. The spectra of graphs or graph operators are useful since the eigenvalues and eigenvectors characterise the topological structure of a graph in a way which can be interpreted physically. Eigenvalues of the graph Laplacian describe how a quantity (information, heat, people, etc.) localised at a vertex can spread across the graph. These eigenvalues also dictate the stability of dynamics acting across the graph [32]. Beyond the Laplacian, recent work has investigated the spectral properties of higher-order operators such as the non-backtracking graph operator (described in the next section) [40]. For a more detailed (but not complete) examination of graph distances we refer the reader to a recent survey [15]. In this article we present a new method to compare graph structure using the distribution of eigenvalues of the non- backtracking operator in the complex plane. In Section 2 we describe the non-backtracking operator and investigate some of its spectral properties before introducing the distributional non-backtracking spectral distance (d-NBD) in Section 3. We show empirical results for both synthetic and real graphs in Section 4 before discussing the significance of the results and future research in Section 5. 2 The Non-backtracking Operator and Spectrum Consider a simple undirected binary graph G = (V; E) where V ⊂ N is a set of vertices and E ⊂ V 2 is a set of edges. Here we use the word simple to mean that the graph contains no self-loops or multiple edges between vertices. Let n = jV j be the number of vertices and m = jEj be the number of edges. Spectral analysis of graphs is typically conducted using the Laplacian matrix L = A − D where A is the adjacency P matrix which encodes G, and D is a diagonal matrix of vertex degrees with Dii = j Aij and zeros elsewhere. In this work we chose instead to use a different linear graph operator, namely the non-backtracking operator. The non-backtracking (or Hashimoto) matrix B is a 2m × 2m matrix defined on the set of directed edges of G. Here each undirected edge u $ v is replaced by two directed edges u ! v and v ! u. The non-backtracking matrix is then given by 1 if x = v and y 6= u B = (u!v);(x!y) 0 otherwise. The non-backtracking matrix is asymmetric and the entries of Bk describe the number of non-backtracking walks of k length k across G. Of special note is (B )ii which counts the non-backtracking cycles of length k which start and end at edge i2. The total number of non-backtracking cycles of length k is therefore captured in the trace of Bk. 2.1 Spectral Properties The spectral properties of the non-backtracking matrix are well understood, especially for regular graphs [31, 3, 38]. As B is asymmetric the eigenvalues can also take complex values. In Figure 1 we show the spectrum in the complex plane of three real-world graphs and three synthetic graphs of varying size. p p The first observation is that the bulk of the eigenvalues λk lie within the disk jλkj < ρ(B) where ρ(B) = maxk jλkj is the spectral radius of B. This is commonly used as a heuristic for the bulk of the spectrum, however in particular cases more is known. Forp random regular graphs of degree d there are n pairs of conjugate eigenvalues which lie exactly on a circle of radius d − 1, and for a stochastic block model the expected magnitude of the eigenvalues can be shown to be less than or equal to pρ(B) in the limit n ! 1 [25]. Another property of the spectrum of B is that any tree structure (whether connected to the graph, or disconnected) contributes zero eigenvalues to the spectrum. This is a consequence of any non-backtracking walk becoming ‘stuck’ at the leaves of the tree. Furthermore any unicyclic component gives rise to eigenvalues in f0g [ fλ : jλj = 1g. These two properties are easily explained as we make the connection between the number of non-backtracking cycles in the graph and the eigenvalues of B. For any matrix A the trace of Ak can be calculated as n k X k tr A = λi i=1 2Non-backtracking does not mean that a walk only visits distinct vertices, only that it does not immediately return to a vertex it has just arrived from. 2 GRAPH COMPARISION VIA THE NON-BACKTRACKING SPECTRUM 3 1.5 3 2 1.0 2 1 1 0.5 0 0 0.0 2 0 2 4 6 6 4 2 0 2 4 6 2 1 0 1 2 3 1 1 0.5 2 2 1.0 3 3 1.5 4 10 5 2 5 0 0 0 2.5 0.0 2.5 5.0 7.5 10.0 5 0 5 10 15 0 10 20 2 5 5 10 4 Figure 1: The non-backtracking spectrum of real and synthetic networks in the complex plane. Each eigenvalue λk = αk + βki is represented by the point (αk; βk). (Top, left to right) The Karate Club graph [45], Davis Southern Women graph [12], and Florentine Families graph [7]. (Bottom, left to right) An Erdos-R˝ enyi´ graph with edge connection probability p = 0:2 for 50; 100 and 150 vertices. The red circle marks the curve α2 + β2 = pρ(B) where ρ(B) is the spectral radius of B. n where (λi)i=1 are the eigenvalues of A. This result is trivial for symmetric matrices which can be diagonalised, however the result also holds for asymmetric matrices. We can therefore write 2m k X k tr B = λi ; (1) i=1 noting that tr Bk captures a count of all non-backtracking cycles of length k. This means that the eigenvalues of B encode all information regarding the number of non-backtracking cycles in A.
Load more

Recommended publications
  • Spectral Geometry Spring 2016
    Spectral Geometry Spring 2016 Michael Magee Lecture 5: The resolvent. Last time we proved that the Laplacian has a closure whose domain is the Sobolev space H2(M)= u L2(M): u L2(M), ∆u L2(M) . { 2 kr k2 2 } We view the Laplacian as an unbounded densely defined self-adjoint operator on L2 with domain H2. We also stated the spectral theorem. We’ll now ask what is the nature of the pro- jection valued measure associated to the Laplacian (its ‘spectral decomposition’). Until otherwise specified, suppose M is a complete Riemannian manifold. Definition 1. The resolvent set of the Laplacian is the set of λ C such that λI ∆isa bijection of H2 onto L2 with a boundedR inverse (with respect to L2 norms)2 − 1 2 2 R(λ) (λI ∆)− : L (M) H (M). ⌘ − ! The operator R(λ) is called the resolvent of the Laplacian at λ. We write spec(∆) = C −R and call it the spectrum. Note that the projection valued measure of ∆is supported in R 0. Otherwise one can find a function in H2(M)where ∆ , is negative, but since can be≥ approximated in Sobolev norm by smooth functions, thish will contradicti ∆ , = g( , )Vol 0. (1) h i ˆ r r ≥ Note then the spectral theorem implies that the resolvent set contains C R 0 (use the Borel functional calculus). − ≥ Theorem 2 (Stone’s formula [1, VII.13]). Let P be the projection valued measure on R associated to the Laplacan by the spectral theorem. The following formula relates the resolvent to P b 1 1 lim(2⇡i)− [R(λ + i✏) R(λ i✏)] dλ = P[a,b] + P(a,b) .
    [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]
  • Noncommutative Geometry, the Spectral Standpoint Arxiv
    Noncommutative Geometry, the spectral standpoint Alain Connes October 24, 2019 In memory of John Roe, and in recognition of his pioneering achievements in coarse geometry and index theory. Abstract We update our Year 2000 account of Noncommutative Geometry in [68]. There, we de- scribed the following basic features of the subject: I The natural “time evolution" that makes noncommutative spaces dynamical from their measure theory. I The new calculus which is based on operators in Hilbert space, the Dixmier trace and the Wodzicki residue. I The spectral geometric paradigm which extends the Riemannian paradigm to the non- commutative world and gives a new tool to understand the forces of nature as pure gravity on a more involved geometric structure mixture of continuum with the discrete. I The key examples such as duals of discrete groups, leaf spaces of foliations and de- formations of ordinary spaces, which showed, very early on, that the relevance of this new paradigm was going far beyond the framework of Riemannian geometry. Here, we shall report1 on the following highlights from among the many discoveries made since 2000: 1. The interplay of the geometry with the modular theory for noncommutative tori. 2. Great advances on the Baum-Connes conjecture, on coarse geometry and on higher in- dex theory. 3. The geometrization of the pseudo-differential calculi using smooth groupoids. 4. The development of Hopf cyclic cohomology. 5. The increasing role of topological cyclic homology in number theory, and of the lambda arXiv:1910.10407v1 [math.QA] 23 Oct 2019 operations in archimedean cohomology. 6. The understanding of the renormalization group as a motivic Galois group.
    [Show full text]
  • Spectral Theory of Translation Surfaces : a Short Introduction Volume 28 (2009-2010), P
    Institut Fourier — Université de Grenoble I Actes du séminaire de Théorie spectrale et géométrie Luc HILLAIRET Spectral theory of translation surfaces : A short introduction Volume 28 (2009-2010), p. 51-62. <http://tsg.cedram.org/item?id=TSG_2009-2010__28__51_0> © Institut Fourier, 2009-2010, tous droits réservés. L’accès aux articles du Séminaire de théorie spectrale et géométrie (http://tsg.cedram.org/), implique l’accord avec les conditions générales d’utilisation (http://tsg.cedram.org/legal/). cedram Article mis en ligne dans le cadre du Centre de diffusion des revues académiques de mathématiques http://www.cedram.org/ Séminaire de théorie spectrale et géométrie Grenoble Volume 28 (2009-2010) 51-62 SPECTRAL THEORY OF TRANSLATION SURFACES : A SHORT INTRODUCTION Luc Hillairet Abstract. — We define translation surfaces and, on these, the Laplace opera- tor that is associated with the Euclidean (singular) metric. This Laplace operator is not essentially self-adjoint and we recall how self-adjoint extensions are chosen. There are essentially two geometrical self-adjoint extensions and we show that they actually share the same spectrum Résumé. — On définit les surfaces de translation et le Laplacien associé à la mé- trique euclidienne (avec singularités). Ce laplacien n’est pas essentiellement auto- adjoint et on rappelle la façon dont les extensions auto-adjointes sont caractérisées. Il y a deux choix naturels dont on montre que les spectres coïncident. 1. Introduction Spectral geometry aims at understanding how the geometry influences the spectrum of geometrically related operators such as the Laplace oper- ator. The more interesting the geometry is, the more interesting we expect the relations with the spectrum to be.
    [Show full text]
  • Discrete Spectral Geometry
    Discrete Spectral Geometry Discrete Spectral Geometry Amir Daneshgar Department of Mathematical Sciences Sharif University of Technology Hossein Hajiabolhassan is mathematically dense in this talk!! May 31, 2006 Discrete Spectral Geometry Outline Outline A viewpoint based on mappings A general non-symmetric discrete setup Weighted energy spaces Comparison and variational formulations Summary A couple of comparison theorems Graph homomorphisms A comparison theorem The isoperimetric spectrum ε-Uniformizers Symmetric spaces and representation theory Epilogue Discrete Spectral Geometry A viewpoint based on mappings Basic Objects I H is a geometric objects, we are going to analyze. Discrete Spectral Geometry A viewpoint based on mappings Basic Objects I There are usually some generic (i.e. well-known, typical, close at hand, important, ...) types of these objects. Discrete Spectral Geometry A viewpoint based on mappings Basic Objects (continuous case) I These are models and objects of Euclidean and non-Euclidean geometry. Discrete Spectral Geometry A viewpoint based on mappings Basic Objects (continuous case) I Two important generic objects are the sphere and the upper half plane. Discrete Spectral Geometry A viewpoint based on mappings Basic Objects (discrete case) I Some important generic objects in this case are complete graphs, infinite k-regular tree and fractal-meshes in Rn. Discrete Spectral Geometry A viewpoint based on mappings Basic Objects (discrete case) I These are models and objects in network analysis and design, discrete state-spaces of algorithms and discrete geometry (e.g. in geometric group theory). Discrete Spectral Geometry A viewpoint based on mappings Comparison method I The basic idea here is to try to understand (or classify if we are lucky!) an object by comparing it with the generic ones.
    [Show full text]
  • Pose Analysis Using Spectral Geometry
    Vis Comput DOI 10.1007/s00371-013-0850-0 ORIGINAL ARTICLE Pose analysis using spectral geometry Jiaxi Hu · Jing Hua © Springer-Verlag Berlin Heidelberg 2013 Abstract We propose a novel method to analyze a set 1 Introduction of poses of 3D models that are represented with trian- gle meshes and unregistered. Different shapes of poses are Shape deformation is one of the major research topics in transformed from the 3D spatial domain to a geometry spec- computer graphics. Recently there have been extensive lit- trum domain that is defined by Laplace–Beltrami opera- eratures on this topic. There are two major categories of re- tor. During this space-spectrum transform, all near-isometric searches on this topic. One is surface-based and the other deformations, mesh triangulations and Euclidean transfor- one is skeleton-driven method. Shape interpolation [2, 9, 11] mations are filtered away. The different spatial poses from is a surface-based approach. The basic idea is that given two a 3D model are represented with near-isometric deforma- key frames of a shape, the intermediate deformation can be tions; therefore, they have similar behaviors in the spec- generated with interpolation and further deformations can be tral domain. Semantic parts of that model are then deter- predicted with extrapolation. It can also blend among sev- mined based on the computed geometric properties of all the eral shapes. Shape interpolation is convenient for animation mapped vertices in the geometry spectrum domain. Seman- generation but is not flexible enough for shape editing due tic skeleton can be automatically built with joints detected to the lack of local control.
    [Show full text]
  • Spectral Theory for the Weil-Petersson Laplacian on the Riemann Moduli Space
    SPECTRAL THEORY FOR THE WEIL-PETERSSON LAPLACIAN ON THE RIEMANN MODULI SPACE LIZHEN JI, RAFE MAZZEO, WERNER MULLER¨ AND ANDRAS VASY Abstract. We study the spectral geometric properties of the scalar Laplace-Beltrami operator associated to the Weil-Petersson metric gWP on Mγ , the Riemann moduli space of surfaces of genus γ > 1. This space has a singular compactification with respect to gWP, and this metric has crossing cusp-edge singularities along a finite collection of simple normal crossing divisors. We prove first that the scalar Laplacian is essentially self-adjoint, which then implies that its spectrum is discrete. The second theorem is a Weyl asymptotic formula for the counting function for this spectrum. 1. Introduction This paper initiates the analytic study of the natural geometric operators associated to the Weil-Petersson metric gWP on the Riemann moduli space of surfaces of genus γ > 1, denoted below by Mγ. We consider the Deligne- Mumford compactification of this space, Mγ, which is a stratified space with many special features. The topological and geometric properties of this space have been intensively investigated for many years, and Mγ plays a central role in many parts of mathematics. This paper stands as the first step in a development of analytic tech- niques to study the natural elliptic differential operators associated to the Weil-Petersson metric. More generally, our results here apply to the wider class of metrics with crossing cusp-edge singularities on certain stratified Rie- mannian pseudomanifolds. This fits into a much broader study of geometric analysis on stratified spaces using the techniques of geometric microlocal analysis.
    [Show full text]
  • Quantum Information Hidden in Quantum Fields
    Preprints (www.preprints.org) | NOT PEER-REVIEWED | Posted: 21 July 2020 Peer-reviewed version available at Quantum Reports 2020, 2, 33; doi:10.3390/quantum2030033 Article Quantum Information Hidden in Quantum Fields Paola Zizzi Department of Brain and Behavioural Sciences, University of Pavia, Piazza Botta, 11, 27100 Pavia, Italy; [email protected]; Phone: +39 3475300467 Abstract: We investigate a possible reduction mechanism from (bosonic) Quantum Field Theory (QFT) to Quantum Mechanics (QM), in a way that could explain the apparent loss of degrees of freedom of the original theory in terms of quantum information in the reduced one. This reduction mechanism consists mainly in performing an ansatz on the boson field operator, which takes into account quantum foam and non-commutative geometry. Through the reduction mechanism, QFT reveals its hidden internal structure, which is a quantum network of maximally entangled multipartite states. In the end, a new approach to the quantum simulation of QFT is proposed through the use of QFT's internal quantum network Keywords: Quantum field theory; Quantum information; Quantum foam; Non-commutative geometry; Quantum simulation 1. Introduction Until the 1950s, the common opinion was that quantum field theory (QFT) was just quantum mechanics (QM) plus special relativity. But that is not the whole story, as well described in [1] [2]. There, the authors mainly say that the fact that QFT was "discovered" in an attempt to extend QM to the relativistic regime is only historically accidental. Indeed, QFT is necessary and applied also in the study of condensed matter, e.g. in the case of superconductivity, superfluidity, ferromagnetism, etc.
    [Show full text]
  • The Spectral Geometry of Operators of Dirac and Laplace Type
    Handbook of Global Analysis 287 Demeter Krupka and David Saunders c 2007 Elsevier All rights reserved The spectral geometry of operators of Dirac and Laplace type P. Gilkey Contents 1 Introduction 2 The geometry of operators of Laplace and Dirac type 3 Heat trace asymptotics for closed manifolds 4 Hearing the shape of a drum 5 Heat trace asymptotics of manifolds with boundary 6 Heat trace asymptotics and index theory 7 Heat content asymptotics 8 Heat content with source terms 9 Time dependent phenomena 10 Spectral boundary conditions 11 Operators which are not of Laplace type 12 The spectral geometry of Riemannian submersions 1 Introduction The field of spectral geometry is a vibrant and active one. In these brief notes, we will sketch some of the recent developments in this area. Our choice is somewhat idiosyncratic and owing to constraints of space necessarily incomplete. It is impossible to give a com- plete bibliography for such a survey. We refer Carslaw and Jaeger [41] for a comprehensive discussion of problems associated with heat flow, to Gilkey [54] and to Melrose [91] for a discussion of heat equation methods related to the index theorem, to Gilkey [56] and to Kirsten [84] for a calculation of various heat trace and heat content asymptotic formulas, to Gordon [66] for a survey of isospectral manifolds, to Grubb [73] for a discussion of the pseudo-differential calculus relating to boundary problems, and to Seeley [116] for an introduction to the pseudo-differential calculus. Throughout we shall work with smooth manifolds and, if present, smooth boundaries. We have also given in each section a few ad- ditional references to relevant works.
    [Show full text]
  • Spectral Geometry, Volume 84
    http://dx.doi.org/10.1090/pspum/084 Spectral Geometry This page intentionally left blank Proceedings of Symposia in PURE MATHEMATICS Volume 84 Spectral Geometry Alex H. Barnett Carolyn S. Gordon Peter A. Perry Alejandro Uribe Editors M THE ATI A CA M L ΤΡΗΤΟΣ ΜΗ N ΕΙΣΙΤΩ S A O C C I I American Mathematical Society R E E T ΑΓΕΩΜΕ Y M Providence, Rhode Island A F O 8 U 88 NDED 1 2010 INTERNATIONAL CONFERENCE ON SPECTRAL GEOMETRY with support from the National Science Foundation, grant DMS-1005360 2010 Mathematics Subject Classification. Primary 58J53, 58J50, 58J51, 65N25, 35P15, 11F72, 53C20, 34L15, 34E05, 57R18. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation. Library of Congress Cataloging-in-Publication Data International conference on Spectral Geometry (2010 : Dartmouth College) Spectral geometry : international conference, July 19–23, 2010, Dartmouth College, Dart- mouth, New Hampshire / Alex H. Barnett, Carolyn S. Gordon, Peter A. Perry, Alejandro Uribe, editors. pages cm. — (Proceedings of symposia in pure mathematics ; volume 84) Includes bibliograpical references. ISBN 978-0-8218-5319-1 (alk. paper) 1. Spectral geometry—Congresses. I. Barnett, Alex, 1972 December 7–editor of compilation. II. Title. QA614.95.I58 2010 516.362–dc23 2012024258 Copying and reprinting. Material in this book may be reproduced by any means for edu- cational and scientific purposes without fee or permission with the exception of reproduction by services that collect fees for delivery of documents and provided that the customary acknowledg- ment of the source is given.
    [Show full text]
  • Org: Richard Froese (UBC), Dmitry Jakobson (Mcgill) And/Et Mahta Khosravi (UBC
    Spectral Theory Th´eoriespectrale (Org: Richard Froese (UBC), Dmitry Jakobson (McGill) and/et Mahta Khosravi (UBC)) BEN ADCOCK, Simon Fraser University Stable sampling in Hilbert spaces In this talk we consider the problem of reconstructing an element of a Hilbert space in a particular basis, given its samples with respect to another basis. Such a problem lies at the heart of modern sampling theory. The last several decades have witnessed the development of a general framework for this problem, which, as we describe, admits a simple operator-theoretic interpretation in terms of finite sections of infinite matrices. Unfortunately, operators occurring in sampling problems are often non-self adjoint. Hence, the spectral properties of the infinite-dimensional operator are not typically inherited at the finite-dimensional level, leading to issues with both convergence and stability. Recently, much progress has been made towards the approximation of spectra and pseudospectra of non-self adjoint linear operators. By using ideas developed therein, we present a new generalised sampling framework that overcomes these issues and possesses both guaranteed convergence and stability. Joint work with Anders Hansen (Cambridge). TAYEB AISSIOU, McGill University Semiclassical limits of eigenfunctions of the Laplacian on Tn We will present a proof of the conjecture formulated by D. Jakobson in 1995, which states that on a n-dimensional flat torus n 2 n T , the Fourier series of squares of the eigenfunctions |φλ| of the Laplacian have uniform l bounds that do not depend on the eigenvalue λ. The proof is a generalization of the argument presented in papers [1,2] and requires a geometric lemma n that bounds√ the number of codimension one simplices which satisfy a certain restriction on an n-dimensional sphere S (λ) of radius λ.
    [Show full text]
  • Spectral Geometry Bruno Iochum
    Spectral Geometry Bruno Iochum To cite this version: Bruno Iochum. Spectral Geometry. A. Cardonna, C. Neira-Jemenez, H. Ocampo, S. Paycha and A. Reyes-Lega. Spectral Geometry, Aug 2011, Villa de Leyva, Colombia. World Scientific, 2014, Geometric, Algebraic and Topological Methods for Quantum Field Theory, 978-981-4460-04-0. hal- 00947123 HAL Id: hal-00947123 https://hal.archives-ouvertes.fr/hal-00947123 Submitted on 14 Feb 2014 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Spectral Geometry Bruno Iochum Aix-Marseille Université, CNRS UMR 7332, CPT, 13288 Marseille France Abstract The goal of these lectures is to present some fundamentals of noncommutative geometry looking around its spectral approach. Strongly motivated by physics, in particular by relativity and quantum mechanics, Chamseddine and Connes have defined an action based on spectral considerations, the so-called spectral action. The idea here is to review the necessary tools which are behind this spectral action to be able to compute it first in the case of Riemannian manifolds (Einstein–Hilbert action). Then, all primary objects defined for manifolds will be generalized to reach the level of noncommutative geometry via spectral triples, with the concrete analysis of the noncommutative torus which is a deformation of the ordinary one.
    [Show full text]