Sciweavers

225 search results - page 5 / 45
» Stably Computable Properties of Network Graphs
Sort
View
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
11 years 9 months ago
Ego-centric Graph Pattern Census
—There is increasing interest in analyzing networks of all types including social, biological, sensor, computer, and transportation networks. Broadly speaking, we may be interest...
Walaa Eldin Moustafa, Amol Deshpande, Lise Getoor
SPAA
2005
ACM
14 years 29 days ago
The expansion and mixing time of skip graphs with applications
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
James Aspnes, Udi Wieder
SDM
2009
SIAM
104views Data Mining» more  SDM 2009»
14 years 4 months ago
On Randomness Measures for Social Networks.
Social networks tend to contain some amount of randomness and some amount of non-randomness. The amount of randomness versus non-randomness affects the properties of a social netw...
Xiaowei Ying, Xintao Wu
ML
2010
ACM
185views Machine Learning» more  ML 2010»
13 years 2 months ago
Learning to rank on graphs
Graph representations of data are increasingly common. Such representations arise in a variety of applications, including computational biology, social network analysis, web applic...
Shivani Agarwal
SDM
2009
SIAM
113views Data Mining» more  SDM 2009»
14 years 4 months ago
Graph Generation with Prescribed Feature Constraints.
In this paper, we study the problem of how to generate synthetic graphs matching various properties of a real social network with two applications, privacy preserving social netwo...
Xiaowei Ying, Xintao Wu