YoVDO

Superport Networks: Generalizing Kirchhoff's Matrix-Tree Theorem

Offered By: Institute for Pure & Applied Mathematics (IPAM) via YouTube

Tags

Graph Theory Courses Statistical Mechanics Courses Combinatorial Mathematics Courses Discrete Geometry Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a 49-minute lecture on superport networks presented by Pavlo Pylyavskyy from the University of Minnesota, Twin Cities, at IPAM's Statistical Mechanics and Discrete Geometry Workshop. Delve into the study of multiport networks, which differ from traditional electrical networks in their boundary conditions. Learn how boundary vertices are paired, with incoming currents summing to zero in each pair. Discover the generalization of Kirchhoff's matrix-tree theorem for this setup, including the complexities of different forests contributing with varying signs. Examine the use of Kenyon and Wilson's formula for response matrix minors, determinantal identities, and combinatorial bijections in proving these theorems. Gain insights into superport networks, a concept that encompasses both ordinary and multiport networks. Recorded on March 26, 2024, this talk presents joint work with Svetlana Shirokovskikh and Mikhail Skopenkov, offering a deep dive into advanced concepts in electrical engineering and network theory.

Syllabus

Pavlo Pylyavskyy - Superport networks - IPAM at UCLA


Taught by

Institute for Pure & Applied Mathematics (IPAM)

Related Courses

Aplicaciones de la teoría de grafos a la vida real
Miríadax
Aplicaciones de la Teoría de Grafos a la vida real
Universitat Politècnica de València via UPV [X]
Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX
Genome Sequencing (Bioinformatics II)
University of California, San Diego via Coursera
Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer