Abstract
dc:description.abstractGraphs are used to represent various large and complex networks in scientific applications. In order to understand the structure of these graphs, it is useful to treat a set of nodes with similar characteristics as one community and analyze the community's behavior as a whole. Finding all such communities within the graph is the object of community detection. In our research, we compare dozens of existing community detection methods and develop a new class of algorithms for finding communities.
Degree
thesis:*- Name thesis:degree_name
- Ph. D., Applied Mathematics
- Level thesis:degree_level
- Doctor of Philosophy
- Discipline thesis:degree_discipline
- Applied Mathematics
- Grantor
- Cornell University
- Year dc:date.issued
- 2012
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Andrews, June
- Chair dc:contributor.chair
-
- Hopcroft, John E
- Committee members dc:contributor.committeemember
-
- Kleinberg, Jon M
- Strogatz, Steven H
Subjects
dc:subject × 2Rights
- Language dc:language.iso
- en_US
Identifiers
dc:identifier.*- Dc Identifier Bibid
- 7959769