Sciweavers

1511 search results - page 59 / 303
» Randomness, lowness and degrees
Sort
View
STOC
2000
ACM
112views Algorithms» more  STOC 2000»
15 years 4 months ago
A random graph model for massive graphs
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...
William Aiello, Fan R. K. Chung, Linyuan Lu
APPROX
2008
Springer
119views Algorithms» more  APPROX 2008»
15 years 1 months ago
The Complexity of Distinguishing Markov Random Fields
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan
CPC
2007
125views more  CPC 2007»
14 years 11 months ago
Adversarial Deletion in a Scale-Free Random Graph Process
We study a dynamically evolving random graph which adds vertices and edges using preferential attachment and is “attacked by an adversary”. At time t, we add a new vertex xt a...
Abraham D. Flaxman, Alan M. Frieze, Juan Vera
RSA
2008
84views more  RSA 2008»
14 years 11 months ago
Random partitions with restricted part sizes
: ForasubsetS ofpositiveintegerslet (n, S)bethesetofpartitionsofnintosummands that are elements of S. For every (n, S), let Mn() be the number of parts, with multiplicity, that ...
William M. Y. Goh, Pawel Hitczenko
CISS
2008
IEEE
15 years 6 months ago
Imperfect randomized algorithms for the optimal control of wireless networks
Abstract— We consider a joint randomized scheduling, congestion control mechanism for general wireless networks. We allow for a set of imperfections in the operation of the rando...
Atilla Eryilmaz, Asuman E. Ozdaglar, Devavrat Shah...