Probabilistic methods in combinatorial analysis:
This 1997 work explores the role of probabilistic methods for solving combinatorial problems. These methods not only provide the means of efficiently using such notions as characteristic and generating functions, the moment method and so on but also let us use the powerful technique of limit theorem...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
Cambridge
Cambridge University Press
1997
|
Schriftenreihe: | Encyclopedia of mathematics and its applications
volume 56 |
Schlagworte: | |
Online-Zugang: | BSB01 FHN01 Volltext |
Zusammenfassung: | This 1997 work explores the role of probabilistic methods for solving combinatorial problems. These methods not only provide the means of efficiently using such notions as characteristic and generating functions, the moment method and so on but also let us use the powerful technique of limit theorems. The basic objects under investigation are nonnegative matrices, partitions and mappings of finite sets, with special emphasis on permutations and graphs, and equivalence classes specified on sequences of finite length consisting of elements of partially ordered sets; these specify the probabilistic setting of Sachkov's general combinatorial scheme. The author pays special attention to using probabilistic methods to obtain asymptotic formulae that are difficult to derive using combinatorial methods. This was an important book, describing many ideas not previously available in English; the author has taken the chance to rewrite parts of the text and refresh the references where appropriate |
Beschreibung: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
Beschreibung: | 1 online resource (x, 246 pages) |
ISBN: | 9780511666193 |
DOI: | 10.1017/CBO9780511666193 |
Internformat
MARC
LEADER | 00000nmm a2200000zcb4500 | ||
---|---|---|---|
001 | BV043941917 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | cr|uuu---uuuuu | ||
008 | 161206s1997 |||| o||u| ||||||eng d | ||
020 | |a 9780511666193 |c Online |9 978-0-511-66619-3 | ||
024 | 7 | |a 10.1017/CBO9780511666193 |2 doi | |
035 | |a (ZDB-20-CBO)CR9780511666193 | ||
035 | |a (OCoLC)992870066 | ||
035 | |a (DE-599)BVBBV043941917 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
049 | |a DE-12 |a DE-92 | ||
082 | 0 | |a 519.2 |2 20 | |
084 | |a SK 170 |0 (DE-625)143221: |2 rvk | ||
084 | |a SK 800 |0 (DE-625)143256: |2 rvk | ||
100 | 1 | |a Sachkov, Vladimir Nikolaevich |e Verfasser |4 aut | |
240 | 1 | 0 | |a Veroi͡atnostnye metody v kombinatornom analize |
245 | 1 | 0 | |a Probabilistic methods in combinatorial analysis |c Vladimir N. Sachkov |
264 | 1 | |a Cambridge |b Cambridge University Press |c 1997 | |
300 | |a 1 online resource (x, 246 pages) | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
490 | 0 | |a Encyclopedia of mathematics and its applications |v volume 56 | |
500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
505 | 8 | |a 1. Relevant elements of probability theory -- 2. Combinatorial properties of random nonnegative matrices -- 3. Probabilistic problems in the general combinatorial scheme -- 4. Random partitions of sets -- 5. Random permutations -- 6. Random graphs and random mappings | |
520 | |a This 1997 work explores the role of probabilistic methods for solving combinatorial problems. These methods not only provide the means of efficiently using such notions as characteristic and generating functions, the moment method and so on but also let us use the powerful technique of limit theorems. The basic objects under investigation are nonnegative matrices, partitions and mappings of finite sets, with special emphasis on permutations and graphs, and equivalence classes specified on sequences of finite length consisting of elements of partially ordered sets; these specify the probabilistic setting of Sachkov's general combinatorial scheme. The author pays special attention to using probabilistic methods to obtain asymptotic formulae that are difficult to derive using combinatorial methods. This was an important book, describing many ideas not previously available in English; the author has taken the chance to rewrite parts of the text and refresh the references where appropriate | ||
650 | 4 | |a Combinatorial analysis | |
650 | 4 | |a Probabilities | |
650 | 0 | 7 | |a Kombinatorische Wahrscheinlichkeitstheorie |0 (DE-588)4132446-8 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Kombinatorische Wahrscheinlichkeitstheorie |0 (DE-588)4132446-8 |D s |
689 | 0 | |8 1\p |5 DE-604 | |
776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-17277-6 |
776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-45512-1 |
856 | 4 | 0 | |u https://doi.org/10.1017/CBO9780511666193 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
912 | |a ZDB-20-CBO | ||
999 | |a oai:aleph.bib-bvb.de:BVB01-029350887 | ||
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
966 | e | |u https://doi.org/10.1017/CBO9780511666193 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1017/CBO9780511666193 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext |
Datensatz im Suchindex
_version_ | 1804176884215316480 |
---|---|
any_adam_object | |
author | Sachkov, Vladimir Nikolaevich |
author_facet | Sachkov, Vladimir Nikolaevich |
author_role | aut |
author_sort | Sachkov, Vladimir Nikolaevich |
author_variant | v n s vn vns |
building | Verbundindex |
bvnumber | BV043941917 |
classification_rvk | SK 170 SK 800 |
collection | ZDB-20-CBO |
contents | 1. Relevant elements of probability theory -- 2. Combinatorial properties of random nonnegative matrices -- 3. Probabilistic problems in the general combinatorial scheme -- 4. Random partitions of sets -- 5. Random permutations -- 6. Random graphs and random mappings |
ctrlnum | (ZDB-20-CBO)CR9780511666193 (OCoLC)992870066 (DE-599)BVBBV043941917 |
dewey-full | 519.2 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 519 - Probabilities and applied mathematics |
dewey-raw | 519.2 |
dewey-search | 519.2 |
dewey-sort | 3519.2 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
doi_str_mv | 10.1017/CBO9780511666193 |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03359nmm a2200517zcb4500</leader><controlfield tag="001">BV043941917</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s1997 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511666193</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-511-66619-3</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9780511666193</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9780511666193</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)992870066</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043941917</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></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.2</subfield><subfield code="2">20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 170</subfield><subfield code="0">(DE-625)143221:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 800</subfield><subfield code="0">(DE-625)143256:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sachkov, Vladimir Nikolaevich</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="240" ind1="1" ind2="0"><subfield code="a">Veroi͡atnostnye metody v kombinatornom analize</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Probabilistic methods in combinatorial analysis</subfield><subfield code="c">Vladimir N. Sachkov</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">1997</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (x, 246 pages)</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">Encyclopedia of mathematics and its applications</subfield><subfield code="v">volume 56</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 05 Oct 2015)</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">1. Relevant elements of probability theory -- 2. Combinatorial properties of random nonnegative matrices -- 3. Probabilistic problems in the general combinatorial scheme -- 4. Random partitions of sets -- 5. Random permutations -- 6. Random graphs and random mappings</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This 1997 work explores the role of probabilistic methods for solving combinatorial problems. These methods not only provide the means of efficiently using such notions as characteristic and generating functions, the moment method and so on but also let us use the powerful technique of limit theorems. The basic objects under investigation are nonnegative matrices, partitions and mappings of finite sets, with special emphasis on permutations and graphs, and equivalence classes specified on sequences of finite length consisting of elements of partially ordered sets; these specify the probabilistic setting of Sachkov's general combinatorial scheme. The author pays special attention to using probabilistic methods to obtain asymptotic formulae that are difficult to derive using combinatorial methods. This was an important book, describing many ideas not previously available in English; the author has taken the chance to rewrite parts of the text and refresh the references where appropriate</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Probabilities</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorische Wahrscheinlichkeitstheorie</subfield><subfield code="0">(DE-588)4132446-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Kombinatorische Wahrscheinlichkeitstheorie</subfield><subfield code="0">(DE-588)4132446-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-521-17277-6</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-521-45512-1</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9780511666193</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-029350887</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511666193</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/CBO9780511666193</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></record></collection> |
id | DE-604.BV043941917 |
illustrated | Not Illustrated |
indexdate | 2024-07-10T07:39:16Z |
institution | BVB |
isbn | 9780511666193 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029350887 |
oclc_num | 992870066 |
open_access_boolean | |
owner | DE-12 DE-92 |
owner_facet | DE-12 DE-92 |
physical | 1 online resource (x, 246 pages) |
psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
publishDate | 1997 |
publishDateSearch | 1997 |
publishDateSort | 1997 |
publisher | Cambridge University Press |
record_format | marc |
series2 | Encyclopedia of mathematics and its applications |
spelling | Sachkov, Vladimir Nikolaevich Verfasser aut Veroi͡atnostnye metody v kombinatornom analize Probabilistic methods in combinatorial analysis Vladimir N. Sachkov Cambridge Cambridge University Press 1997 1 online resource (x, 246 pages) txt rdacontent c rdamedia cr rdacarrier Encyclopedia of mathematics and its applications volume 56 Title from publisher's bibliographic system (viewed on 05 Oct 2015) 1. Relevant elements of probability theory -- 2. Combinatorial properties of random nonnegative matrices -- 3. Probabilistic problems in the general combinatorial scheme -- 4. Random partitions of sets -- 5. Random permutations -- 6. Random graphs and random mappings This 1997 work explores the role of probabilistic methods for solving combinatorial problems. These methods not only provide the means of efficiently using such notions as characteristic and generating functions, the moment method and so on but also let us use the powerful technique of limit theorems. The basic objects under investigation are nonnegative matrices, partitions and mappings of finite sets, with special emphasis on permutations and graphs, and equivalence classes specified on sequences of finite length consisting of elements of partially ordered sets; these specify the probabilistic setting of Sachkov's general combinatorial scheme. The author pays special attention to using probabilistic methods to obtain asymptotic formulae that are difficult to derive using combinatorial methods. This was an important book, describing many ideas not previously available in English; the author has taken the chance to rewrite parts of the text and refresh the references where appropriate Combinatorial analysis Probabilities Kombinatorische Wahrscheinlichkeitstheorie (DE-588)4132446-8 gnd rswk-swf Kombinatorische Wahrscheinlichkeitstheorie (DE-588)4132446-8 s 1\p DE-604 Erscheint auch als Druckausgabe 978-0-521-17277-6 Erscheint auch als Druckausgabe 978-0-521-45512-1 https://doi.org/10.1017/CBO9780511666193 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Sachkov, Vladimir Nikolaevich Probabilistic methods in combinatorial analysis 1. Relevant elements of probability theory -- 2. Combinatorial properties of random nonnegative matrices -- 3. Probabilistic problems in the general combinatorial scheme -- 4. Random partitions of sets -- 5. Random permutations -- 6. Random graphs and random mappings Combinatorial analysis Probabilities Kombinatorische Wahrscheinlichkeitstheorie (DE-588)4132446-8 gnd |
subject_GND | (DE-588)4132446-8 |
title | Probabilistic methods in combinatorial analysis |
title_alt | Veroi͡atnostnye metody v kombinatornom analize |
title_auth | Probabilistic methods in combinatorial analysis |
title_exact_search | Probabilistic methods in combinatorial analysis |
title_full | Probabilistic methods in combinatorial analysis Vladimir N. Sachkov |
title_fullStr | Probabilistic methods in combinatorial analysis Vladimir N. Sachkov |
title_full_unstemmed | Probabilistic methods in combinatorial analysis Vladimir N. Sachkov |
title_short | Probabilistic methods in combinatorial analysis |
title_sort | probabilistic methods in combinatorial analysis |
topic | Combinatorial analysis Probabilities Kombinatorische Wahrscheinlichkeitstheorie (DE-588)4132446-8 gnd |
topic_facet | Combinatorial analysis Probabilities Kombinatorische Wahrscheinlichkeitstheorie |
url | https://doi.org/10.1017/CBO9780511666193 |
work_keys_str_mv | AT sachkovvladimirnikolaevich veroiatnostnyemetodyvkombinatornomanalize AT sachkovvladimirnikolaevich probabilisticmethodsincombinatorialanalysis |