Detecting or estimating a dense community from a network graph offers a rich set of problems involving the interplay of algorithms, complexity, and information limits. The speaker in his talk will present an overview and recent results on the topic.
Professor Bruce Hajek is Center for Advanced Study Professor of Electrical and Computer Engineering, Professor in the Coordinated Science Laboratory, and Hoeft Chair in Engineering at the University of Illinois at Urbana-Champaign, where he has been on the faculty since 1979. He received a BS in Mathematics and MS in Electrical Engineering from the University of Illinois at Urbana-Champaign and the PhD in Electrical Engineering from the University of California at Berkeley. Prof. Hajek's research interests include communication networks, wireless communications, gene regulatory networks, auctions and mechanism design, stochastic analysis, optimization, control, and machine learning. He served as Editor-in-Chief for the IEEE Transactions on Information Theory, and as President of the IEEE Information Theory Society. He is co-author of the book Stochastic Processes in Engineering Systems with E. Wong and author of the book Random Processes for Engineers. Prof. Hajek has received the IEEE Information Theory Society Aaron D. Wyner Distinguished Service Award, the IEEE Kobayashi Award for Computer Communication, the ACM SIGMETRICS Achievement Award, and he is a member of the US National Academy of Engineering.