Zda se, ze autori vyresili pomerne zasadni problem: jak detekovat komunity v sitich s mnohavrstevnou strukturou - treba v siti, ktera se sklada ze snimku porizenych v ruznych casech. Jejich aplikace na data o hlasovani s US kongresu jsou hodne zajimava i pro ne-informatiky;)
Matematicke zduvodneni moc nerozumim, snad se to zlepsi po prostudovani priloh. Kdyby tu byl nejaky fyzik nebo zdatny matematik, uvitam pomoc;)
Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
Authors: Peter J. Mucha, Thomas Richardson, Kevin Macon, Mason A. Porter, Jukka-Pekka Onnela
(Submitted on 10 Nov 2009 (v1), last revised 12 Jul 2010 (this version, v3))
Abstract: Network science is an interdisciplinary endeavor, with methods and applications drawn from across the natural, social, and information sciences. A prominent problem in network science is the algorithmic detection of tightly-connected groups of nodes known as communities. We developed a generalized framework of network quality functions that allowed us to study the community structure of arbitrary multislice networks, which are combinations of individual networks coupled through links that connect each node in one network slice to itself in other slices. This framework allows one to study community structure in a very general setting encompassing networks that evolve over time, have multiple types of links (multiplexity), and have multiple scales.
http://arxiv.org/abs/0911.1824