Algorithms For Random Generation And Counting: A Markov Chain Approach

Description: Please refer to the section BELOW (and NOT ABOVE) this line for the product details - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Title:Algorithms For Random Generation And Counting: A Markov Chain ApproachISBN13:9781461267072ISBN10:1461267072Author:Sinclair, A. (Author)Description:This Monograph Is A Slightly Revised Version Of My Phd Thesis 86], Com- Pleted In The Department Of Computer Science At The University Of Edin- Burgh In June 1988, With An Additional Chapter Summarising More Recent Developments Some Of The Material Has Appeared In The Form Of Papers 50,88] The Underlying Theme Of The Monograph Is The Study Of Two Classical Problems: Counting The Elements Of A Finite Set Of Combinatorial Structures, And Generating Them Uniformly At Random In Their Exact Form, These Prob- Lems Appear To Be Intractable For Many Important Structures, So Interest Has Focused On Finding Efficient Randomised Algorithms That Solve Them Ap- Proxim Ly, With A Small Probability Of Error For Most Natural Structures The Two Problems Are Intimately Connected At This Level Of Approximation, So It Is Natural To Study Them Together At The Heart Of The Monograph Is A Single Algorithmic Paradigm: Sim- Ulate A Markov Chain Whose States Are Combinatorial Structures And Which Converges To A Known Probability Distribution Over Them This Technique Has Applications Not Only In Combinatorial Counting And Generation, But Also In Several Other Areas Such As Statistical Physics And Combinatorial Optimi- Sation The Efficiency Of The Technique In Any Application Depends Crucially On The Rate Of Convergence Of The Markov Chain Binding:Paperback, PaperbackPublisher:SPRINGER NATUREPublication Date:2012-11-01Weight:0.51 lbsDimensions:0.34'' H x 9.21'' L x 6.14'' WNumber of Pages:147Language:English

Price: 113.48 USD

Location: USA

End Time: 2024-11-23T12:05:45.000Z

Shipping Cost: 0 USD