External Links

    Journal: Random Struct. Algorithms

    Volume 58, Issue 4

    609 -- 647Dimitris Achlioptas, Amin Coja-Oghlan, Max Hahn-Klimroth, Joon Lee, Noëla Müller, Manuel Penschuck, Guangyan Zhou. The number of satisfying assignments of random 2-SAT formulas
    648 -- 663Gilles Bonnet, Zakhar Kabluchko, Nicola Turchi. Phase transition for the volume of high-dimensional random polytopes
    664 -- 675Michael Farber, Tahl Nowik. Topological embeddings into random 2-complexes
    676 -- 690Ross G. Pinsky. Permutations avoiding a pattern of length three under Mallows distributions
    691 -- 725Boris G. Pittel. On Bollobás-Riordan random pairing model of preferential attachment graph
    726 -- 739Dirk Zeindler. Long cycle of random permutations with polynomially growing cycle weights

    Volume 58, Issue 3

    383 -- 389Jacob Fox, Cosmin Pohoata. Sets without k-term progressions can have many shorter progressions
    390 -- 429Michael Anastos, Alan M. Frieze. Finding maximum matchings in random regular graphs in linear expected time
    430 -- 467Michael Drmota, Michael Fuchs 0001, Hsien-Kuei Hwang, Ralph Neininger. Node profiles of symmetric digital search trees: Concentration properties
    468 -- 479Lior Gishboliner, Asaf Shapira, Henrique Stagni. Testing linear inequalities of subgraph statistics
    480 -- 516Jie Han 0002, Patrick Morris 0001, Andrew Treglown. Tilings in randomly perturbed graphs: Bridging the gap between Hajnal-Szemerédi and Johansson-Kahn-Vu
    517 -- 605Konstantin E. Tikhomirov, Pierre Youssef. Outliers in spectrum of sparse Wigner matrices

    Volume 58, Issue 2

    179 -- 220Yang P. Liu, Yufei Zhao. On the upper tail problem for random hypergraphs
    221 -- 293Tom Bohman, Peter Keevash. Dynamic concentration of the triangle-free process
    294 -- 321Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins, James Stewart, Eric Vigoda. Fast algorithms at low temperatures via Markov chains
    322 -- 344Joonkyung Lee. On some graph densities in locally dense graphs
    345 -- 369Nati Linial, Michael Simkin. A randomized construction of high girth regular graphs
    370 -- 380Tomas Juskevicius, Valentas Kurauskas. On the Littlewood-Offord problem for arbitrary distributions

    Volume 58, Issue 1

    3 -- 33Andrew D. Barbour, Peter Braunsteins, Nathan Ross. Local limit theorems for occupancy models
    34 -- 67Louigi Addario-Berry, Shankar Bhamidi, Sanchayan Sen. A probabilistic approach to the leader problem in random graphs
    68 -- 93Antares Chen, David G. Harris, Aravind Srinivasan. Partial resampling to approximate covering integer programs
    94 -- 149Jean-François Delmas, Jean-Stéphane Dhersin, Marion Sciauveau. Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon
    150 -- 163John Haslegrave, Christoforos Panagiotis. Site percolation and isoperimetric inequalities for plane graphs
    164 -- 175Peter Pfaffelhuber, Jakob Stiefel. The range of once-reinforced random walk in one dimension
    runs on