Thursday, September 30, 20102:00 PM - 3:00 PMCNLS Conference Room (TA-3, Bldg 1690)|
Limits of detectability of structural modules in complex networks
Community or functional modules detection in complex networks is relevant for several areas of science. In recent years many algorithms and approaches were suggested, tested, compared. Nodes in networks often have different functionality that influences creation of the network (e.g. I am twice likely to be Facebook friend with somebody in my workplace than with a random person in the town). But are the modules always detectable from the structure of the network? I will talk about asymptotically tight conditions under which detection of modules is possible or impossible, and algorithmically hard or easy.
Host: Peter Loxley, firstname.lastname@example.org