Random walk in random and non-random environments /:
The simplest mathematical model of the Brownian motion of physics is the simple, symmetric random walk. This book collects and compares current results - mostly strong theorems which describe the properties of a random walk. The modern problems of the limit theorems of probability theory are treated...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
[Hackensack] New Jersey :
World Scientific,
2013.
|
Ausgabe: | 3rd ed. |
Schlagworte: | |
Online-Zugang: | Volltext |
Zusammenfassung: | The simplest mathematical model of the Brownian motion of physics is the simple, symmetric random walk. This book collects and compares current results - mostly strong theorems which describe the properties of a random walk. The modern problems of the limit theorems of probability theory are treated in the simple case of coin tossing. Taking advantage of this simplicity, the reader is familiarized with limit theorems (especially strong ones) without the burden of technical tools and difficulties. An easy way of considering the Wiener process is also given, through the study of the random walk. Since the first and second editions were published in 1990 and 2005, a number of new results have appeared in the literature. The first two editions contained many unsolved problems and conjectures which have since been settled; this third, revised and enlarged edition includes those new results. In this edition, a completely new part is included concerning Simple Random Walks on Graphs. Properties of random walks on several concrete graphs have been studied in the last decade. Some of the obtained results are also presented. |
Beschreibung: | 1 online resource |
Bibliographie: | Includes bibliographical references and indexes. |
ISBN: | 9789814447515 981444751X |
Internformat
MARC
LEADER | 00000cam a2200000 a 4500 | ||
---|---|---|---|
001 | ZDB-4-EBA-ocn842932677 | ||
003 | OCoLC | ||
005 | 20241004212047.0 | ||
006 | m o d | ||
007 | cr cnu---unuuu | ||
008 | 130514s2013 nju ob 001 0 eng d | ||
040 | |a N$T |b eng |e pn |c N$T |d I9W |d OCLCF |d GGVRL |d YDXCP |d OCLCQ |d AGLDB |d OCLCQ |d VTS |d VT2 |d WYU |d JBG |d STF |d AU@ |d M8D |d UKAHL |d LEAUB |d OCLCQ |d OCLCO |d OCLCQ |d OCLCO |d OCLCL | ||
019 | |a 1055384103 |a 1065826233 |a 1081245802 | ||
020 | |a 9789814447515 |q (electronic bk.) | ||
020 | |a 981444751X |q (electronic bk.) | ||
020 | |z 9789814447508 | ||
020 | |z 9814447501 | ||
035 | |a (OCoLC)842932677 |z (OCoLC)1055384103 |z (OCoLC)1065826233 |z (OCoLC)1081245802 | ||
050 | 4 | |a QA274.73 |b .R48 2013eb | |
072 | 7 | |a MAT |x 029000 |2 bisacsh | |
082 | 7 | |a 519.2/82 |2 23 | |
049 | |a MAIN | ||
100 | 1 | |a Révész, Pál. | |
245 | 1 | 0 | |a Random walk in random and non-random environments / |c by Pál Révész, Technische Universität Wien, Austria. |
250 | |a 3rd ed. | ||
260 | |a [Hackensack] New Jersey : |b World Scientific, |c 2013. | ||
300 | |a 1 online resource | ||
336 | |a text |b txt |2 rdacontent | ||
337 | |a computer |b c |2 rdamedia | ||
338 | |a online resource |b cr |2 rdacarrier | ||
504 | |a Includes bibliographical references and indexes. | ||
588 | 0 | |a Print version record. | |
505 | 0 | |a I. Simple symmetric random walk in [symbol]. Notations and abbreviations. 1. Introduction of part I. 2. Distributions. 3. Recurrence and the zero-one Law. 4. From the strong law of large numbers to the law of iterated logarithm. 5. Lévy classes. 6. Wiener process and invariance principle. 7. Increments. 8. Strassen type theorems. 9. Distribution of the local time. 10. Local time and invariance principle. 11. Strong theorems of the local time. 12. Excursions. 13. Frequently and rarely visited sites. 14. An embedding theorem. 15. A few further results. 16. Summary of part I -- II. Simple symmetric random walk in [symbol]. Notations. 17. The recurrence theorem. 18. Wiener process and invariance principle. 19. The law of iterated logarithm. 20. Local time. 21. The range. 22. Heavy points and heavy balls. 23. Crossing and self-crossing. 24. Large covered balls. 25. Long excursions. 26. Speed of escape. 27. A few further problems -- III. Random walk in random environment. Notations. 28. Introduction of part III. 29. In the first six days. 30. After the sixth day. 31. What can a physicist say about the local time [symbol]? 32. On the favourite value of the RWIRE. 33. A few further problems -- IV. Random walks in graphs. 34. Introduction of part IV. 35. Random walk in comb. 36. Random walk in a comb and in a brush with crossings. 37. Random walk on a spider. 38. Random walk in half-plane-half-comb. | |
520 | |a The simplest mathematical model of the Brownian motion of physics is the simple, symmetric random walk. This book collects and compares current results - mostly strong theorems which describe the properties of a random walk. The modern problems of the limit theorems of probability theory are treated in the simple case of coin tossing. Taking advantage of this simplicity, the reader is familiarized with limit theorems (especially strong ones) without the burden of technical tools and difficulties. An easy way of considering the Wiener process is also given, through the study of the random walk. Since the first and second editions were published in 1990 and 2005, a number of new results have appeared in the literature. The first two editions contained many unsolved problems and conjectures which have since been settled; this third, revised and enlarged edition includes those new results. In this edition, a completely new part is included concerning Simple Random Walks on Graphs. Properties of random walks on several concrete graphs have been studied in the last decade. Some of the obtained results are also presented. | ||
650 | 0 | |a Random walks (Mathematics) |0 http://id.loc.gov/authorities/subjects/sh85111357 | |
650 | 6 | |a Marches aléatoires (Mathématiques) | |
650 | 7 | |a MATHEMATICS |x Probability & Statistics |x General. |2 bisacsh | |
650 | 7 | |a Random walks (Mathematics) |2 fast | |
758 | |i has work: |a Random walk in random and non-random environments (Text) |1 https://id.oclc.org/worldcat/entity/E39PCXPXHGK4cXB8JX9YwT4tH3 |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
776 | 0 | 8 | |i Print version: |a Révész, Pál. |t Random walk in random and non-random environments. |b 3rd ed. |d [Hackensack] New Jersey : World Scientific, 2013 |z 9789814447508 |w (DLC) 2012050041 |w (OCoLC)826660086 |
856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=575418 |3 Volltext |
938 | |a Askews and Holts Library Services |b ASKH |n AH25219388 | ||
938 | |a EBSCOhost |b EBSC |n 575418 | ||
938 | |a Cengage Learning |b GVRL |n GVRL8RED | ||
938 | |a YBP Library Services |b YANK |n 10697893 | ||
994 | |a 92 |b GEBAY | ||
912 | |a ZDB-4-EBA | ||
049 | |a DE-863 |
Datensatz im Suchindex
DE-BY-FWS_katkey | ZDB-4-EBA-ocn842932677 |
---|---|
_version_ | 1816882232253480961 |
adam_text | |
any_adam_object | |
author | Révész, Pál |
author_facet | Révész, Pál |
author_role | |
author_sort | Révész, Pál |
author_variant | p r pr |
building | Verbundindex |
bvnumber | localFWS |
callnumber-first | Q - Science |
callnumber-label | QA274 |
callnumber-raw | QA274.73 .R48 2013eb |
callnumber-search | QA274.73 .R48 2013eb |
callnumber-sort | QA 3274.73 R48 42013EB |
callnumber-subject | QA - Mathematics |
collection | ZDB-4-EBA |
contents | I. Simple symmetric random walk in [symbol]. Notations and abbreviations. 1. Introduction of part I. 2. Distributions. 3. Recurrence and the zero-one Law. 4. From the strong law of large numbers to the law of iterated logarithm. 5. Lévy classes. 6. Wiener process and invariance principle. 7. Increments. 8. Strassen type theorems. 9. Distribution of the local time. 10. Local time and invariance principle. 11. Strong theorems of the local time. 12. Excursions. 13. Frequently and rarely visited sites. 14. An embedding theorem. 15. A few further results. 16. Summary of part I -- II. Simple symmetric random walk in [symbol]. Notations. 17. The recurrence theorem. 18. Wiener process and invariance principle. 19. The law of iterated logarithm. 20. Local time. 21. The range. 22. Heavy points and heavy balls. 23. Crossing and self-crossing. 24. Large covered balls. 25. Long excursions. 26. Speed of escape. 27. A few further problems -- III. Random walk in random environment. Notations. 28. Introduction of part III. 29. In the first six days. 30. After the sixth day. 31. What can a physicist say about the local time [symbol]? 32. On the favourite value of the RWIRE. 33. A few further problems -- IV. Random walks in graphs. 34. Introduction of part IV. 35. Random walk in comb. 36. Random walk in a comb and in a brush with crossings. 37. Random walk on a spider. 38. Random walk in half-plane-half-comb. |
ctrlnum | (OCoLC)842932677 |
dewey-full | 519.2/82 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 519 - Probabilities and applied mathematics |
dewey-raw | 519.2/82 |
dewey-search | 519.2/82 |
dewey-sort | 3519.2 282 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
edition | 3rd ed. |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04903cam a2200517 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn842932677</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cnu---unuuu</controlfield><controlfield tag="008">130514s2013 nju 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">I9W</subfield><subfield code="d">OCLCF</subfield><subfield code="d">GGVRL</subfield><subfield code="d">YDXCP</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">AGLDB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">VTS</subfield><subfield code="d">VT2</subfield><subfield code="d">WYU</subfield><subfield code="d">JBG</subfield><subfield code="d">STF</subfield><subfield code="d">AU@</subfield><subfield code="d">M8D</subfield><subfield code="d">UKAHL</subfield><subfield code="d">LEAUB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">1055384103</subfield><subfield code="a">1065826233</subfield><subfield code="a">1081245802</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789814447515</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">981444751X</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9789814447508</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9814447501</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)842932677</subfield><subfield code="z">(OCoLC)1055384103</subfield><subfield code="z">(OCoLC)1065826233</subfield><subfield code="z">(OCoLC)1081245802</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA274.73</subfield><subfield code="b">.R48 2013eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">029000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">519.2/82</subfield><subfield code="2">23</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Révész, Pál.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Random walk in random and non-random environments /</subfield><subfield code="c">by Pál Révész, Technische Universität Wien, Austria.</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">3rd ed.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">[Hackensack] New Jersey :</subfield><subfield code="b">World Scientific,</subfield><subfield code="c">2013.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource</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="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and indexes.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">I. Simple symmetric random walk in [symbol]. Notations and abbreviations. 1. Introduction of part I. 2. Distributions. 3. Recurrence and the zero-one Law. 4. From the strong law of large numbers to the law of iterated logarithm. 5. Lévy classes. 6. Wiener process and invariance principle. 7. Increments. 8. Strassen type theorems. 9. Distribution of the local time. 10. Local time and invariance principle. 11. Strong theorems of the local time. 12. Excursions. 13. Frequently and rarely visited sites. 14. An embedding theorem. 15. A few further results. 16. Summary of part I -- II. Simple symmetric random walk in [symbol]. Notations. 17. The recurrence theorem. 18. Wiener process and invariance principle. 19. The law of iterated logarithm. 20. Local time. 21. The range. 22. Heavy points and heavy balls. 23. Crossing and self-crossing. 24. Large covered balls. 25. Long excursions. 26. Speed of escape. 27. A few further problems -- III. Random walk in random environment. Notations. 28. Introduction of part III. 29. In the first six days. 30. After the sixth day. 31. What can a physicist say about the local time [symbol]? 32. On the favourite value of the RWIRE. 33. A few further problems -- IV. Random walks in graphs. 34. Introduction of part IV. 35. Random walk in comb. 36. Random walk in a comb and in a brush with crossings. 37. Random walk on a spider. 38. Random walk in half-plane-half-comb.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The simplest mathematical model of the Brownian motion of physics is the simple, symmetric random walk. This book collects and compares current results - mostly strong theorems which describe the properties of a random walk. The modern problems of the limit theorems of probability theory are treated in the simple case of coin tossing. Taking advantage of this simplicity, the reader is familiarized with limit theorems (especially strong ones) without the burden of technical tools and difficulties. An easy way of considering the Wiener process is also given, through the study of the random walk. Since the first and second editions were published in 1990 and 2005, a number of new results have appeared in the literature. The first two editions contained many unsolved problems and conjectures which have since been settled; this third, revised and enlarged edition includes those new results. In this edition, a completely new part is included concerning Simple Random Walks on Graphs. Properties of random walks on several concrete graphs have been studied in the last decade. Some of the obtained results are also presented.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Random walks (Mathematics)</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85111357</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Marches aléatoires (Mathématiques)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">Probability & Statistics</subfield><subfield code="x">General.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Random walks (Mathematics)</subfield><subfield code="2">fast</subfield></datafield><datafield tag="758" ind1=" " ind2=" "><subfield code="i">has work:</subfield><subfield code="a">Random walk in random and non-random environments (Text)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCXPXHGK4cXB8JX9YwT4tH3</subfield><subfield code="4">https://id.oclc.org/worldcat/ontology/hasWork</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Révész, Pál.</subfield><subfield code="t">Random walk in random and non-random environments.</subfield><subfield code="b">3rd ed.</subfield><subfield code="d">[Hackensack] New Jersey : World Scientific, 2013</subfield><subfield code="z">9789814447508</subfield><subfield code="w">(DLC) 2012050041</subfield><subfield code="w">(OCoLC)826660086</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><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=575418</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">AH25219388</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">575418</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Cengage Learning</subfield><subfield code="b">GVRL</subfield><subfield code="n">GVRL8RED</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">10697893</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><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
id | ZDB-4-EBA-ocn842932677 |
illustrated | Not Illustrated |
indexdate | 2024-11-27T13:25:20Z |
institution | BVB |
isbn | 9789814447515 981444751X |
language | English |
oclc_num | 842932677 |
open_access_boolean | |
owner | MAIN DE-863 DE-BY-FWS |
owner_facet | MAIN DE-863 DE-BY-FWS |
physical | 1 online resource |
psigel | ZDB-4-EBA |
publishDate | 2013 |
publishDateSearch | 2013 |
publishDateSort | 2013 |
publisher | World Scientific, |
record_format | marc |
spelling | Révész, Pál. Random walk in random and non-random environments / by Pál Révész, Technische Universität Wien, Austria. 3rd ed. [Hackensack] New Jersey : World Scientific, 2013. 1 online resource text txt rdacontent computer c rdamedia online resource cr rdacarrier Includes bibliographical references and indexes. Print version record. I. Simple symmetric random walk in [symbol]. Notations and abbreviations. 1. Introduction of part I. 2. Distributions. 3. Recurrence and the zero-one Law. 4. From the strong law of large numbers to the law of iterated logarithm. 5. Lévy classes. 6. Wiener process and invariance principle. 7. Increments. 8. Strassen type theorems. 9. Distribution of the local time. 10. Local time and invariance principle. 11. Strong theorems of the local time. 12. Excursions. 13. Frequently and rarely visited sites. 14. An embedding theorem. 15. A few further results. 16. Summary of part I -- II. Simple symmetric random walk in [symbol]. Notations. 17. The recurrence theorem. 18. Wiener process and invariance principle. 19. The law of iterated logarithm. 20. Local time. 21. The range. 22. Heavy points and heavy balls. 23. Crossing and self-crossing. 24. Large covered balls. 25. Long excursions. 26. Speed of escape. 27. A few further problems -- III. Random walk in random environment. Notations. 28. Introduction of part III. 29. In the first six days. 30. After the sixth day. 31. What can a physicist say about the local time [symbol]? 32. On the favourite value of the RWIRE. 33. A few further problems -- IV. Random walks in graphs. 34. Introduction of part IV. 35. Random walk in comb. 36. Random walk in a comb and in a brush with crossings. 37. Random walk on a spider. 38. Random walk in half-plane-half-comb. The simplest mathematical model of the Brownian motion of physics is the simple, symmetric random walk. This book collects and compares current results - mostly strong theorems which describe the properties of a random walk. The modern problems of the limit theorems of probability theory are treated in the simple case of coin tossing. Taking advantage of this simplicity, the reader is familiarized with limit theorems (especially strong ones) without the burden of technical tools and difficulties. An easy way of considering the Wiener process is also given, through the study of the random walk. Since the first and second editions were published in 1990 and 2005, a number of new results have appeared in the literature. The first two editions contained many unsolved problems and conjectures which have since been settled; this third, revised and enlarged edition includes those new results. In this edition, a completely new part is included concerning Simple Random Walks on Graphs. Properties of random walks on several concrete graphs have been studied in the last decade. Some of the obtained results are also presented. Random walks (Mathematics) http://id.loc.gov/authorities/subjects/sh85111357 Marches aléatoires (Mathématiques) MATHEMATICS Probability & Statistics General. bisacsh Random walks (Mathematics) fast has work: Random walk in random and non-random environments (Text) https://id.oclc.org/worldcat/entity/E39PCXPXHGK4cXB8JX9YwT4tH3 https://id.oclc.org/worldcat/ontology/hasWork Print version: Révész, Pál. Random walk in random and non-random environments. 3rd ed. [Hackensack] New Jersey : World Scientific, 2013 9789814447508 (DLC) 2012050041 (OCoLC)826660086 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=575418 Volltext |
spellingShingle | Révész, Pál Random walk in random and non-random environments / I. Simple symmetric random walk in [symbol]. Notations and abbreviations. 1. Introduction of part I. 2. Distributions. 3. Recurrence and the zero-one Law. 4. From the strong law of large numbers to the law of iterated logarithm. 5. Lévy classes. 6. Wiener process and invariance principle. 7. Increments. 8. Strassen type theorems. 9. Distribution of the local time. 10. Local time and invariance principle. 11. Strong theorems of the local time. 12. Excursions. 13. Frequently and rarely visited sites. 14. An embedding theorem. 15. A few further results. 16. Summary of part I -- II. Simple symmetric random walk in [symbol]. Notations. 17. The recurrence theorem. 18. Wiener process and invariance principle. 19. The law of iterated logarithm. 20. Local time. 21. The range. 22. Heavy points and heavy balls. 23. Crossing and self-crossing. 24. Large covered balls. 25. Long excursions. 26. Speed of escape. 27. A few further problems -- III. Random walk in random environment. Notations. 28. Introduction of part III. 29. In the first six days. 30. After the sixth day. 31. What can a physicist say about the local time [symbol]? 32. On the favourite value of the RWIRE. 33. A few further problems -- IV. Random walks in graphs. 34. Introduction of part IV. 35. Random walk in comb. 36. Random walk in a comb and in a brush with crossings. 37. Random walk on a spider. 38. Random walk in half-plane-half-comb. Random walks (Mathematics) http://id.loc.gov/authorities/subjects/sh85111357 Marches aléatoires (Mathématiques) MATHEMATICS Probability & Statistics General. bisacsh Random walks (Mathematics) fast |
subject_GND | http://id.loc.gov/authorities/subjects/sh85111357 |
title | Random walk in random and non-random environments / |
title_auth | Random walk in random and non-random environments / |
title_exact_search | Random walk in random and non-random environments / |
title_full | Random walk in random and non-random environments / by Pál Révész, Technische Universität Wien, Austria. |
title_fullStr | Random walk in random and non-random environments / by Pál Révész, Technische Universität Wien, Austria. |
title_full_unstemmed | Random walk in random and non-random environments / by Pál Révész, Technische Universität Wien, Austria. |
title_short | Random walk in random and non-random environments / |
title_sort | random walk in random and non random environments |
topic | Random walks (Mathematics) http://id.loc.gov/authorities/subjects/sh85111357 Marches aléatoires (Mathématiques) MATHEMATICS Probability & Statistics General. bisacsh Random walks (Mathematics) fast |
topic_facet | Random walks (Mathematics) Marches aléatoires (Mathématiques) MATHEMATICS Probability & Statistics General. |
url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=575418 |
work_keys_str_mv | AT reveszpal randomwalkinrandomandnonrandomenvironments |