Computer Science – Data Structures and Algorithms
Scientific paper
2009-04-23
Computer Science
Data Structures and Algorithms
To appear at Algorithms and Data Structures Symposium, Banff, Canada, August 2009. 18 pages, 4 figures. Includes six pages of
Scientific paper
We describe a data structure that maintains the number of triangles in a dynamic undirected graph, subject to insertions and deletions of edges and of degree-zero vertices. More generally it can be used to maintain the number of copies of each possible three-vertex subgraph in time O(h) per update, where h is the h-index of the graph, the maximum number such that the graph contains $h$ vertices of degree at least h. We also show how to maintain the h-index itself, and a collection of h high-degree vertices in the graph, in constant time per update. Our data structure has applications in social network analysis using the exponential random graph model (ERGM); its bound of O(h) time per edge is never worse than the Theta(sqrt m) time per edge necessary to list all triangles in a static graph, and is strictly better for graphs obeying a power law degree distribution. In order to better understand the behavior of the h-index statistic and its implications for the performance of our algorithms, we also study the behavior of the h-index on a set of 136 real-world networks.
Eppstein David
Spiro Emma S.
No associations
LandOfFree
The h-Index of a Graph and its Application to Dynamic Subgraph Statistics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The h-Index of a Graph and its Application to Dynamic Subgraph Statistics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The h-Index of a Graph and its Application to Dynamic Subgraph Statistics will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-409618