Spectral theory | Algebraic graph theory
In mathematics, spectral graph theory is the study of the properties of a graph in relationship to the characteristic polynomial, eigenvalues, and eigenvectors of matrices associated with the graph, such as its adjacency matrix or Laplacian matrix. The adjacency matrix of a simple undirected graph is a real symmetric matrix and is therefore orthogonally diagonalizable; its eigenvalues are real algebraic integers. While the adjacency matrix depends on the vertex labeling, its spectrum is a graph invariant, although not a complete one. Spectral graph theory is also concerned with graph parameters that are defined via multiplicities of eigenvalues of matrices associated to the graph, such as the Colin de Verdière number. (Wikipedia).
Raffaella Mulas - Spectral theory of hypergraphs
Hypergraphs are a generalization of graphs in which vertices are joined by edges of any size. In this talk, we generalize the graph normalized Laplace operators to the case of hypergraphs, and we discuss some properties of their spectra. We discuss the geometrical meaning of the largest an
From playlist Research Spotlight
What are Connected Graphs? | Graph Theory
What is a connected graph in graph theory? That is the subject of today's math lesson! A connected graph is a graph in which every pair of vertices is connected, which means there exists a path in the graph with those vertices as endpoints. We can think of it this way: if, by traveling acr
From playlist Graph Theory
What is a Graph? | Graph Theory
What is a graph? A graph theory graph, in particular, is the subject of discussion today. In graph theory, a graph is an ordered pair consisting of a vertex set, then an edge set. Graphs are often represented as diagrams, with dots representing vertices, and lines representing edges. Each
From playlist Graph Theory
Elba Garcia-Failde - Quantisation of Spectral Curves of Arbitrary Rank and Genus via (...)
The topological recursion is a ubiquitous procedure that associates to some initial data called spectral curve, consisting of a Riemann surface and some extra data, a doubly indexed family of differentials on the curve, which often encode some enumerative geometric information, such as vol
From playlist Workshop on Quantum Geometry
The Definition of a Graph (Graph Theory)
The Definition of a Graph (Graph Theory) mathispower4u.com
From playlist Graph Theory (Discrete Math)
Graph Theory: 05. Connected and Regular Graphs
We give the definition of a connected graph and give examples of connected and disconnected graphs. We also discuss the concepts of the neighbourhood of a vertex and the degree of a vertex. This allows us to define a regular graph, and we give some examples of these. --An introduction to
From playlist Graph Theory part-1
Chris Godsil: Problems with continuous quantum walks
Continuous quantum walks are of great interest in quantum computing and, over the last decade, my group has been studying this topic intensively. As graph theorists, one of our main goals has been to get a better understanding of the relation between the properties of a walk and the proper
From playlist Combinatorics
Vladimir KAZAKOV - Conformal Fishnet Theory in Any Dimension
I will review the properties and recent results for conformal fishnet theory (FCFT) which was proposed by O. Gurdogan and myself as a special double scaling limit of gamma-twisted N=4 SYM theory. FCFT, in its simplest, bi-scalar version, is a UV finite strongly coupled 4-dimensional logari
From playlist Integrability, Anomalies and Quantum Field Theory
35. Finding Clusters in Graphs
MIT 18.065 Matrix Methods in Data Analysis, Signal Processing, and Machine Learning, Spring 2018 Instructor: Gilbert Strang View the complete course: https://ocw.mit.edu/18-065S18 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP63oMNUHXqIUcrkS2PivhN3k The topic of this
From playlist MIT 18.065 Matrix Methods in Data Analysis, Signal Processing, and Machine Learning, Spring 2018
High Dimensional Expanders - Ori Parzanchevski
Ori Parzanchevski Hebrew University of Jerusalem; Member, School of Mathematics October 1, 2013 For more videos, visit http://video.ias.edu
From playlist Mathematics
Ana Romero: Effective computation of spectral systems and relation with multi-parameter persistence
Title: Effective computation of spectral systems and their relation with multi-parameter persistence Abstract: Spectral systems are a useful tool in Computational Algebraic Topology that provide topological information on spaces with generalized filtrations over a poset and generalize the
From playlist AATRN 2022
Geometry and topology of Hamiltonian Floer complexes in low-dimension - Dustin Connery-Grigg
Joint IAS/Princeton/Montreal/Paris/Tel-Aviv Symplectic Geometry Zoominar Topic: Geometry and topology of Hamiltonian Floer complexes in low-dimension Speaker: Dustin Connery-Grigg Affiliation: Université de Montreal Date: January 28, 2022 In this talk, I will present two results relating
From playlist Mathematics
Concentration of random graphs and application to community detection – E. Levina – ICM2018
Probability and Statistics Invited Lecture 12.10 Concentration of random graphs and application to community detection Elizaveta Levina Abstract: Random matrix theory has played an important role in recent work on statistical network analysis. In this paper, we review recent results on r
From playlist Probability and Statistics
Dimers and Beauville Integrable systems by Terrence George
PROGRAM: COMBINATORIAL ALGEBRAIC GEOMETRY: TROPICAL AND REAL (HYBRID) ORGANIZERS: Arvind Ayyer (IISc, India), Madhusudan Manjunath (IITB, India) and Pranav Pandit (ICTS-TIFR, India) DATE: 27 June 2022 to 08 July 2022 VENUE: Madhava Lecture Hall and Online Algebraic geometry is the study
From playlist Combinatorial Algebraic Geometry: Tropical and Real (HYBRID)
Graph Theory FAQs: 01. More General Graph Definition
In video 02: Definition of a Graph, we defined a (simple) graph as a set of vertices together with a set of edges where the edges are 2-subsets of the vertex set. Notice that this definition does not allow for multiple edges or loops. In general on this channel, we have been discussing o
From playlist Graph Theory FAQs
Xavier Bresson: "Convolutional Neural Networks on Graphs"
New Deep Learning Techniques 2018 "Convolutional Neural Networks on Graphs" Xavier Bresson, Nanyang Technological University, Singapore Abstract: Convolutional neural networks have greatly improved state-of-the-art performances in computer vision and speech analysis tasks, due to its hig
From playlist New Deep Learning Techniques 2018
Graph Theory: 02. Definition of a Graph
In this video we formally define what a graph is in Graph Theory and explain the concept with an example. In this introductory video, no previous knowledge of Graph Theory will be assumed. --An introduction to Graph Theory by Dr. Sarada Herke. This video is a remake of the "02. Definitio
From playlist Graph Theory part-1
Probability on Kazhdan Groups (Lecture 2) by Gábor Pete
PROGRAM: PROBABILISTIC METHODS IN NEGATIVE CURVATURE ORGANIZERS: Riddhipratim Basu (ICTS - TIFR, India), Anish Ghosh (TIFR, Mumbai, India), Subhajit Goswami (TIFR, Mumbai, India) and Mahan M J (TIFR, Mumbai, India) DATE & TIME: 27 February 2023 to 10 March 2023 VENUE: Madhava Lecture Hall
From playlist PROBABILISTIC METHODS IN NEGATIVE CURVATURE - 2023