Dimension (graph theory)

Diameter of a Graph | Graph Theory

What is the diameter of a graph in graph theory? This is a simple term we will define with examples in today's video graph theory lesson! Remember that the distance between two connected vertices in a graph is the length of a shortest path between those vertices. Here's my lesson on dist

From playlist Graph Theory

Graph Theory: 51. Eccentricity, Radius & Diameter

Eccentricity, radius and diameter are terms that are used often in graph theory. They are related to the concept of the distance between vertices. The distance between a pair of vertices is the length of a shortest path between them. We begin by reviewing some of the properties of dista

From playlist Graph Theory part-9

Diameter and Radius of Graphs | Graph Theory

We define the radius of a graph and the diameter of a graph using the eccentricity of vertices. We relate these terms intuitively back to circles and discuss several examples of graph diameter and graph radius. We also introduce a theorem stating the diameter of a graph is bounded between

From playlist Graph Theory

Graph Theory: Basic Definitions

This video describes some basic definitions associated with graph theory.

From playlist Basics: Graph Theory

Graph Theory Terminology

From playlist M. Graph Theory

The Definition of a Graph (Graph Theory)

The Definition of a Graph (Graph Theory) mathispower4u.com

From playlist Graph Theory (Discrete Math)

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

Wolfram Physics Project: Working Session Mar. 30, 2021 [Dimension Evolution in the Early Universe]

This is a Wolfram Physics Project working session on dimension evolution in the early Universe in the Wolfram Model. Begins at 7:35 Originally livestreamed at: https://twitch.tv/stephen_wolfram Stay up-to-date on this project by visiting our website: http://wolfr.am/physics Check out the

From playlist Wolfram Physics Project Livestream Archive

Graph Theory Talk: Graphs, Edges, Vertices, Adjacency Matrix and it's Eigenvalues

Graph Theory Stuff: Graphs, Edges, Vertices, Adjacency Matrix and it's Eigenvalues

From playlist Graph Theory

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

The SYK Model by David Gross

Kavli Distinguished Lecture SPEAKER: David Gross (KITP - University of California, Santa Barbara) DATE & TIME: 08 January 2018, 09:00 to 10:30 VENUE: Ramanujan Lecture Hall, ICTS, Bengaluru Abstract: A perspective on large N theories: their role in quantum field theory, in gauge-gravit

From playlist Kavli Asian Winter School (KAWS) on Strings, Particles and Cosmology 2018

Graph Theory: 50. Maximum vs Maximal

Here we describe the difference between two similar sounding words in mathematics: maximum and maximal. We use concepts in graph theory to highlight the difference. In particular, we define an independent set in a graph and a component in a graph and look at some examples. -- Bits of Gra

From playlist Graph Theory part-9

What Every Physicist Should Know About String Theory: Edward Witten

https://strings2015.icts.res.in/talkTitles.php Table of Contents (powered by https://videoken.com) 0:00:00 Introduction 0:01:05 [Talk: What Every Physicist Should Know About String Theory by Edward Witten] 0:02:46 Anyone who has studied physics is familiar with the fact that while physics

From playlist Strings 2015 conference

Knots, three-manifolds and instantons – Peter Kronheimer & Tomasz Mrowka – ICM2018

Plenary Lecture 11 Knots, three-manifolds and instantons Peter Kronheimer & Tomasz Mrowka Abstract: Over the past four decades, input from geometry and analysis has been central to progress in the field of low-dimensional topology. This talk will focus on one aspect of these developments

From playlist Plenary Lectures

Sergei Gukov - Fivebranes and 4-manifolds

Sergei GUKOV (Caltech, Pasadena, USA)

From playlist Algèbre, Géométrie et Physique : une conférence en l'honneur

Joel Friedman - Sheaves on Graphs, L^2 Betti Numbers, and Applications.

Joel Friedman (University of British Columbia, Canada) Sheaf theory and (co)homology, in the generality developed by Grothendieck et al., seems to hold great promise for applications in discrete mathematics. We shall describe sheaves on graphs and their applications to (1) solving the

From playlist T1-2014 : Random walks and asymptopic geometry of groups.

High dimensional expanders – Alexander Lubotzky – ICM2018

Plenary Lecture 13 High dimensional expanders Alexander Lubotzky Abstract: Expander graphs have been, during the last five decades, the subject of a most fruitful interaction between pure mathematics and computer science, with influence and applications going both ways. In the last decad

From playlist Plenary Lectures

Omer Bobrowski: Random Simplicial Complexes, Lecture I

A simplicial complex is a collection of vertices, edges, triangles, tetrahedra and higher dimensional simplexes glued together. In other words, it is a higher-dimensional generalization of a graph. In recent years there has been a growing effort in developing the theory of random simplicia

From playlist Workshop: High dimensional spatial random systems

Order and Size of a Graph | Graph Theory

What is the order and size of a graph? We'll go over them both in this math lesson! A graph is an ordered pair with a vertex set and an edge set. The order of a graph is the cardinality of its vertex set, which is the number of vertices in the graph. The size of a graph is the cardinality

From playlist Graph Theory

Oliver SCHNETZ - 2010-2020: a Decade of Quantum Computing

Supported by Dirk Kreimer, in 2010 I started analyzing and calculating high loop-order amplitudes in perturbative quantum field theory. The main tools were graphical functions, generalized single-valued hyperlogarithms (GSVHs), and the c_2-invariant. I will report on the progress that has

From playlist Algebraic Structures in Perturbative Quantum Field Theory: a conference in honour of Dirk Kreimer's 60th birthday