Concentration of measure for the analysis of randomized algorithms:
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
New York, NY, USA
Cambridge University Press
2009
|
Ausgabe: | 1. publ. |
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | Includes bibliographical references and index |
Beschreibung: | xiv, 196 Seiten Illustrationen |
ISBN: | 9780521884273 9781107606609 |
Internformat
MARC
LEADER | 00000nam a2200000zc 4500 | ||
---|---|---|---|
001 | BV035721544 | ||
003 | DE-604 | ||
005 | 20240830 | ||
007 | t | ||
008 | 090911s2009 xxka||| |||| 00||| eng d | ||
010 | |a 2009009014 | ||
020 | |a 9780521884273 |c hardback : alk. paper |9 978-0-521-88427-3 | ||
020 | |a 9781107606609 |c paperback |9 978-1-107-60660-9 | ||
035 | |a (OCoLC)297147088 | ||
035 | |a (DE-599)BVBBV035721544 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
044 | |a xxk |c GB | ||
049 | |a DE-29T |a DE-11 |a DE-384 |a DE-739 |a DE-473 |a DE-83 |a DE-355 | ||
050 | 0 | |a QA273 | |
082 | 0 | |a 518/.1 | |
084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
084 | |a SK 820 |0 (DE-625)143258: |2 rvk | ||
084 | |a 60H35 |2 msc | ||
100 | 1 | |a Dubhashi, Devdatt |e Verfasser |0 (DE-588)113742061 |4 aut | |
245 | 1 | 0 | |a Concentration of measure for the analysis of randomized algorithms |c Devdatt P. Dubhashi, Chalmers University ; Alessandro Panconesi, Sapienza University of Rome |
264 | 1 | |a New York, NY, USA |b Cambridge University Press |c 2009 | |
300 | |a xiv, 196 Seiten |b Illustrationen | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
500 | |a Includes bibliographical references and index | ||
650 | 4 | |a Random variables | |
650 | 4 | |a Distribution (Probability theory) | |
650 | 4 | |a Limit theorems (Probability theory) | |
650 | 4 | |a Algorithms | |
650 | 0 | 7 | |a Zufallsvariable |0 (DE-588)4129514-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Wahrscheinlichkeitstheorie |0 (DE-588)4079013-7 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Wahrscheinlichkeitstheorie |0 (DE-588)4079013-7 |D s |
689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 0 | 2 | |a Zufallsvariable |0 (DE-588)4129514-6 |D s |
689 | 0 | |5 DE-604 | |
700 | 1 | |a Panconesi, Alessandro |e Verfasser |0 (DE-588)114474397 |4 aut | |
856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017998318&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-017998318 |
Datensatz im Suchindex
_version_ | 1808861076202192896 |
---|---|
adam_text |
Titel: Concentration of measure for the analysis of randomized algorithms
Autor: Dubhashi, Devdatt
Jahr: 2009
Contents
Preface page xi
1
1
2
3
5
6
6
10
10
16
16
17
18
22
23
29
29
34
34
38
39
43
45
1 Chernoff-Hoeffding Bounds
1.1 What Is "Concentration of Measure"?
1.2 The Binomial Distribution
1.3 The Chernoff Bound
1.4 Heterogeneous Variables
1.5 The Hoeffding Extension
1.6 Useful Forms of the Bound
1.7 A Variance Bound
1.8 Pointers to the Literature
1.9 Problems
2 Applications of the Chernoff-Hoeffding Bounds
2.1 Probabilistic Amplification
2.2 Load Balancing
2.3 Skip Lists
2.4 Quicksort
2.5 Low-Distortion Embeddings
2.6 Pointers to the Literature
2.7 Problems
3 Chernoff-Hoeffding Bounds in Dependent Settings
3.1 Negative Dependence
3.2 Local Dependence
3.3 Janson's Inequality
3.4 Limited Independence
3.5 Markov Dependence
viii Contents
3.6 Pointers to the Literature
3.7 Problems
4 Interlude: Probabilistic Recurrences
4.1 Problems
5 Martingales and the Method of Bounded Differences
5.1 Review of Conditional Probabilities and Expectations
5.2 Martingales and Azuma 's Inequality
5.3 Generalising Martingales and Azuma 's Inequality
5.4 The Method of Bounded Differences
5.5 Pointers to the Literature
5.6 Problems
6 The Simple Method of Bounded Differences in Action
6.1 Chernoff-Hoeffding Revisited
6.2 Stochastic Optimisation: Bin Packing
6.3 Balls and Bins
6.4 Distributed Edge Colouring: Take 1
6.5 Models for the Web Graph
6.6 Game Theory and Blackwell's Approachability Theorem
6.7 Pointers to the Literature
6.8 Problems
7 The Method of Averaged Bounded Differences
7.1 Hypergeometric Distribution
7.2 Occupancy in Balls and Bins
7.3 Stochastic Optimisation: Travelling Salesman Problem
7.4 Coupling
7.5 Handling Rare Bad Events
7.6 Quicksort
7.7 Pointers to the Literature
7.8 Problems
8 The Method of Bounded Variances
8.1 A Variance Bound for Martingale Sequences
8.2 Applications
8.3 Pointers to the Literature
8.4 Problems
9 Interlude: The Infamous Upper Tail 121
9.1 Motivation: Non-Lipschitz Functions 121
9.2 Concentration of Multivariate Polynomials 121
Contents ix
9.3 The Deletion Method 123
9.4 Problems 124
10 Isoperimetric Inequalities and Concentration 126
10.1 Isoperimetric Inequalities 126
10.2 Isoperimetry and Concentration 127
10.3 The Hamming Cube 130
10.4 Martingales and Isoperimetric Inequalities 131
10.5 Pointers to the Literature 132
10.6 Problems 133
11 Talagrand's Isoperimetric Inequality 136
11.1 Statement of the Inequality 136
11.2 The Method of Non-Uniformly Bounded Differences 139
11.3 Certifiable Functions 144
11.4 Pointers to the Literature 148
11.5 Problems 148
12 Isoperimetric Inequalities and Concentration via
Transportation Cost Inequalities 151
12.1 Distance between Probability Distributions 151
12.2 Transportation Cost Inequalities Imply Isoperimetric
Inequalities and Concentration 153
12.3 Transportation Cost Inequality in Product Spaces
with the Hamming Distance 154
12.4 An Extension to Non-Product Measures 158
12.5 Pointers to the Literature 159
12.6 Problems 159
13 Quadratic Transportation Cost and Talagrand's Inequality 161
13.1 Introduction 161
13.2 Review and Road Map 161
13.3 An L2 (Pseudo)-Metric on Distributions 163
13.4 Quadratic Transportation Cost 165
13.5 Talagrand's Inequality via Quadratic Transportation Cost 167
13.6 Extension to Dependent Processes 168
13.7 Pointers to the Literature 169
13.8 Problems 169
14 Log-Sobolev Inequalities and Concentration 171
14.1 Introduction 171
14.2 A Discrete Log-Sobolev Inequality on the Hamming Cube 172
Contents
14.3 Tensorisation 174
14.4 Modified Log-Sobolev Inequalities in Product Spaces 175
14.5 The Method of Bounded Differences Revisited 177
14.6 Self-Bounding Functions 179
14.7 Talagrand's Inequality Revisited 179
14.8 Pointers to the Literature 181
14.9 Problems 181
Appendix A Summary of the Most Useful Bounds 185
A.I Chernoff-Hoeffding Bounds 185
A.2 Bounds for Well-Behaved Functions 185
Bibliography 189
Index 195 |
any_adam_object | 1 |
author | Dubhashi, Devdatt Panconesi, Alessandro |
author_GND | (DE-588)113742061 (DE-588)114474397 |
author_facet | Dubhashi, Devdatt Panconesi, Alessandro |
author_role | aut aut |
author_sort | Dubhashi, Devdatt |
author_variant | d d dd a p ap |
building | Verbundindex |
bvnumber | BV035721544 |
callnumber-first | Q - Science |
callnumber-label | QA273 |
callnumber-raw | QA273 |
callnumber-search | QA273 |
callnumber-sort | QA 3273 |
callnumber-subject | QA - Mathematics |
classification_rvk | ST 134 SK 820 |
ctrlnum | (OCoLC)297147088 (DE-599)BVBBV035721544 |
dewey-full | 518/.1 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 518 - Numerical analysis |
dewey-raw | 518/.1 |
dewey-search | 518/.1 |
dewey-sort | 3518 11 |
dewey-tens | 510 - Mathematics |
discipline | Informatik Mathematik |
edition | 1. publ. |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000zc 4500</leader><controlfield tag="001">BV035721544</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20240830</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">090911s2009 xxka||| |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2009009014</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521884273</subfield><subfield code="c">hardback : alk. paper</subfield><subfield code="9">978-0-521-88427-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107606609</subfield><subfield code="c">paperback</subfield><subfield code="9">978-1-107-60660-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)297147088</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035721544</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="044" ind1=" " ind2=" "><subfield code="a">xxk</subfield><subfield code="c">GB</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-355</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA273</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">518/.1</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</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="084" ind1=" " ind2=" "><subfield code="a">60H35</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Dubhashi, Devdatt</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)113742061</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Concentration of measure for the analysis of randomized algorithms</subfield><subfield code="c">Devdatt P. Dubhashi, Chalmers University ; Alessandro Panconesi, Sapienza University of Rome</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY, USA</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2009</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xiv, 196 Seiten</subfield><subfield code="b">Illustrationen</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Random variables</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Distribution (Probability theory)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Limit theorems (Probability theory)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Zufallsvariable</subfield><subfield code="0">(DE-588)4129514-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Wahrscheinlichkeitstheorie</subfield><subfield code="0">(DE-588)4079013-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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="689" ind1="0" ind2="0"><subfield code="a">Wahrscheinlichkeitstheorie</subfield><subfield code="0">(DE-588)4079013-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Zufallsvariable</subfield><subfield code="0">(DE-588)4129514-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Panconesi, Alessandro</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)114474397</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017998318&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017998318</subfield></datafield></record></collection> |
id | DE-604.BV035721544 |
illustrated | Illustrated |
indexdate | 2024-08-31T00:32:30Z |
institution | BVB |
isbn | 9780521884273 9781107606609 |
language | English |
lccn | 2009009014 |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017998318 |
oclc_num | 297147088 |
open_access_boolean | |
owner | DE-29T DE-11 DE-384 DE-739 DE-473 DE-BY-UBG DE-83 DE-355 DE-BY-UBR |
owner_facet | DE-29T DE-11 DE-384 DE-739 DE-473 DE-BY-UBG DE-83 DE-355 DE-BY-UBR |
physical | xiv, 196 Seiten Illustrationen |
publishDate | 2009 |
publishDateSearch | 2009 |
publishDateSort | 2009 |
publisher | Cambridge University Press |
record_format | marc |
spelling | Dubhashi, Devdatt Verfasser (DE-588)113742061 aut Concentration of measure for the analysis of randomized algorithms Devdatt P. Dubhashi, Chalmers University ; Alessandro Panconesi, Sapienza University of Rome New York, NY, USA Cambridge University Press 2009 xiv, 196 Seiten Illustrationen txt rdacontent n rdamedia nc rdacarrier Includes bibliographical references and index Random variables Distribution (Probability theory) Limit theorems (Probability theory) Algorithms Zufallsvariable (DE-588)4129514-6 gnd rswk-swf Wahrscheinlichkeitstheorie (DE-588)4079013-7 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Wahrscheinlichkeitstheorie (DE-588)4079013-7 s Algorithmus (DE-588)4001183-5 s Zufallsvariable (DE-588)4129514-6 s DE-604 Panconesi, Alessandro Verfasser (DE-588)114474397 aut HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017998318&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Dubhashi, Devdatt Panconesi, Alessandro Concentration of measure for the analysis of randomized algorithms Random variables Distribution (Probability theory) Limit theorems (Probability theory) Algorithms Zufallsvariable (DE-588)4129514-6 gnd Wahrscheinlichkeitstheorie (DE-588)4079013-7 gnd Algorithmus (DE-588)4001183-5 gnd |
subject_GND | (DE-588)4129514-6 (DE-588)4079013-7 (DE-588)4001183-5 |
title | Concentration of measure for the analysis of randomized algorithms |
title_auth | Concentration of measure for the analysis of randomized algorithms |
title_exact_search | Concentration of measure for the analysis of randomized algorithms |
title_full | Concentration of measure for the analysis of randomized algorithms Devdatt P. Dubhashi, Chalmers University ; Alessandro Panconesi, Sapienza University of Rome |
title_fullStr | Concentration of measure for the analysis of randomized algorithms Devdatt P. Dubhashi, Chalmers University ; Alessandro Panconesi, Sapienza University of Rome |
title_full_unstemmed | Concentration of measure for the analysis of randomized algorithms Devdatt P. Dubhashi, Chalmers University ; Alessandro Panconesi, Sapienza University of Rome |
title_short | Concentration of measure for the analysis of randomized algorithms |
title_sort | concentration of measure for the analysis of randomized algorithms |
topic | Random variables Distribution (Probability theory) Limit theorems (Probability theory) Algorithms Zufallsvariable (DE-588)4129514-6 gnd Wahrscheinlichkeitstheorie (DE-588)4079013-7 gnd Algorithmus (DE-588)4001183-5 gnd |
topic_facet | Random variables Distribution (Probability theory) Limit theorems (Probability theory) Algorithms Zufallsvariable Wahrscheinlichkeitstheorie Algorithmus |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017998318&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
work_keys_str_mv | AT dubhashidevdatt concentrationofmeasurefortheanalysisofrandomizedalgorithms AT panconesialessandro concentrationofmeasurefortheanalysisofrandomizedalgorithms |