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
Cambridge University Press
2002
|
| Schriftenreihe: | London Mathematical Society student texts
52 |
| Schlagworte: | |
| Online-Zugang: | BSB01 FHN01 UBG01 UBR01 UER01 URL des Erstveröffentlichers |
| 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-Ressource (ix, 114 Seiten) |
| ISBN: | 9780511613586 |
| DOI: | 10.1017/CBO9780511613586 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV043940727 | ||
| 003 | DE-604 | ||
| 005 | 20240318 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s2002 |||| o||u| ||||||eng d | ||
| 020 | |a 9780511613586 |c Online |9 978-0-511-61358-6 | ||
| 024 | 7 | |a 10.1017/CBO9780511613586 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9780511613586 | ||
| 035 | |a (OCoLC)967696247 | ||
| 035 | |a (DE-599)BVBBV043940727 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 |a DE-355 |a DE-473 |a DE-29 | ||
| 082 | 0 | |a 511.8 |2 21 | |
| 084 | |a SK 820 |0 (DE-625)143258: |2 rvk | ||
| 100 | 1 | |a Häggström, Olle |e Verfasser |0 (DE-588)128968540 |4 aut | |
| 245 | 1 | 0 | |a Finite Markov chains and algorithmic applications |c Olle Häggström |
| 246 | 1 | 3 | |a Finite Markov Chains & Algorithmic Applications |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2002 | |
| 300 | |a 1 Online-Ressource (ix, 114 Seiten) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a London Mathematical Society student texts |v 52 | |
| 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 | ||
| 650 | 4 | |a Markov processes | |
| 650 | 4 | |a Algorithms | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Markov-Prozess |0 (DE-588)4134948-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Endliche Markov-Kette |0 (DE-588)4152154-7 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Endliche Markov-Kette |0 (DE-588)4152154-7 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Markov-Prozess |0 (DE-588)4134948-9 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 2 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-0-521-81357-0 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-0-521-89001-4 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9780511613586 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029349697 | ||
| 966 | e | |u https://doi.org/10.1017/CBO9780511613586 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511613586 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511613586 |l UBG01 |p ZDB-20-CBO |q UBG_Einzelkauf |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511613586 |l UBR01 |p ZDB-20-CBO |q UBR Einzelkauf (Lückenergänzung CUP Serien 2018) |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511613586 |l UER01 |p ZDB-50-CBO |q UER_Einzelkauf |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804176881607507968 |
|---|---|
| any_adam_object | |
| author | Häggström, Olle |
| author_GND | (DE-588)128968540 |
| author_facet | Häggström, Olle |
| author_role | aut |
| author_sort | Häggström, Olle |
| author_variant | o h oh |
| building | Verbundindex |
| bvnumber | BV043940727 |
| classification_rvk | SK 820 |
| collection | ZDB-20-CBO |
| ctrlnum | (ZDB-20-CBO)CR9780511613586 (OCoLC)967696247 (DE-599)BVBBV043940727 |
| 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 |
| doi_str_mv | 10.1017/CBO9780511613586 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03236nmm a2200577zcb4500</leader><controlfield tag="001">BV043940727</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20240318 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s2002 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511613586</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-511-61358-6</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9780511613586</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9780511613586</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)967696247</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043940727</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-29</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.8</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 820</subfield><subfield code="0">(DE-625)143258:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Häggström, Olle</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)128968540</subfield><subfield code="4">aut</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="246" ind1="1" ind2="3"><subfield code="a">Finite Markov Chains & Algorithmic Applications</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2002</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (ix, 114 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">London Mathematical Society student texts</subfield><subfield code="v">52</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="650" ind1=" " ind2="4"><subfield code="a">Markov processes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Markov-Prozess</subfield><subfield code="0">(DE-588)4134948-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Endliche Markov-Kette</subfield><subfield code="0">(DE-588)4152154-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Endliche Markov-Kette</subfield><subfield code="0">(DE-588)4152154-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Markov-Prozess</subfield><subfield code="0">(DE-588)4134948-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">978-0-521-81357-0</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">978-0-521-89001-4</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9780511613586</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029349697</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511613586</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511613586</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511613586</subfield><subfield code="l">UBG01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">UBG_Einzelkauf</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511613586</subfield><subfield code="l">UBR01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">UBR Einzelkauf (Lückenergänzung CUP Serien 2018)</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511613586</subfield><subfield code="l">UER01</subfield><subfield code="p">ZDB-50-CBO</subfield><subfield code="q">UER_Einzelkauf</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043940727 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:39:14Z |
| institution | BVB |
| isbn | 9780511613586 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029349697 |
| oclc_num | 967696247 |
| open_access_boolean | |
| owner | DE-12 DE-92 DE-355 DE-BY-UBR DE-473 DE-BY-UBG DE-29 |
| owner_facet | DE-12 DE-92 DE-355 DE-BY-UBR DE-473 DE-BY-UBG DE-29 |
| physical | 1 Online-Ressource (ix, 114 Seiten) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO ZDB-20-CBO UBG_Einzelkauf ZDB-20-CBO UBR Einzelkauf (Lückenergänzung CUP Serien 2018) ZDB-50-CBO UER_Einzelkauf |
| publishDate | 2002 |
| publishDateSearch | 2002 |
| publishDateSort | 2002 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | London Mathematical Society student texts |
| spelling | Häggström, Olle Verfasser (DE-588)128968540 aut Finite Markov chains and algorithmic applications Olle Häggström Finite Markov Chains & Algorithmic Applications Cambridge Cambridge University Press 2002 1 Online-Ressource (ix, 114 Seiten) txt rdacontent c rdamedia cr rdacarrier London Mathematical Society student texts 52 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 Markov processes Algorithms Algorithmus (DE-588)4001183-5 gnd rswk-swf Markov-Prozess (DE-588)4134948-9 gnd rswk-swf Endliche Markov-Kette (DE-588)4152154-7 gnd rswk-swf Endliche Markov-Kette (DE-588)4152154-7 s DE-604 Markov-Prozess (DE-588)4134948-9 s Algorithmus (DE-588)4001183-5 s Erscheint auch als Druck-Ausgabe 978-0-521-81357-0 Erscheint auch als Druck-Ausgabe 978-0-521-89001-4 https://doi.org/10.1017/CBO9780511613586 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Häggström, Olle Finite Markov chains and algorithmic applications Markov processes Algorithms Algorithmus (DE-588)4001183-5 gnd Markov-Prozess (DE-588)4134948-9 gnd Endliche Markov-Kette (DE-588)4152154-7 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4134948-9 (DE-588)4152154-7 |
| title | Finite Markov chains and algorithmic applications |
| title_alt | Finite Markov Chains & 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 Algorithms Algorithmus (DE-588)4001183-5 gnd Markov-Prozess (DE-588)4134948-9 gnd Endliche Markov-Kette (DE-588)4152154-7 gnd |
| topic_facet | Markov processes Algorithms Algorithmus Markov-Prozess Endliche Markov-Kette |
| url | https://doi.org/10.1017/CBO9780511613586 |
| work_keys_str_mv | AT haggstromolle finitemarkovchainsandalgorithmicapplications AT haggstromolle finitemarkovchainsalgorithmicapplications |