Finite Markov chains and algorithmic applications /:
Based on a lecture course given at Chalmers University of Technology, this 2002 book is ideal for advanced undergraduate or beginning graduate students. The author first develops the necessary background in probability theory and Markov chains before applying it to study a range of randomized algori...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge ; New York :
Cambridge University Press,
2002.
|
| Schriftenreihe: | London Mathematical Society student texts ;
52. |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | Based on a lecture course given at Chalmers University of Technology, this 2002 book is ideal for advanced undergraduate or beginning graduate students. The author first develops the necessary background in probability theory and Markov chains before applying it to study a range of randomized algorithms with important applications in optimization and other problems in computing. Amongst the algorithms covered are the Markov chain Monte Carlo method, simulated annealing, and the recent Propp-Wilson algorithm. This book will appeal not only to mathematicians, but also to students of statistics and computer science. The subject matter is introduced in a clear and concise fashion and the numerous exercises included will help students to deepen their understanding. |
| Beschreibung: | 1 online resource (ix, 114 pages :) |
| Bibliographie: | Includes bibliographical references (pages 108-112) and index. |
| ISBN: | 0511019416 9780511019418 9780511613586 051161358X 9780521813570 0521813573 9780521890014 0521890012 0511837313 9780511837319 |
Internformat
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocm52613384 | ||
| 003 | OCoLC | ||
| 005 | 20240705115654.0 | ||
| 006 | m o d | ||
| 007 | cr cn||||||||| | ||
| 008 | 030715s2002 enka ob 001 0 eng d | ||
| 040 | |a N$T |b eng |e pn |c N$T |d YDXCP |d OCLCQ |d E7B |d OCLCQ |d CUS |d OCLCO |d COCUF |d OCLCQ |d ZCU |d OCLCF |d OCLCQ |d NLGGC |d OCLCQ |d BUB |d UAB |d OCLCQ |d VTS |d AGLDB |d STF |d M8D |d OCLCQ |d K6U |d UKAHL |d LUN |d QGK |d OCLCO |d OCLCQ |d OCLCO | ||
| 015 | |a GBA236164 |2 bnb | ||
| 019 | |a 290494728 |a 1170344145 |a 1170987463 |a 1259150428 | ||
| 020 | |a 0511019416 |q (electronic bk.) | ||
| 020 | |a 9780511019418 |q (electronic bk.) | ||
| 020 | |a 9780511613586 | ||
| 020 | |a 051161358X | ||
| 020 | |a 9780521813570 |q (hardback) | ||
| 020 | |a 0521813573 | ||
| 020 | |a 9780521890014 |q (paperback) | ||
| 020 | |a 0521890012 | ||
| 020 | |a 0511837313 | ||
| 020 | |a 9780511837319 | ||
| 020 | |z 0521813573 | ||
| 020 | |z 0521890012 |q (pbk.) | ||
| 035 | |a (OCoLC)52613384 |z (OCoLC)290494728 |z (OCoLC)1170344145 |z (OCoLC)1170987463 |z (OCoLC)1259150428 | ||
| 050 | 4 | |a QA274.7 |b .H34 2002eb | |
| 072 | 7 | |a MAT |x 000000 |2 bisacsh | |
| 082 | 7 | |a 511.8 |2 21 | |
| 049 | |a MAIN | ||
| 100 | 1 | |a Häggström, Olle. | |
| 245 | 1 | 0 | |a Finite Markov chains and algorithmic applications / |c Olle Häggström. |
| 260 | |a Cambridge ; |a New York : |b Cambridge University Press, |c 2002. | ||
| 300 | |a 1 online resource (ix, 114 pages :) | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a London Mathematical Society student texts ; |v 52 | |
| 504 | |a Includes bibliographical references (pages 108-112) and index. | ||
| 505 | 0 | |a Basics of probability theory -- Markov chains -- Computer simulation of Markov chains -- Irreducible and aperiodic Markov chains -- Stationary distributions -- Reversible Markov chains -- Markov chain Monte Carlo -- Fast convergence of MCMC algorithms -- Approximate counting -- Propp-Wilson algorithm -- Sandwiching -- Propp-Wilson with read-once randomness -- Simulated annealing -- Further reading. | |
| 588 | 0 | |a Print version record. | |
| 520 | |a Based on a lecture course given at Chalmers University of Technology, this 2002 book is ideal for advanced undergraduate or beginning graduate students. The author first develops the necessary background in probability theory and Markov chains before applying it to study a range of randomized algorithms with important applications in optimization and other problems in computing. Amongst the algorithms covered are the Markov chain Monte Carlo method, simulated annealing, and the recent Propp-Wilson algorithm. This book will appeal not only to mathematicians, but also to students of statistics and computer science. The subject matter is introduced in a clear and concise fashion and the numerous exercises included will help students to deepen their understanding. | ||
| 546 | |a English. | ||
| 650 | 0 | |a Markov processes. |0 http://id.loc.gov/authorities/subjects/sh85081369 | |
| 650 | 0 | |a Algorithms. |0 http://id.loc.gov/authorities/subjects/sh85003487 | |
| 650 | 2 | |a Markov Chains |0 https://id.nlm.nih.gov/mesh/D008390 | |
| 650 | 2 | |a Algorithms |0 https://id.nlm.nih.gov/mesh/D000465 | |
| 650 | 6 | |a Processus de Markov. | |
| 650 | 6 | |a Algorithmes. | |
| 650 | 7 | |a algorithms. |2 aat | |
| 650 | 7 | |a MATHEMATICS |x General. |2 bisacsh | |
| 650 | 7 | |a Algorithms |2 fast | |
| 650 | 7 | |a Markov processes |2 fast | |
| 650 | 1 | 7 | |a Markov-processen. |2 gtt |
| 776 | 0 | 8 | |i Print version: |a Häggström, Olle. |t Finite Markov chains and algorithmic applications. |d Cambridge ; New York : Cambridge University Press, 2002 |z 0521813573 |w (DLC) 2002510387 |w (OCoLC)49907326 |
| 830 | 0 | |a London Mathematical Society student texts ; |v 52. |0 http://id.loc.gov/authorities/names/n84727069 | |
| 856 | 1 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=78358 |3 Volltext | |
| 856 | 1 | |l CBO01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=78358 |3 Volltext | |
| 938 | |a Askews and Holts Library Services |b ASKH |n AH13426856 | ||
| 938 | |a EBSCOhost |b EBSC |n 78358 | ||
| 938 | |a YBP Library Services |b YANK |n 2300388 | ||
| 938 | |a YBP Library Services |b YANK |n 3278926 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocm52613384 |
|---|---|
| _version_ | 1813903265824243713 |
| adam_text | |
| any_adam_object | |
| author | Häggström, Olle |
| author_facet | Häggström, Olle |
| author_role | |
| author_sort | Häggström, Olle |
| author_variant | o h oh |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA274 |
| callnumber-raw | QA274.7 .H34 2002eb |
| callnumber-search | QA274.7 .H34 2002eb |
| callnumber-sort | QA 3274.7 H34 42002EB |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| contents | Basics of probability theory -- Markov chains -- Computer simulation of Markov chains -- Irreducible and aperiodic Markov chains -- Stationary distributions -- Reversible Markov chains -- Markov chain Monte Carlo -- Fast convergence of MCMC algorithms -- Approximate counting -- Propp-Wilson algorithm -- Sandwiching -- Propp-Wilson with read-once randomness -- Simulated annealing -- Further reading. |
| ctrlnum | (OCoLC)52613384 |
| dewey-full | 511.8 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.8 |
| dewey-search | 511.8 |
| dewey-sort | 3511.8 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04143cam a2200721 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocm52613384 </controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20240705115654.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cn|||||||||</controlfield><controlfield tag="008">030715s2002 enka ob 001 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">N$T</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">N$T</subfield><subfield code="d">YDXCP</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">E7B</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">CUS</subfield><subfield code="d">OCLCO</subfield><subfield code="d">COCUF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">ZCU</subfield><subfield code="d">OCLCF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">NLGGC</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">BUB</subfield><subfield code="d">UAB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">VTS</subfield><subfield code="d">AGLDB</subfield><subfield code="d">STF</subfield><subfield code="d">M8D</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">K6U</subfield><subfield code="d">UKAHL</subfield><subfield code="d">LUN</subfield><subfield code="d">QGK</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield></datafield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">GBA236164</subfield><subfield code="2">bnb</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">290494728</subfield><subfield code="a">1170344145</subfield><subfield code="a">1170987463</subfield><subfield code="a">1259150428</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511019416</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511019418</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511613586</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">051161358X</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521813570</subfield><subfield code="q">(hardback)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521813573</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521890014</subfield><subfield code="q">(paperback)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521890012</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511837313</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511837319</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0521813573</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0521890012</subfield><subfield code="q">(pbk.)</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)52613384</subfield><subfield code="z">(OCoLC)290494728</subfield><subfield code="z">(OCoLC)1170344145</subfield><subfield code="z">(OCoLC)1170987463</subfield><subfield code="z">(OCoLC)1259150428</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA274.7</subfield><subfield code="b">.H34 2002eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">000000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">511.8</subfield><subfield code="2">21</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Häggström, Olle.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Finite Markov chains and algorithmic applications /</subfield><subfield code="c">Olle Häggström.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Cambridge ;</subfield><subfield code="a">New York :</subfield><subfield code="b">Cambridge University Press,</subfield><subfield code="c">2002.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (ix, 114 pages :)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">London Mathematical Society student texts ;</subfield><subfield code="v">52</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (pages 108-112) and index.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Basics of probability theory -- Markov chains -- Computer simulation of Markov chains -- Irreducible and aperiodic Markov chains -- Stationary distributions -- Reversible Markov chains -- Markov chain Monte Carlo -- Fast convergence of MCMC algorithms -- Approximate counting -- Propp-Wilson algorithm -- Sandwiching -- Propp-Wilson with read-once randomness -- Simulated annealing -- Further reading.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Based on a lecture course given at Chalmers University of Technology, this 2002 book is ideal for advanced undergraduate or beginning graduate students. The author first develops the necessary background in probability theory and Markov chains before applying it to study a range of randomized algorithms with important applications in optimization and other problems in computing. Amongst the algorithms covered are the Markov chain Monte Carlo method, simulated annealing, and the recent Propp-Wilson algorithm. This book will appeal not only to mathematicians, but also to students of statistics and computer science. The subject matter is introduced in a clear and concise fashion and the numerous exercises included will help students to deepen their understanding.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Markov processes.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85081369</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Algorithms.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85003487</subfield></datafield><datafield tag="650" ind1=" " ind2="2"><subfield code="a">Markov Chains</subfield><subfield code="0">https://id.nlm.nih.gov/mesh/D008390</subfield></datafield><datafield tag="650" ind1=" " ind2="2"><subfield code="a">Algorithms</subfield><subfield code="0">https://id.nlm.nih.gov/mesh/D000465</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Processus de Markov.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Algorithmes.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithms.</subfield><subfield code="2">aat</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">General.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithms</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Markov processes</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1="1" ind2="7"><subfield code="a">Markov-processen.</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Häggström, Olle.</subfield><subfield code="t">Finite Markov chains and algorithmic applications.</subfield><subfield code="d">Cambridge ; New York : Cambridge University Press, 2002</subfield><subfield code="z">0521813573</subfield><subfield code="w">(DLC) 2002510387</subfield><subfield code="w">(OCoLC)49907326</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">London Mathematical Society student texts ;</subfield><subfield code="v">52.</subfield><subfield code="0">http://id.loc.gov/authorities/names/n84727069</subfield></datafield><datafield tag="856" ind1="1" ind2=" "><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=78358</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="1" ind2=" "><subfield code="l">CBO01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=78358</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH13426856</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">78358</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">2300388</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">3278926</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield></record></collection> |
| id | ZDB-4-EBA-ocm52613384 |
| illustrated | Illustrated |
| indexdate | 2024-10-25T16:15:56Z |
| institution | BVB |
| isbn | 0511019416 9780511019418 9780511613586 051161358X 9780521813570 0521813573 9780521890014 0521890012 0511837313 9780511837319 |
| language | English |
| oclc_num | 52613384 |
| open_access_boolean | |
| owner | MAIN |
| owner_facet | MAIN |
| physical | 1 online resource (ix, 114 pages :) |
| psigel | ZDB-4-EBA |
| publishDate | 2002 |
| publishDateSearch | 2002 |
| publishDateSort | 2002 |
| publisher | Cambridge University Press, |
| record_format | marc |
| series | London Mathematical Society student texts ; |
| series2 | London Mathematical Society student texts ; |
| spelling | Häggström, Olle. Finite Markov chains and algorithmic applications / Olle Häggström. Cambridge ; New York : Cambridge University Press, 2002. 1 online resource (ix, 114 pages :) text txt rdacontent computer c rdamedia online resource cr rdacarrier London Mathematical Society student texts ; 52 Includes bibliographical references (pages 108-112) and index. Basics of probability theory -- Markov chains -- Computer simulation of Markov chains -- Irreducible and aperiodic Markov chains -- Stationary distributions -- Reversible Markov chains -- Markov chain Monte Carlo -- Fast convergence of MCMC algorithms -- Approximate counting -- Propp-Wilson algorithm -- Sandwiching -- Propp-Wilson with read-once randomness -- Simulated annealing -- Further reading. Print version record. Based on a lecture course given at Chalmers University of Technology, this 2002 book is ideal for advanced undergraduate or beginning graduate students. The author first develops the necessary background in probability theory and Markov chains before applying it to study a range of randomized algorithms with important applications in optimization and other problems in computing. Amongst the algorithms covered are the Markov chain Monte Carlo method, simulated annealing, and the recent Propp-Wilson algorithm. This book will appeal not only to mathematicians, but also to students of statistics and computer science. The subject matter is introduced in a clear and concise fashion and the numerous exercises included will help students to deepen their understanding. English. Markov processes. http://id.loc.gov/authorities/subjects/sh85081369 Algorithms. http://id.loc.gov/authorities/subjects/sh85003487 Markov Chains https://id.nlm.nih.gov/mesh/D008390 Algorithms https://id.nlm.nih.gov/mesh/D000465 Processus de Markov. Algorithmes. algorithms. aat MATHEMATICS General. bisacsh Algorithms fast Markov processes fast Markov-processen. gtt Print version: Häggström, Olle. Finite Markov chains and algorithmic applications. Cambridge ; New York : Cambridge University Press, 2002 0521813573 (DLC) 2002510387 (OCoLC)49907326 London Mathematical Society student texts ; 52. http://id.loc.gov/authorities/names/n84727069 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=78358 Volltext CBO01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=78358 Volltext |
| spellingShingle | Häggström, Olle Finite Markov chains and algorithmic applications / London Mathematical Society student texts ; Basics of probability theory -- Markov chains -- Computer simulation of Markov chains -- Irreducible and aperiodic Markov chains -- Stationary distributions -- Reversible Markov chains -- Markov chain Monte Carlo -- Fast convergence of MCMC algorithms -- Approximate counting -- Propp-Wilson algorithm -- Sandwiching -- Propp-Wilson with read-once randomness -- Simulated annealing -- Further reading. Markov processes. http://id.loc.gov/authorities/subjects/sh85081369 Algorithms. http://id.loc.gov/authorities/subjects/sh85003487 Markov Chains https://id.nlm.nih.gov/mesh/D008390 Algorithms https://id.nlm.nih.gov/mesh/D000465 Processus de Markov. Algorithmes. algorithms. aat MATHEMATICS General. bisacsh Algorithms fast Markov processes fast Markov-processen. gtt |
| subject_GND | http://id.loc.gov/authorities/subjects/sh85081369 http://id.loc.gov/authorities/subjects/sh85003487 https://id.nlm.nih.gov/mesh/D008390 https://id.nlm.nih.gov/mesh/D000465 |
| title | Finite Markov chains and algorithmic applications / |
| title_auth | Finite Markov chains and algorithmic applications / |
| title_exact_search | Finite Markov chains and algorithmic applications / |
| title_full | Finite Markov chains and algorithmic applications / Olle Häggström. |
| title_fullStr | Finite Markov chains and algorithmic applications / Olle Häggström. |
| title_full_unstemmed | Finite Markov chains and algorithmic applications / Olle Häggström. |
| title_short | Finite Markov chains and algorithmic applications / |
| title_sort | finite markov chains and algorithmic applications |
| topic | Markov processes. http://id.loc.gov/authorities/subjects/sh85081369 Algorithms. http://id.loc.gov/authorities/subjects/sh85003487 Markov Chains https://id.nlm.nih.gov/mesh/D008390 Algorithms https://id.nlm.nih.gov/mesh/D000465 Processus de Markov. Algorithmes. algorithms. aat MATHEMATICS General. bisacsh Algorithms fast Markov processes fast Markov-processen. gtt |
| topic_facet | Markov processes. Algorithms. Markov Chains Algorithms Processus de Markov. Algorithmes. algorithms. MATHEMATICS General. Markov processes Markov-processen. |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=78358 |
| work_keys_str_mv | AT haggstromolle finitemarkovchainsandalgorithmicapplications |