Random Structures & Algorithms

Copyright © 2013 Wiley Periodicals, Inc., A Wiley Company

Cover image for Vol. 38 Issue 4

July 2011

Volume 38, Issue 4

Pages 381–525

    1. Distances between pairs of vertices and vertical profile in conditioned Galton–Watson trees (pages 381–395)

      Luc Devroye and Svante Janson

      Article first published online: 10 MAR 2010 | DOI: 10.1002/rsa.20319

    2. Scale-free graphs of increasing degree (pages 396–421)

      Colin Cooper and Paweł Prałat

      Article first published online: 10 MAR 2010 | DOI: 10.1002/rsa.20318

    3. On random sampling in uniform hypergraphs (pages 422–440)

      Andrzej Czygrinow and Brendan Nagle

      Article first published online: 12 APR 2010 | DOI: 10.1002/rsa.20326

    4. Simulating events of unknown probabilities via reverse time martingales (pages 441–452)

      Krzysztof Łatuszyński, Ioannis Kosmidis, Omiros Papaspiliopoulos and Gareth O. Roberts

      Article first published online: 25 MAY 2010 | DOI: 10.1002/rsa.20333

    5. Stochastic kronecker graphs (pages 453–466)

      Mohammad Mahdian and Ying Xu

      Article first published online: 6 JUL 2010 | DOI: 10.1002/rsa.20335

    6. The CRT is the scaling limit of unordered binary trees (pages 467–501)

      Jean-François Marckert and Grégory Miermont

      Article first published online: 25 MAY 2010 | DOI: 10.1002/rsa.20332

    7. The maximal probability that k-wise independent bits are all 1 (pages 502–525)

      Ron Peled, Ariel Yadin and Amir Yehudayoff

      Article first published online: 25 MAY 2010 | DOI: 10.1002/rsa.20329

SEARCH

SEARCH BY CITATION