Sciweavers

CPC
2011
240views Education» more  CPC 2011»
13 years 2 months ago
Many Random Walks Are Faster Than One
Noga Alon, Chen Avin, Michal Koucký, Gady K...
CPC
2011
218views Education» more  CPC 2011»
13 years 5 months ago
The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle
András Gyárfás, Gábor ...
CPC
2011
215views Education» more  CPC 2011»
13 years 5 months ago
An Improved Bound for k-Sets in Four Dimensions
We show that the number of halving sets of a set of n points in R4 is O n4−1/18 , improving the previous bound of [9] with a simpler (albeit similar) proof.
Micha Sharir
CPC
2011
219views Education» more  CPC 2011»
13 years 5 months ago
On Percolation and the Bunkbed Conjecture
We study a problem on edge percolation on product graphs G× K2. Here G is any finite graph and K2 consists of two vertices {0, 1} connected by an edge. Every edge in G × K2 is p...
Svante Linusson
CPC
2011
189views Education» more  CPC 2011»
13 years 5 months ago
A Counter-Intuitive Correlation in a Random Tournament
Consider a randomly oriented graph G = (V, E) and let a, s and b be three distinct vertices in V . We study the correlation between the events {a → s} and {s → b}. We show that...
Sven Erick Alm, Svante Linusson
CPC
2011
199views Education» more  CPC 2011»
13 years 5 months ago
Sub-Gaussian Tails for the Number of Triangles in G( n, p)
Let X be the random variable that counts the number of triangles in the binomial random graph G(n, p). We show that for some positive constant c, the probability that X deviates f...
Guy Wolfovitz