Wed, 20 Aug 2008 22:05:43 BST CiteULike: bigbossman calling http://www.citeulike.org/user/bigbossman/tag/calling CiteULike.org en-gb Copyright © 2004-2008 citeulike.org http://www.citeulike.org/user/bigbossman/article/963861 <i>Journal of Computational & Graphical Statistics, Vol. 12, No. 4. (1 December 2003), pp. 950-970.</i><br /><br />8This article considers problems that can be characterized by large dynamic graphs. Communication networks provide the prototypical example of such problems where nodes in the graph are network IDs and the edges represent communication between pairs of network IDs. In such graphs, nodes and edges appear and disappear through time so that methods that apply to static graphs are not sufficient. Our definition of a dynamic graph is procedural. We introduce a data structure and an updating scheme that captures, in an approximate sense, the graph and its evolution through time. The data structure arises from a bottom-up representation of the large graph as the union of small subgraphs centered on every node. These subgraphs are interesting in their own right and can be enhanced to form what we call communities of interest (COI). We discuss an application in the area of telecommunications fraud detection to help motivate the ideas. Computational Methods for Dynamic Graphs Corinna Cortes Daryl Pregibon Chris Volinsky Journal of Computational & Graphical Statistics, Vol. 12, No. 4. (1 December 2003), pp. 950-970. 2006-11-27T19:40:35-00:00 2003 Journal of Computational & Graphical Statistics 12 4 950 970 calling dynamic graphs temporal