• Publications
  • Influence
On power-law relationships of the Internet topology
Despite the apparent randomness of the Internet, we discover some surprisingly simple power-laws of the Internet topology. These power-laws hold for three snapshots of the Internet, between NovemberExpand
  • 4,935
  • 321
  • PDF
Efficient Similarity Search In Sequence Databases
We propose an indexing method for time sequences for processing similarity queries. We use the Discrete Fourier Transform (DFT) to map time sequences to the frequency domain, the crucial observationExpand
  • 2,031
  • 243
Cost-effective outbreak detection in networks
Given a water distribution network, where should we place sensors toquickly detect contaminants? Or, which blogs should we read to avoid missing important stories?. These seemingly differentExpand
  • 1,887
  • 201
  • PDF
Graph evolution: Densification and shrinking diameters
How do real graphs evolve over time? What are normal growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying propertiesExpand
  • 1,862
  • 159
  • PDF
Graphs over time: densification laws, shrinking diameters and possible explanations
How do real graphs evolve over time? What are "normal" growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifyingExpand
  • 2,089
  • 152
  • PDF
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.), but several ofExpand
  • 984
  • 127
  • PDF
R-MAT: A Recursive Model for Graph Mining
How does a ‘normal’ computer (or social) network look like? How can we spot ‘abnormal’ sub-networks in the Internet, or web graph? The answer to such questions is vital for outlier detectionExpand
  • 1,052
  • 127
  • PDF
FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets
A very promising idea for fast searching in traditional and multimedia databases is to map objects into points in k-d space, using k feature-extraction functions, provided by a domain expert [25].Expand
  • 1,143
  • 116
  • PDF
Kronecker Graphs: An Approach to Modeling Networks
How can we generate realistic networks? In addition, how can we do so with a mathematically tractable model that allows for rigorous analysis of network properties? Real networks exhibit a long listExpand
  • 805
  • 114
  • PDF
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance score between two nodesExpand
  • 845
  • 104
  • PDF