Random Graph Matching with Improved Noise Robustness
Offered By: Hausdorff Center for Mathematics via YouTube
Course Description
Overview
Explore a 44-minute lecture on graph matching and network alignment, focusing on a new algorithm for exact matching of correlated Erdos-Renyi graphs. Delve into this fundamental computational problem that has applications in computer vision and biology. Learn about the process of finding a bijection between vertex sets of two given graphs to maximally align their edges. Discover the improved noise robustness of the presented algorithm, based on joint work with Cheng Mao and Mark Rudelson. Gain insights into this cutting-edge research presented by Konstantin Tikhomirov at the Hausdorff Center for Mathematics.
Syllabus
Konstantin Tikhomirov: Random Graph Matching with Improved Noise Robustness
Taught by
Hausdorff Center for Mathematics
Related Courses
Synapses, Neurons and BrainsHebrew University of Jerusalem via Coursera Моделирование биологических молекул на GPU (Biomolecular modeling on GPU)
Moscow Institute of Physics and Technology via Coursera Bioinformatics Algorithms (Part 2)
University of California, San Diego via Coursera Biology Meets Programming: Bioinformatics for Beginners
University of California, San Diego via Coursera Neuronal Dynamics
École Polytechnique Fédérale de Lausanne via edX