logo
ProjectOngoing

New Approaches to Counting and Sampling

One of 10,000+ projects Taiyo tracks in United Kingdom.

Source: EU Funding & Tenders Portal

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 Mo

Status
Under Construction
Sector
Education, Power Generation (CCGT), Government
Location
United Kingdom
Updated
22 Jul 2026
Source
EU Funding & Tenders Portal

ConstructChat

Ask ConstructChat about New Approaches to Counting and Sampling

Pick a question to edit it, or write your own.

First answer free · no account

I am a

Project Information FAQ

Project Information

4 Q
The project “New Approaches to Counting and Sampling” is an infrastructure initiative in the Education sector, located in United Kingdom. Taiyo aggregates data on it from EU Funding & Tenders Portal.

Participants

Sponsoring Agency

Status

Original status

ongoing

Taiyo status

Under Construction

Taiyo last update

2026-07-22

Contact

Not available for this record.

Description

Description

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 lead to many landmark results. Nevertheless, after about 30 years' development, the complexity of many fundamental problems remains open. In the last few years, a number of exciting approaches have emerged, resulting from new perspectives and surprising connections. Consequently, a lot of old challenges start to crumble. It is now the right time to revisit some of the oldest problems in counting complexity. The emerging techniques include brand new sampling frameworks, such as partial rejection sampling, as well as new ways to analyse traditional algorithms, especially Markov chain algorithms. They can be classified under two themes: those connected with the Lovasz local lemma and those with the geometry of polynomials. The goal of this project is to unleash the full power of the new approaches, to establish novel algorithmic paradigms, and to attack major open problems, such as sampling perfect matchings in general graphs. Due to the fundamental nature of counting and sampling problems, success of the project will also benefit a number of related areas, ranging from combinatorial optimisation, machine learning, and randomised algorithms, to combinatorics, probability theory, statistical physics, and quantum computation.

Location

Country

United Kingdom (UK)

Source

Source

EU Funding & Tenders Portal

URL

More Details

Record type

Project

Sector

Education, Power Generation (CCGT), Government

Article published date

2025-11-01

More on this project

Research

Free account

View all details

You are reading the public part. A free account opens the rest:

  • Every detail on this project
  • News and media coverage
  • Technical research
View all details

Free account · no card · lands you back on this project