Stochastic enumeration method for rare events, counting and combinatorial optimization

Add to your list(s) Download to your calendar using vCal

• Rubinstein, R (Israel Institute of Technology)
• Monday 21 June 2010, 11:15-11:40
• Seminar Room 1, Newton Institute.

If you have a question about this talk, please contact Mustapha Amrani.

Stochastic Processes in Communication Sciences

We present a new method for rare-event probability estimation, combinatorial optimization and counting, called the stochastic enumeration (SE) method. In terms of counting, SE presents a stochastic replica of the naive full enumeration method. It is well known that the latter is typically meaningless since the associated counting sets, such as the sets of feasible solutions of the integer programming constraints, are huge. The SE method overcomes this difficulty by using a manageable sample size. We show how to implement the SE method for some well known difficult counting problems, such as self-avoiding walks, 0-1 tables and satisfiability problems, discuss its convergence, and present numerical studies demonstrating its superiority to the classic splitting method.

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

• All CMS events
• Featured lists
• INI info aggregator
• Isaac Newton Institute Seminar Series
• School of Physical Sciences
• Seminar Room 1, Newton Institute
• bld31

Note that ex-directory lists are not shown.