Sciweavers

170 search results - page 8 / 34
» k-Wise Independent Random Graphs
Sort
View
CDC
2010
IEEE
186views Control Systems» more  CDC 2010»
13 years 2 months ago
Approximation and limiting behavior of random models
In this paper, we investigate limiting behavior of linear dynamic systems driven by random stochastic matrices. We introduce and study the new concepts of partial ergodicity and 1-...
Behrouz Touri, Angelia Nedic
ESA
2001
Springer
132views Algorithms» more  ESA 2001»
14 years 7 days ago
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
Michele Zito
EJC
2008
13 years 7 months ago
Expansion properties of a random regular graph after random vertex deletions
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p = n-...
Catherine S. Greenhill, Fred B. Holt, Nicholas C. ...
STOC
2005
ACM
147views Algorithms» more  STOC 2005»
14 years 8 months ago
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
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...
Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sud...
COMBINATORICS
2004
94views more  COMBINATORICS 2004»
13 years 7 months ago
Short Cycles in Random Regular Graphs
Consider random regular graphs of order n and degree d = d(n) 3. Let g = g(n) 3 satisfy (d-1)2g-1 = o(n). Then the number of cycles of lengths up to g have a distribution simila...
Brendan D. McKay, Nicholas C. Wormald, Beata Wysoc...