Sciweavers

4 search results - page 1 / 1
» The Deletion Method For Upper Tail Estimates
Sort
View
COMBINATORICA
2004
79views more  COMBINATORICA 2004»
13 years 5 months ago
The Deletion Method For Upper Tail Estimates
We present a new method to show concentration of the upper tail of random variables that can be written as sums of variables with plenty of independence. We compare our method with...
Svante Janson, Andrzej Rucinski
RSA
2002
71views more  RSA 2002»
13 years 4 months ago
The infamous upper tail
Let be a finite index set and k 1 a given integer. Let further S []k be an arbitrary family of k element subsets of . Consider a (binomial) random subset p of , where p = (pi :...
Svante Janson, Andrzej Rucinski
STACS
2007
Springer
13 years 11 months ago
Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
Robert Elsässer, Thomas Sauerwald
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
13 years 8 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant