11. A generalized Pólya's urn with graph based interactions. Issue 4 (21st November 2013) Authors: Benaïm, Michel; Benjamini, Itai; Chen, Jun; Lima, Yuri Journal: Random structures & algorithms Issue: Volume 46:Issue 4(2015) Page Start: 614 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
12. A generalized Turán problem in random graphs. Issue 2 (10th June 2019) Authors: Samotij, Wojciech; Shikhelman, Clara Journal: Random structures & algorithms Issue: Volume 56:Issue 2(2020) Page Start: 283 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
13. A greedy chip‐firing game. Issue 3 (8th November 2022) Authors: Li, Rupert; Propp, James Journal: Random structures & algorithms Issue: Volume 62:Issue 3(2023) Page Start: 645 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
14. A Harris‐Kesten theorem for confetti percolation1. Issue 2 (4th August 2014) Authors: Hirsch, Christian Journal: Random structures & algorithms Issue: Volume 47:Issue 2(2015) Page Start: 361 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
15. A large‐deviations principle for all the cluster sizes of a sparse Erdős–Rényi graph. Issue 4 (5th April 2021) Authors: Andreis, Luisa; König, Wolfgang; Patterson, Robert I. A. Journal: Random structures & algorithms Issue: Volume 59:Issue 4(2021) Page Start: 522 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
16. A local central limit theorem for triangles in a random graph1. Issue 4 (12th February 2016) Authors: Gilmer, Justin; Kopparty, Swastik Journal: Random structures & algorithms Issue: Volume 48:Issue 4(2016) Page Start: 732 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
17. A new approximation technique for resource‐allocation problems. Issue 4 (30th January 2018) Authors: Saha, Barna; Srinivasan, Aravind Journal: Random structures & algorithms Issue: Volume 52:Issue 4(2018) Page Start: 680 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
18. A new combinatorial representation of the additive coalescent. Issue 2 (2nd April 2018) Authors: Marckert, Jean‐François; Wang, Minmin Journal: Random structures & algorithms Issue: Volume 54:Issue 2(2019) Page Start: 340 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
19. A note on dispersing particles on a line. Issue 4 (29th October 2018) Authors: Frieze, Alan; Pegden, Wesley Journal: Random structures & algorithms Issue: Volume 53:Issue 4(2018) Page Start: 586 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
20. A note on near‐optimal coloring of shift hypergraphs1. Issue 1 (6th August 2014) Authors: Harris, David G.; Srinivasan, Aravind Journal: Random structures & algorithms Issue: Volume 48:Issue 1(2016) Page Start: 53 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗