Journal: Random Struct. Algorithms

Volume 53, Issue 4

559 -- 560. Issue information
561 -- 585Colin Cooper, Andrew McDowell, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga. Dispersion processes
586 -- 591Alan M. Frieze, Wesley Pegden. A note on dispersing particles on a line
592 -- 603Asaf Ferber, Matthew Kwan, Benny Sudakov. Counting Hamilton cycles in sparse random directed graphs
604 -- 637Asaf Ferber, Rajko Nenadov. Spanning universality in random graphs
638 -- 651Frederik Garbe, Richard Mycroft, Andrew McDowell. Contagious sets in a degree-proportional bootstrap percolation process
652 -- 666Pawel Hitczenko, Amanda Lohss. Probabilistic consequences of some polynomial recurrences
667 -- 691Dániel Korándi, Frank Mousset, Rajko Nenadov, Nemanja Skoric, Benny Sudakov. Monochromatic cycle covers in random graphs
692 -- 716Michael Krivelevich, Matthew Kwan, Po-Shen Loh, Benny Sudakov. The random k-matching-free process
717 -- 727Tobias Müller 0001, Marc Noy. The first order convergence law fails for random perfect graphs
728 -- 751Nemanja Skoric, Angelika Steger, Milos Trujic. Local resilience of an almost spanning k-cycle in random graphs

Volume 53, Issue 3

387 -- 388. Issue information
389 -- 416Agnes Backhausz, Balázs Szegedy. On large-girth regular graphs and random processes on trees
417 -- 447Harry Crane, Stephen Desalvo, Sergi Elizalde. The probability of avoiding consecutive patterns in the Mallows distribution
448 -- 503Cyril Marzouk. Scaling limits of random bipartite planar maps with a prescribed degree sequence
504 -- 536Subhabrata Sen. Optimization on sparse random hypergraphs and spin glasses
537 -- 558Benedikt Stufler. Gibbs partitions: The convergent case

Volume 53, Issue 2

183 -- 184. Issue information
185 -- 220Béla Bollobás, Oliver Riordan. Counting dense connected hypergraphs via the probabilistic method
221 -- 237Jacob van den Berg, Stein Andreas Bethuelsen. Stochastic domination in space-time for the contact process
238 -- 288Oliver Cooley, Mihyun Kang, Christoph Koch 0006. The size of the giant high-order component in random hypergraphs
289 -- 307Ronen Eldan, Mohit Singh. Efficient algorithms for discrepancy minimization in convex sets
308 -- 326Nicolas Fraiman, Dieter Mitsche. The diameter of inhomogeneous random graphs
327 -- 351Alan M. Frieze, Wesley Pegden. Online purchasing under uncertainty
352 -- 385Richard Mycroft, Tássio Naia. Unavoidable trees in tournaments

Volume 53, Issue 1

1 -- 2. Issue information
3 -- 14Boris Pittel. Counting strongly connected (k1, k2)-directed cores
15 -- 58Nicolas Broutin, Cécile Mailler. And/or trees: A local limit point of view
59 -- 75Ewan Davies, Matthew Jenssen, Will Perkins, Barnaby Roberts. Extremes of the internal energy of the Potts model on cubic graphs
76 -- 139Pu Gao, Michael Molloy. The stripping process can be slow: Part I
140 -- 182Annika Heckel. The chromatic number of dense random graphs