18-02-2026
Speaker: Om Milind Joglekar
Abstract: This talk examines the Perron-Frobenius theorem, focusing on the existence of a strictly positive eigenvector and the spectral consequences of irreducibility. We will specifically connect these analytic properties to graph-theoretic concepts like connectivity and cycle periodicity.
Time: 5:30 PM–6:30 PM
Venue: Ramanujan Hall
11-02-2026
Speaker: Aditya Khambete
Abstract: In this talk we will introduce the notion of copulas to model the dependence in multivariate distributions, discuss how the classical notion fails for discrete multivariate distributions, and then use ideas from Geenens (2020) to extend the idea to multivariate discrete distributions.
Time: 2:00 PM–3:00 PM
Venue: Room 215
05-02-2026
Speaker: Satya Sai Aditya Duggaraju
Abstract: We give a proof of the Kolmogorov's extension theorem and, as an application, derive the Ionescu-Tuleca theorem. The talk only assumes familiarity with basic measure and probability theory.
Time: 2:00 PM–3:00 PM
Venue: Room 215
28-01-2026
Speaker: Poduri Pradyumna Datta
Abstract: The Matrix-Tree Theorem states that the number of spanning trees of a connected graph G equals any cofactor of its Laplacian matrix L. In this talk a proof using the Cauchy-Binet formula will be presented and some applications explored.
Time: 2:00 PM–3:00 PM
Venue: Room 215