You are cordially invited to the Analysis Seminar organized by the Department of Mathematics.
Speaker: Konstantin Tikhomirov (Georgia Institute of Technology)
“RANDOM GRAPH MATCHING WITH IMPROVED NOISE ROBUSTNESS”
Abstract: Graph matching, also known as network alignment, refers to finding a bijection between the vertex sets of two given graphs so as to maximally align their edges. This fundamental computational problem arises frequently in multiple fields such as computer vision and biology. In this work we will discuss a new algorithm for exact matching of correlated Erdos-Renyi graphs.
Based on joint work with Cheng Mao and Mark Rudelson.
Date: 10 March, 2021
Time: 18:30, GMT+3
This is an online seminar. To request the event link, please send a message to firstname.lastname@example.org