Sciweavers

617 search results - page 50 / 124
» On the Chromatic Number of Random Graphs
Sort
View
BIOINFORMATICS
2007
83views more  BIOINFORMATICS 2007»
14 years 12 months ago
Exploring biological network structure using exponential random graph models
Motivation: The functioning of biological networks depends in large part on their complex underlying structure. When studying their systemic nature many modeling approaches focus ...
Zachary M. Saul, Vladimir Filkov
STOC
2004
ACM
110views Algorithms» more  STOC 2004»
16 years 3 days ago
On sums of independent random variables with unbounded variance, and estimating the average degree in a graph
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
Uriel Feige
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
15 years 5 months ago
Braess's paradox in large random graphs
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
Gregory Valiant, Tim Roughgarden
WWW
2008
ACM
16 years 15 days ago
Video suggestion and discovery for youtube: taking random walks through the view graph
The rapid growth of the number of videos in YouTube provides enormous potential for users to find content of interest to them. Unfortunately, given the difficulty of searching vid...
Shumeet Baluja, Rohan Seth, D. Sivakumar, Yushi Ji...
CP
2004
Springer
15 years 5 months ago
How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
Haixia Jia, Cristopher Moore