Graphing Equations By Plotting Points - Part 1
This video shows how to graph equations by plotting points. Part 1 of 2 http://www.mathispower4u.yolasite.com
From playlist Graphing Various Functions
Graph Data Structure 1. Terminology and Representation (algorithms)
This is the first in a series of videos about the graph data structure. It mentions the applications of graphs, defines various terminology associated with graphs, and describes how a graph can be represented programmatically by means of adjacency lists or an adjacency matrix.
From playlist Data Structures
How to Layout Panel Charts or Shape Grids with a VBA Macro in Excel (Part 3)
Sign up for our Excel webinar, times added weekly: https://www.excelcampus.com/blueprint-registration/ Learn how to quickly layout your charts in a panel chart or shape grid with a VBA macro in Excel. Download the Excel file: https://www.excelcampus.com/vba/panel-charts-shape-grid-macro/
From playlist Excel Macros & VBA
Rotating graph of graph with four critical points
From playlist 3d graphs
Graph of x^2 + 6xy + 5y^2 rotating
From playlist 3d graphs
Data structures: Introduction to Doubly Linked List
See complete series on data structures here: http://www.youtube.com/playlist?list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P In this lesson, we have described doubly linked list data structure. For practice problems and more, visit: http://www.mycodeschool.com Like us on Facebook: https://www
From playlist Data structures
Graph Representation part 01 - Edge List
See complete series on data structures here: http://www.youtube.com/playlist?list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P In this lesson, we have described how we can represent and store a graph in computer's memory as vertex-list and edge-list. We have analyzed the time and space complexities
From playlist Data structures
Planar graphs, What are planar graphs? In this video we take a look at what a planar graph is and how Mathematica can check to see if a graph is planar. In short, a planar graph is one that can be drawn in the plane such that no edges cross. If you want to learn more about Mathematica,
From playlist Introducing graph theory
Ben Knudsen (2/11/21): Topological complexity of pure graph braid groups
Title: Topological complexity of pure graph braid groups Abstract: I will discuss a recent proof of a conjecture of Farber, asserting that the ordered configuration spaces of graphs have the highest possible topological complexity generically.
From playlist Topological Complexity Seminar
Ben Knudsen (7/28/22): The topological complexity of pure graph braid groups is stably maximal
I will discuss a proof of Farber's conjecture on the topological complexity of configuration spaces of graphs. The argument eschews cohomology, relying instead on group theoretic estimates for higher topological complexity due to Farber–Oprea following Grant–Lupton–Oprea.
From playlist Topological Complexity Seminar
Small-worlds, complex networks and random graphs (Lecture 2) by Remco van der Hofstad
PROGRAM: ADVANCES IN APPLIED PROBABILITY ORGANIZERS: Vivek Borkar, Sandeep Juneja, Kavita Ramanan, Devavrat Shah, and Piyush Srivastava DATE & TIME: 05 August 2019 to 17 August 2019 VENUE: Ramanujan Lecture Hall, ICTS Bangalore Applied probability has seen a revolutionary growth in resear
From playlist Advances in Applied Probability 2019
Christian Krattenthaler - Combinatorics of Discrete Lattice Models (2012
Combinatorics of Discrete Lattice Models Christian Krattenthaler University of Vienna The past 20 years have seen a period of constantly increasing, fruitful interaction between (enumerative) combinatorialists and (statistical) physicists.This interaction has been and is taking place part
From playlist Mathematics
Catherine Greenhill (UNSW), The small subgraph conditioning method and hypergraphs, 26th May 2020
Speaker: Catherine Greenhill (UNSW) Title: The small subgraph conditioning method and hypergraphs Abstract: The small subgraph conditioning method is an analysis of variance technique which was introduced by Robinson and Wormald in 1992, in their proof that almost all cubic graphs are Ha
From playlist Seminars
MIT 18.404J Theory of Computation, Fall 2020 Instructor: Michael Sipser View the complete course: https://ocw.mit.edu/18-404JF20 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP60_JNv2MmK3wkOt9syvfQWY Reviewed log space: NL is a subset of SPACE(log^2n) and NL is a subse
From playlist MIT 18.404J Theory of Computation, Fall 2020
AQS-automata, state transition graphs, return-point by Muhittin Mungan
Program Entropy, Information and Order in Soft Matter  ORGANIZERS Bulbul Chakraborty, Pinaki Chaudhuri, Chandan Dasgupta, Marjolein Dijkstra, Smarajit Karmakar, Vijaykumar Krishnamurthy, Jorge Kurchan, Madan Rao, Srikanth Sastry and Francesco Sciortino DATE & TIME 27 August 2018 to
From playlist Entropy, Information and Order in Soft Matter
IMS Public Lecture: From Puzzles to Moduli Spaces
Hugo Parlier, University of Fribourg, Switzerland
From playlist Public Lectures
Networks: Part 3 - Oxford Mathematics 4th Year Student Lecture
Network Science provides generic tools to model and analyse systems in a broad range of disciplines, including biology, computer science and sociology. This course (we are showing the whole course over the next few weeks) aims at providing an introduction to this interdisciplinary field o
From playlist Oxford Mathematics Student Lectures - Networks
Graph of x^2 + 6xb + 5b^2 as b varies
From playlist 3d graphs
Zhongyang Li: "XOR Ising model and constrained percolation"
Asymptotic Algebraic Combinatorics 2020 "XOR Ising model and constrained percolation" Zhongyang Li - University of Connecticut Abstract: I will discuss the percolation properties of the critical and non-critical XOR Ising models in the 2D Euclidean plane and in the hyperbolic plane, whos
From playlist Asymptotic Algebraic Combinatorics 2020