Speaker: Kedar Damle, TIFR Mumbai
November 29, 2024 05:00 PM
- 06:00 PM
Abstract:
"Maximum matchings" of large disordered graphs (equivalently, "maximally-packed dimer models" defined on such graphs) typically have an extensive (scaling linearly with the number of vertices) number of unmatched vertices - in the language of the maximally-packed dimer model, these vertices host the "monomers" of the maximally-packed dimer configuration. Using the structure theory of graphs, we decompose the disordered graph into a complete set of non-overlapping monomer-carrying "R-type" and perfectly matched "P-type" regions, and identify (using large-scale computer simulations) unusual percolation phenomena exhibited by these regions. (Joint work with Ritesh Bhola, Sounak Biswas, and Mursalin Islam.)