Mr Nicolas Rivera Aburto

Former student

Project Title: Voting models on graphs

End date: 1/03/2018

Latest Research Outputs

New Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs
Cooper, C. D., Radzik, T. & Rivera Aburto, N., Dec 2019, In: ACM Transactions on Parallel Computing. 6, 3, p. 1-24 24 p., 16.
Research output: Contribution to journal › Article › peer-review
Best-of-Three Voting Process on Dense Graphs
Kang, N. & Rivera, N., 2019, The 31st Symposium onParallelism in Algorithms and Architectures.
Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review
Dispersion processes
Cooper, C., McDowell, A., Radzik, T., Rivera Aburto, N. & Shiraga, T., Dec 2018, In: RANDOM STRUCTURES AND ALGORITHMS. 53, 4, p. 561-585
Research output: Contribution to journal › Article › peer-review
Threshold behaviour of discordant voting on the complete graph
Cooper, C. & Rivera, N., 12 Oct 2018, (E-pub ahead of print) In: Journal of Discrete Algorithms.
Research output: Contribution to journal › Article › peer-review

Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs
Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review
159
downloads
New Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs
Research output: Contribution to journal › Article › peer-review
145
downloads
Dispersion processes
Research output: Contribution to journal › Article › peer-review
129
downloads
Threshold behaviour of discordant voting on the complete graph
Research output: Contribution to journal › Article › peer-review
99
downloads
The coalescing-branching random walk on expanders and the dual epidemic process
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
73
downloads