Montenegro, R (Massachusetts Lowell)
Wednesday 26 March 2008, 14:35-15:05
Markov-chain Monte Carlo Methods

Montenegro, R (Massachusetts Lowell) Wednesday 26 March 2008, 14:35-15:05 Markov-chain Monte Carlo Methods

A birthday paradox for Markov chains, with an optimal bound for collision in the Pollard Rho algorithm for discrete logarithm

The past half-decade has seen an increasing interaction between combinatorialists, probabilists, computer scientists and theoretical physicists concerned broadly with the study of "probability theory on graphs" or "statistical mechanics on graphs".

The programme will build on this cross-fertilisation. It is particularly timely for a number of reasons:
* methods from mathematical physics are beginning to make their mark on previously intractable combinatorial problems;
* increasing computer power, together with the wide availability of symbolic-algebra packages, has brought the possibility of exploration of non-trivial examples; 
* phase transitions are increasingly being investigated on a wide variety of combinatorial structures, including matroids, set partitions and constraint satisfaction problems, as well as graphs.

Read more at: www.newton.ac.uk/programmes/CSM/

The past half-decade has seen an increasing interaction between combinatorialists, probabilists, computer scientists and theoretical physicists concerned broadly with the study of "probability theory on graphs" or "statistical mechanics on graphs". The programme will build on this cross-fertilisation. It is particularly timely for a number of reasons: * methods from mathematical physics are beginning to make their mark on previously intractable combinatorial problems; * increasing computer power, together with the wide availability of symbolic-algebra packages, has brought the possibility of exploration of non-trivial examples; * phase transitions are increasingly being investigated on a wide variety of combinatorial structures, including matroids, set partitions and constraint satisfaction problems, as well as graphs. Read more at: www.newton.ac.uk/programmes/CSM/

Share A birthday paradox for Markov chains, with an optimal bound for collision in the Pollard Rho algorithm for discrete logarithm

Sign up to save your podcasts

A birthday paradox for Markov chains, with an optimal bound for collision in the Pollard Rho algorithm for discrete logarithm

A birthday paradox for Markov chains, with an optimal bound for collision in the Pollard Rho algorithm for discrete logarithm

More shows like Combinatorics and Statistical Mechanics

Public Lectures from the Faculty of Law, University of Cambridge

LCIL International Law Centre Podcast

Philosophy

Social and Developmental Psychology Seminar Series

Hay Festival lectures

Crystallography

Random Geometry

Medieval History Seminars

Things Seminar

Treasuries of Knowledge