School of Technology and Computer Science Seminars

Component sizes for large quantum Erd\"os--R\'enyi graph near criticality

by Prof. Sreekar Vadlamani (TIFR, CAM, Bangalore)

Friday, November 22, 2019 from to (Asia/Kolkata)
at A-201 STCS Seminar room
Abstract: In this talk, I shall begin with explaining a model of random graph which is an instance of non-rank-1, inhomogeneous random graph. After discussing the criticality aspects of proposed random graph, I shall focus on the asymptotic properties of size of the top few largest connected components. This talk is based on joint work with A. Dembo and A. Levit.
Organised by Sandeep K Juneja