Sciweavers

Share
3 search results - page 1 / 1
» Topology Discovery of Sparse Random Graphs With Few Particip...
Sort
View
CORR
2011
Springer
152views Education» more  CORR 2011»
8 years 1 months ago
Topology Discovery of Sparse Random Graphs With Few Participants
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
Animashree Anandkumar, Avinatan Hassidim, Jonathan...
PAKDD
2011
ACM
209views Data Mining» more  PAKDD 2011»
7 years 9 months ago
Spectral Analysis for Billion-Scale Graphs: Discoveries and Implementation
Abstract. Given a graph with billions of nodes and edges, how can we find patterns and anomalies? Are there nodes that participate in too many or too few triangles? Are there clos...
U. Kang, Brendan Meeder, Christos Faloutsos
BIOINFORMATICS
2008
172views more  BIOINFORMATICS 2008»
8 years 6 months ago
Fitting a geometric graph to a protein-protein interaction network
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
Desmond J. Higham, Marija Rasajski, Natasa Przulj
books