Discovery Projects - Grant ID: DP140100559

Funding Activity

Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the .

Funded Activity Summary

Finite Markov chains in statistical mechanics and combinatorics. Finite Markov chains can be viewed as random walks in a finite set. In applications, this set often consists of certain combinatorial objects whose typical properties are to be understood. If the set is large, obtaining exact solutions to such problems is generally infeasible. Markov chains can provide a highly efficient method to generate randomised approximations in such cases, but only if they equilibrate at a rate that grows slowly with the size of the set of objects under study. The project will study several classes of Markov chains that have been developed to study a number of notoriously difficult problems in statistical mechanics and combinatorics, and determine under what conditions they provide efficient approximation schemes.

Funded Activity Details

Start Date: 01-01-2014

End Date: 31-12-2017

Funding Scheme: Discovery Projects

Funding Amount: $300,000.00

Funder: Australian Research Council