Graph alignment for Erdos-Renyi random graphs | Probability Seminar-探花视频

探花视频

研讨班

探花视频 > 书院学术 > 至美数学 > 研讨班

Graph alignment for Erdos-Renyi random graphs | Probability Seminar

来源： 12-12

时间：2023-12-12 Tue 14:00-15:30

地点：A3-2a-302 ZOOM:361 038 6975（PW: BIMSA）

组织者：Yuval Peres

主讲人：Mark Rudelson University of Michigan

Abstract

Consider two copies of the same $G(n,p)$ graph and erase independently the edges of each copy with probability $t < p$. This procedure creates two correlated random graphs. We discuss a randomized algorithm recovering the matching between the vertices of the two graphs for a certain range of parameters.

返回顶部

探花视频相关的文章

Instruction for choosing courses in the direction Algebra and Number
Please download the file for more informatio
View more
YMSC Probability Seminar | Extreme eigenvalues of random regular graphs
AbstractExtremal eigenvalues of graphs are of particular interest in theoretical computer science and combinatorics. Specifically, the spectral gap—the gap between the first and second largest eigenvalues—measures the expanding property of the graph. In this talk, I will focus on random $d$-regular graphs, for which the largest eigenvalue is $d$.I'll first explain some conjectures on the extr...
View more