External Links

    Journal: Random Struct. Algorithms

    Volume 59, Issue 4

    495 -- 521Alexander E. Holroyd, James B. Martin. Galton-Watson games
    522 -- 553Luisa Andreis, Wolfgang König, Robert I. A. Patterson. A large-deviations principle for all the cluster sizes of a sparse Erdős-Rényi graph
    554 -- 615Jacob Fox, Lisa Sauermann, Fan Wei. On the inducibility problem for random Cayley graphs of abelian groups with a few deleted vertices
    616 -- 621Annika Heckel. Random triangles in random graphs
    622 -- 639Ross G. Pinsky. The infinite limit of separable permutations
    640 -- 670Sofya Raskhodnikova, Noga Ron-Zewi, Nithin Varma. Erasures versus errors in local decoding and property testing

    Volume 59, Issue 3

    291 -- 314Andrii Arman, Pu Gao, Nicholas C. Wormald. Fast uniform generation of random graphs with given degree sequences
    315 -- 338Sohom Bhattacharya, Amir Dembo. Upper tail for homomorphism counts in constrained sparse random graphs
    339 -- 375Jacopo Borga. Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one-dimensional labels
    376 -- 406Pietro Caputo, Matteo Quattropani. Mixing time of PageRank surfers on sparse random digraphs
    407 -- 463Soumik Pal, Yizhe Zhu. Community detection in the sparse hypergraph stochastic block model
    464 -- 491Benedikt Stufler. Graphon convergence of random cographs

    Volume 59, Issue 2

    143 -- 154Michael Damron, Hanbaek Lyu, David Sivakoff. Stretched exponential decay for subcritical parking times on
    155 -- 188François Bienvenu, Jean-Jil Duchamps, Félix Foutel-Rodier. The Moran forest
    189 -- 203Emilio De Santis. Ranking graphs through hitting times of Markov chains
    204 -- 237Martin E. Dyer, Catherine S. Greenhill, Haiko Müller. Counting independent sets in graphs with bounded bipartite pathwidth
    238 -- 266Joel Larsson, Klas Markström. Biased random k-SAT
    267 -- 287Michal Lason. Optimal stopping for many connected components in a graph
    288 -- 0. Corrigendum to "Online purchasing under uncertainty"

    Volume 59, Issue 1

    3 -- 24Colin McDiarmid, Alex Scott 0001, Paul Withers. The component structure of dense random subgraphs of the hypercube
    25 -- 52Erik Bates, Moumanti Podder. Avoidance couplings on non-complete graphs
    53 -- 67Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan 0001. On the probabilistic degree of OR over the reals
    68 -- 78Nemanja Draganic, Michael Krivelevich, Rajko Nenadov. The size-Ramsey number of short subdivisions
    79 -- 95Jiaxi Nie, Jacques Verstraëte. Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth
    96 -- 140Nobutaka Shimizu, Takeharu Shiraga. Phase transitions of Best-of-two and Best-of-three on stochastic block models
    runs on