Event Detail

Event Type: 
Applied Mathematics and Computation Seminar
Friday, April 7, 2017 -
12:00 to 13:00
STAG 260

Speaker Info

OSU Statistics Department

One of the most common and crucial aspects of many network data sets is the dependence of network link structure on time. In this work, we consider the problem of finding a common clustering structure in time-varying networks. We also propose an extension of the static version of nonparametric latent variable models into the dynamic setting and use special cases of the dynamic models to justify the spectral clustering methods. We consider two extensions of spectral clustering methods to dynamic settings and give theoretical guarantee that the spectral clustering methods produce consistent community detection in case of both dynamic stochastic block model and dynamic degree-corrected block model. The methods are shown to work under sufficiently mild conditions on the number of time snapshots of networks and also if the networks at each time snapshot are sparse and networks at most time snapshots are below community detectability threshold. We show the validity of the theoretical results via simulations too. (Joint work with Shirshendu Chatterjee, CUNY)