- 2016
- Erik Aas, Jonas Sjöstrand:
A product formula for the TASEP on a ring. Random Struct. Algorithms 48(2): 247-259 (2016) - Radoslaw Adamczak, Djalil Chafaï, Pawel Wolff:
Circular law for random matrices with exchangeable entries. Random Struct. Algorithms 48(3): 454-479 (2016) - Lior Aronshtam, Nathan Linial:
The threshold for d-collapsibility in random complexes. Random Struct. Algorithms 48(2): 260-269 (2016) - Richard Arratia, Skip Garibaldi, Joe Kilian:
Asymptotic distribution for the birthday problem with multiple coincidences, via an embedding of the collision process. Random Struct. Algorithms 48(3): 480-502 (2016) - Deepak Bal, Alan M. Frieze:
Rainbow matchings and Hamilton cycles in random graphs. Random Struct. Algorithms 48(3): 503-523 (2016) - József Balogh, Jane Butterfield, Ping Hu, John Lenz:
Mantel's theorem for random hypergraphs. Random Struct. Algorithms 48(4): 641-654 (2016) - Erich Baur:
Percolation on random recursive trees. Random Struct. Algorithms 48(4): 655-680 (2016) - Magnus Bordewich, Catherine S. Greenhill, Viresh Patel:
Mixing of the Glauber dynamics for the ferromagnetic Potts model. Random Struct. Algorithms 48(1): 21-52 (2016) - Julia Böttcher, Anusch Taraz, Andreas Würfl:
Spanning embeddings of arrangeable graphs with sublinear bandwidth. Random Struct. Algorithms 48(2): 270-289 (2016) - Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, He Sun:
Balls into bins via local search: Cover time and maximum load. Random Struct. Algorithms 48(4): 681-702 (2016) - JiHyeok Choi, Sunder Sethuraman, Shankar C. Venkataramani:
A scaling limit for the degree distribution in sublinear preferential attachment schemes. Random Struct. Algorithms 48(4): 703-731 (2016) - Andrea Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Francesco Pasquale, Riccardo Silvestri:
Rumor spreading in random evolving graphs. Random Struct. Algorithms 48(2): 290-312 (2016) - Domingos Dellamonica Jr., Steve La Fleur, Vojtech Rödl:
On induced Ramsey numbers for k-uniform hypergraphs. Random Struct. Algorithms 48(1): 5-20 (2016) - Ioana Dumitriu, Tobias Johnson:
The Marčenko-Pastur law for sparse random bipartite biregular graphs. Random Struct. Algorithms 48(2): 313-340 (2016) - Uriel Feige, Jonathan Hermon, Daniel Reichman:
On giant components and treewidth in the layers model. Random Struct. Algorithms 48(3): 524-545 (2016) - Asaf Ferber, Rajko Nenadov, Ueli Peter:
Universality of random graphs and rainbow embedding. Random Struct. Algorithms 48(3): 546-564 (2016) - Justin Gilmer, Swastik Kopparty:
A local central limit theorem for triangles in a random graph. Random Struct. Algorithms 48(4): 732-750 (2016) - Oded Goldreich, Igor Shinkar:
Two-sided error proximity oblivious testing. Random Struct. Algorithms 48(2): 341-383 (2016) - Bernhard Haeupler, Gopal Pandurangan, David Peleg, Rajmohan Rajaraman, Zhifeng Sun:
Discovery Through Gossip. Random Struct. Algorithms 48(3): 565-587 (2016) - David G. Harris, Aravind Srinivasan:
A note on near-optimal coloring of shift hypergraphs. Random Struct. Algorithms 48(1): 53-56 (2016) - John Haslegrave, Jonathan H. Jordan:
Preferential attachment with choice. Random Struct. Algorithms 48(4): 751-766 (2016) - Johan Håstad:
The square lattice shuffle, correction. Random Struct. Algorithms 48(1): 213 (2016) - Paul Horn, Václav Koubek, Vojtech Rödl:
Isomorphic edge disjoint subgraphs of hypergraphs. Random Struct. Algorithms 48(4): 767-793 (2016) - Svante Janson:
Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees. Random Struct. Algorithms 48(1): 57-101 (2016) - Svante Janson, Lutz Warnke:
The lower tail: Poisson approximation revisited. Random Struct. Algorithms 48(2): 219-246 (2016) - Matthew Kahle, Boris G. Pittel:
Inside the critical window for cohomology of random k-complexes. Random Struct. Algorithms 48(1): 102-124 (2016) - Jeff Kahn, Eyal Lubetzky, Nicholas C. Wormald:
The threshold for combs in random graphs. Random Struct. Algorithms 48(4): 794-802 (2016) - Jakub Kozik:
Multipass greedy coloring of simple uniform hypergraphs. Random Struct. Algorithms 48(1): 125-146 (2016) - Daniela Kühn, Deryk Osthus, Viresh Patel:
A domination algorithm for {0, 1}-instances of the travelling salesman problem. Random Struct. Algorithms 48(3): 427-453 (2016) - Mikhail Lavrov, Po-Shen Loh:
Increasing Hamiltonian paths in random edge orderings. Random Struct. Algorithms 48(3): 588-611 (2016)