Random Structures and Algorithms, Volume 18

Volume 18, Number 1, January 2001

V. S. Anil Kumar, H. Ramesh: Coupling vs. conductance for the Jerrum-Sinclair chain. 1-17
Andrei Z. Broder, Michael Mitzenmacher: Completeness and robustness properties of min-wise independent permutations. 18-30
Malwina J. Luczak, Colin McDiarmid: Bisecting sparse random graphs. 31-38
Dudley Stark: Compound Poisson approximations of subgraph counts in random graphs. 39-60
Deryk Osthus, Anusch Taraz: Random maximal H-free graphs. 61-82
Alan M. Frieze: Hamilton cycles in the union of random permutations. 83-94
Colin Cooper: The union of two random permutations does not have a directed Hamilton cycle. 95-98
Svante Janson, Yannis C. Stamatiou, Malvina Vamvakari: Erratum to Bounding the Unsatisfiability Threshold of Random 3-SAT. 99-100

Michael Molloy: Very rapidly mixing Markov chains for 2-colorings and for independent sets in a graph with maximum degree 4. 101-115
Anne Condon, Richard M. Karp: Algorithms for graph partitioning on the planted partition model. 116-140
Malgorzata Bednarska, Tomasz Luczak: Biased positional games and the phase transition. 141-152
Robert T. Smythe: The Boyer-Moore-Horspool heuristic with Markovian input. 153-163
Boris Pittel, R. Tungol: A phase transition phenomenon in a random directed acyclic graph. 164-184
Christian Mazza, Didier Piau: On the effect of selection in genetic algorithms. 185-200

Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Jeong Han Kim, David Bruce Wilson: The scaling window of the 2-SAT transition. 201-256
Geoffrey R. Grimmett: Infinite paths in randomly oriented lattices. 257-266
Olle Häggström: A note on disagreement percolation. 267-278
Béla Bollobás, Oliver Riordan, Joel Spencer, Gábor E. Tusnády: The degree sequence of a scale-free random graph process. 279-290
Ilan Adler, Noga Alon, Sheldon M. Ross: On the maximum number of Hamiltonian paths in tournaments. 291-296

Artur Czumaj, Volker Stemann: Randomized allocation processes. 297-331
Damien G. White: On the value of the critical point in fractal percolation. 332-345
Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald: Random regular graphs of high degree. 346-363
Jean-François Marckert: Parking with density. 364-380
David Aldous: The zeta(2) limit in the random assignment problem. 381-418