Sciweavers

154 search results - page 9 / 31
» rsa 2006
Sort
View
RSA
1998
82views more  RSA 1998»
14 years 11 months ago
Convergence of branching processes to the local time of a Bessel process
We study Galton-Watson branching processes conditioned on the total progeny to be n which are scaled by a sequence cn tending to infinity as o( √ n). It is shown that this proce...
Bernhard Gittenberger
RSA
2002
75views more  RSA 2002»
14 years 11 months ago
On the expected value of the minimum assignment
: We prove the main conjecture of the paper "On the expected value of the minimum assignment" by Marshall W. Buck, Clara S. Chan, and David P. Robbins [Random Structures ...
Marshall W. Buck, Clara S. Chan, David P. Robbins
RSA
2002
56views more  RSA 2002»
14 years 11 months ago
Bond percolation critical probability bounds for three Archimedean lattices
Rigorous bounds for the bond percolation critical probability are determined for three Archimedean lattices: .7385 < pc((3, 122 ) bond) < .7449, .6430 < pc((4, 6, 12) bon...
John C. Wierman
RSA
2008
78views more  RSA 2008»
14 years 11 months ago
How many random edges make a dense hypergraph non-2-colorable?
: We study a model of random uniform hypergraphs, where a random instance is obtained by adding random edges to a large hypergraph of a given density. The research on this model fo...
Benny Sudakov, Jan Vondrák
RSA
2008
63views more  RSA 2008»
14 years 11 months ago
The cutoff phenomenon for randomized riffle shuffles
We study the cutoff phenomenon for generalized riffle shuffles where, at each step, the deck of cards is cut into a random number of packs of multinomial sizes which are then riffl...
Guan-Yu Chen, Laurent Saloff-Coste