ERC Starting Grant · 2020
New Approaches to Counting and Sampling
Probabilistic models have been adopted in almost all scientific disciplines. Many related computational problems arise, involving estimating the probability of certain events, or drawing samples from a desired distribution. These problems, technically known as counting and sampling problems, are the main focus of the NACS project, with an emphasis on rigorous mathematical analysis. Markov chain Monte Carlo algorithms have been designed and applied for counting and sampling long before the computational complexity theory, and they are among the oldest randomised algorithms. There had been dramatic progress in the rigorous analysis of Markov chains in the golden era of early 90s, which has…
From the public funding record at EU CORDIS. Describes the funded project, not the reviews below.