home
:
about uctvs
:
contact
:
uctv
:
u of ca
:
browse by:
campuses
|
conferences
|
hosts
|
seminars
|
speakers
|
subjects
Community Detection in Multislice Networks
(
3/30/2011
)
69
minutes
Host:
The Kavli Institute for Theoretical Physics
+ share
description:
A prominent problem in network science is the algorithmic detection of tightly connected groups of nodes known as communities. While community detection has been used successfully in a number of applications, its use has been largely limited to the study of single, static networks. Through the study of dynamical processes on networks, we developed a generalized framework of quality functions for partitions that allows for the study of community structure in multislice networks, which are combinations of networks coupled by identification of each node in one network slice to itself in other slices.
files/resources:
Watch the Flash Video.
Watch the Quicktime Video.
Review PowerPoint Slides.
more on this subject:
Developing a Strategy for Education in Data Science at UCSD
Collaboration, Resources and Services for Big Data Projects
Local Algorithms
see all from Applied Mathematics >