51 search results - page 3 / 11 » On the density of a graph and its blowup |
SIGMETRICS
2006
ACM
14 years 9 days ago
2006
ACM
This work analyzes the connectivity of large diameter networks where every link has an independent probability p of failure. We give a (relatively simple) topological condition th...
APPROX
2007
Springer
14 years 17 days ago
2007
Springer
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
COMBINATORICA
2011
12 years 6 months ago
2011
Given independent random points X1, . . . , Xn ∈ Rd with common probability distribution ν, and a positive distance r = r(n) > 0, we construct a random geometric graph Gn wi...
SIGECOM
2006
ACM
14 years 9 days ago
2006
ACM
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
UAI
2008
13 years 7 months ago
2008
A Bayesian treatment of latent directed graph structure for non-iid data is provided where each child datum is sampled with a directed conditional dependence on a single unknown p...