Sciweavers

27 search results - page 2 / 6
» Giant Component and Connectivity in Geographical Threshold G...
Sort
View
JMLR
2012
11 years 10 months ago
Exact Covariance Thresholding into Connected Components for Large-Scale Graphical Lasso
We consider the sparse inverse covariance regularization problem or graphical lasso with regularization parameter λ. Suppose the sample covariance graph formed by thresholding th...
Rahul Mazumder, Trevor Hastie
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
14 years 7 months ago
Weighted graphs and disconnected components: patterns and a generator
The vast majority of earlier work has focused on graphs which are both connected (typically by ignoring all but the giant connected component), and unweighted. Here we study numer...
Mary McGlohon, Leman Akoglu, Christos Faloutsos
WAW
2007
Springer
157views Algorithms» more  WAW 2007»
14 years 1 months ago
Stochastic Kronecker Graphs
A random graph model based on Kronecker products of probability matrices has been recently proposed as a generative model for large-scale real-world networks such as the web. This...
Mohammad Mahdian, Ying Xu 0002
WAW
2010
Springer
235views Algorithms» more  WAW 2010»
13 years 5 months ago
Multiplicative Attribute Graph Model of Real-World Networks
Large scale real-world network data such as social and information networks are ubiquitous. The study of such social and information networks seeks to find patterns and explain th...
Myunghwan Kim, Jure Leskovec
MONET
2006
157views more  MONET 2006»
13 years 7 months ago
Connectivity in Wireless Ad-hoc Networks with a Log-normal Radio Model
In this paper we study connectivity in wireless ad-hoc networks by modeling the network as an undirected geometric random graph. The novel aspect in our study is that for finding t...
Ramin Hekmat, Piet Van Mieghem