125 search results - page 18 / 25 » Growth of components in random graphs |
SPAA
2004
ACM
15 years 5 months ago
2004
ACM
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...
104
click to vote
KDD
2009
ACM
16 years 8 days ago
2009
ACM
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
113
click to vote
WAW
2007
Springer
15 years 5 months ago
2007
Springer
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...
JMLR
2008
14 years 11 months ago
2008
Causal reasoning is primarily concerned with what would happen to a system under external interventions. In particular, we are often interested in predicting the probability distr...
STOC
2005
ACM
16 years 1 days ago
2005
ACM
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...