{"id":15221,"date":"2021-03-10T10:59:02","date_gmt":"2021-03-10T07:59:02","guid":{"rendered":"https:\/\/w3.bilkent.edu.tr\/en\/?p=15221"},"modified":"2021-03-11T23:37:09","modified_gmt":"2021-03-11T20:37:09","slug":"math-seminar-random-graph-matching-with-improved-noise-robustness-berke-torunoglu-ph-d-6-30pm-march-10-en","status":"publish","type":"post","link":"https:\/\/w3.bilkent.edu.tr\/en\/math-seminar-random-graph-matching-with-improved-noise-robustness-berke-torunoglu-ph-d-6-30pm-march-10-en\/","title":{"rendered":"MATH Seminar: \u201cRandom Graph Matching with Improved Noise Robustness\u201d, Berke TORUNO\u011eLU, Ph.D,, 6.30PM March 10 (EN)"},"content":{"rendered":"<p>You are cordially invited to the Analysis Seminar organized by the Department of Mathematics.<\/p>\n<p>Speaker: Konstantin Tikhomirov (Georgia Institute of Technology)<\/p>\n<p>\u201cRANDOM GRAPH MATCHING WITH IMPROVED NOISE ROBUSTNESS\u201d<\/p>\n<p>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.<br \/>\nBased on joint work with Cheng Mao and Mark Rudelson.<\/p>\n<p>Date: 10 March, 2021<br \/>\nTime: 18:30, GMT+3<\/p>\n<p>This is an online seminar. To request the event link, please send a message to goncha@fen.bilkent.edu.tr<\/p>\n","protected":false},"excerpt":{"rendered":"<p>You are cordially invited to the Analysis Seminar organized by the Department of Mathematics. Speaker: Konstantin Tikhomirov (Georgia Institute of Technology) \u201cRANDOM GRAPH MATCHING WITH IMPROVED NOISE ROBUSTNESS\u201d Abstract: Graph matching, also known as network alignment, refers to finding a bijection between the vertex sets of two given graphs so [\u2026] <\/p>\n<div class=\"clear\"><\/div>\n<p><a class=\"more_link clearfix\" href=\"https:\/\/w3.bilkent.edu.tr\/en\/math-seminar-random-graph-matching-with-improved-noise-robustness-berke-torunoglu-ph-d-6-30pm-march-10-en\/\" rel=\"nofollow\">Read More<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[12],"tags":[],"class_list":["post-15221","post","type-post","status-publish","format-standard","hentry","category-oldposts"],"_links":{"self":[{"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/posts\/15221","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/comments?post=15221"}],"version-history":[{"count":1,"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/posts\/15221\/revisions"}],"predecessor-version":[{"id":15222,"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/posts\/15221\/revisions\/15222"}],"wp:attachment":[{"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/media?parent=15221"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/categories?post=15221"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/tags?post=15221"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}