Semi-coarse Spaces, Homotopy [Jonathan Treviño-Marroquín]
Semi-coarse spaces is an alternative to study (undirected) graphs through large-scale geometry. In this video, we present the structure and a homotopy what we worked on. In the final part, we look at the fundamental homotopy group of cyclic graphs.
From playlist Contributed Videos
What are Cycle Graphs? | Graph Theory, Graph Cycles, Cyclic Graphs
What are cycle graphs? We have talked before about graph cycles, which refers to a way of moving through a graph, but a cycle graph is slightly different. A cycle graph is what you would get if you took the vertices and edges of a graph cycle. We can think of cycle graphs as being path gra
From playlist Graph Theory
Sarah Percival 7/27/22: Computation of Reeb Graphs in a Semi-Algebraic Setting
The Reeb graph is a tool from Morse theory that has recently found use in applied topology due to its ability to track changes in connectivity of level sets of a function. In this talk, I will motivate the use of semi-algebraic geometry as a setting for problems in applied topology and sho
From playlist AATRN 2022
Many Nodal Domains in Random Regular Graphs by Nikhil Srivastava
PROGRAM: TOPICS IN HIGH DIMENSIONAL PROBABILITY ORGANIZERS: Anirban Basak (ICTS-TIFR, India) and Riddhipratim Basu (ICTS-TIFR, India) DATE & TIME: 02 January 2023 to 13 January 2023 VENUE: Ramanujan Lecture Hall This program will focus on several interconnected themes in modern probab
From playlist TOPICS IN HIGH DIMENSIONAL PROBABILITY
Lei Wang: "Tropical Tensor Networks"
Tensor Methods and Emerging Applications to the Physical and Data Sciences 2021 Workshop I: Tensor Methods and their Applications in the Physical and Data Sciences "Tropical Tensor Networks" Lei Wang - Chinese Academy of Sciences Abstract: I will present a unified exact tensor network ap
From playlist Tensor Methods and Emerging Applications to the Physical and Data Sciences 2021
Overview of Loops in Graph Theory | Graph Loop, Multigraphs, Pseudographs
What are loops in graph theory? Sometimes called self loops, a loop in a graph is an edge that connects a vertex to itself. These are not allowed in what are often called "simple graphs", which are the graphs we usually study when we begin studying graph theory. In simple graphs, loop ed
From playlist Graph Theory
Benson Au: "Finite-rank perturbations of random band matrices via infinitesimal free probability"
Asymptotic Algebraic Combinatorics 2020 "Finite-rank perturbations of random band matrices via infinitesimal free probability" Benson Au - University of California, San Diego (UCSD) Abstract: Free probability provides a unifying framework for studying random multi-matrix models in the la
From playlist Asymptotic Algebraic Combinatorics 2020
Edge behavior of deformed Wigner matrices - Kevin Schnelli
Kevin Schnelli Harvard University; Member, School of Mathematics September 25, 2013 For more videos, visit http://video.ias.edu
From playlist Mathematics
Many Nodal Domains in Random Regular Graphs - Nikhil Srivastava
Computer Science/Discrete Mathematics Seminar I Topic: Many Nodal Domains in Random Regular Graphs Speaker: Nikhil Srivastava Affiliation: University of California, Berkeley Date: April 04, 2022 A nodal domain of a Laplacian eigenvector of a graph is a maximal connected component where i
From playlist Mathematics
Empty Graph, Trivial Graph, and the Null Graph | Graph Theory
Whenever we talk about something that is defined by sets, it is important to consider the empty set and how it fits into the definition. In graph theory, empty sets in the definition of a particular graph can bring on three types/categories of graphs. The empty graphs, the trivial graph, a
From playlist Graph Theory
OCR MEI MwA D: Graph Theory: 09 Complete Bipartite Graphs
https://www.buymeacoffee.com/TLMaths Navigate all of my videos at https://sites.google.com/site/tlmaths314/ Like my Facebook Page: https://www.facebook.com/TLMaths-1943955188961592/ to keep updated Follow me on Instagram here: https://www.instagram.com/tlmaths/ Many, MANY thanks to Dea
From playlist OCR MEI MwA D: Graph Theory
PMSP - Quasi-random graphs and hypergraphs - Fan Chung Graham
Fan Chung Graham UC San Diego June 16, 2010 For more videos, visit http://video.ias.edu
From playlist Mathematics
What is a Bipartite Graph? | Graph Theory
What is a bipartite graph? We go over it in today’s lesson! I find all of these different types of graphs very interesting, so I hope you will enjoy this lesson. A bipartite graph is any graph whose vertex set can be partitioned into two disjoint sets (called partite sets), such that all e
From playlist Graph Theory
Computing Embedded Contact Homology in the Morse-Bott Setting using Cascades - Yuan Yao
Joint IAS/Princeton University Symplectic Geometry Seminar Topic: Computing Embedded Contact Homology in the Morse-Bott Setting using Cascades Speaker: Yuan Yao Affiliation: University of California, Berkeley Date: November 28, 2022 I will first give an overview of ECH. Then I will desc
From playlist Mathematics
Machine- Learning the Landscape (Lecture 1) by Yang-Hui He
PROGRAM KAVLI ASIAN WINTER SCHOOL (KAWS) ON STRINGS, PARTICLES AND COSMOLOGY (ONLINE) ORGANIZERS Francesco Benini (SISSA, Italy), Bartek Czech (Tsinghua University, China), Dongmin Gang (Seoul National University, South Korea), Sungjay Lee (Korea Institute for Advanced Study, South Korea
From playlist Kavli Asian Winter School (KAWS) on Strings, Particles and Cosmology (ONLINE) - 2022
Alina Stancu: Some comments on the fundamental gap of the Dirichlet Laplacian in hyperbolic space
I will present some results on the fundamental gap of convex domains in hyperbolic space for different types of convexity. The results are in contrast with the behaviour of the fundamental gap in Euclidean space and I will make some comments on the aspects of the problem that are different
From playlist Workshop: High dimensional measures: geometric and probabilistic aspects
Avi Wigderson & László Lovász - The Abel Prize interview 2021
00:30 Interview start 01:03 On the place of discrete math and theoretical computer science 08:14 Turing and Hilbert 14:28 P vs NP problem, what is it and why is it important? 25:09 Youth in Haifa, Avi Wigderson 30:09 Youth in Budapest, László Lovász 37:45 Problem solver or theory builde
From playlist László Lovász
Inner & Outer Semidirect Products Derivation - Group Theory
Semidirect products are a very important tool for studying groups because they allow us to break a group into smaller components using normal subgroups and complements! Here we describe a derivation for the idea of semidirect products and an explanation of how the map into the automorphism
From playlist Group Theory
OCR MEI MwA D: Graph Theory: 07 Bipartite Graphs
https://www.buymeacoffee.com/TLMaths Navigate all of my videos at https://sites.google.com/site/tlmaths314/ Like my Facebook Page: https://www.facebook.com/TLMaths-1943955188961592/ to keep updated Follow me on Instagram here: https://www.instagram.com/tlmaths/ Many, MANY thanks to Dea
From playlist OCR MEI MwA D: Graph Theory
Local eigenvalue statistics for random regular graphs - Bauerschmidt
Analysis Seminar Topic: Local eigenvalue statistics for random regular graphs Speaker: Roland Bauerschmidt Date: Wednesday, March 16 I will discuss results on local eigenvalue statistics for uniform random regular graphs. For graphs whose degrees grow slowly with the number of vertic
From playlist Mathematics