Random graphs and complex networks, Volume 2:
Complex networks are key to describing the connected nature of the society that we live in. This book, the second of two volumes, describes the local structure of random graph models for real-world networks and determines when these models have a giant component and when they are small-, and ultra-s...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2024
|
| Schriftenreihe: | Cambridge series on statistical and probabilistic mathematics
54 |
| Schlagworte: | |
| Online-Zugang: | DE-12 DE-634 DE-92 URL des Erstveröffentlichers |
| Zusammenfassung: | Complex networks are key to describing the connected nature of the society that we live in. This book, the second of two volumes, describes the local structure of random graph models for real-world networks and determines when these models have a giant component and when they are small-, and ultra-small, worlds. This is the first book to cover the theory and implications of local convergence, a crucial technique in the analysis of sparse random graphs. Suitable as a resource for researchers and PhD-level courses, it uses examples of real-world networks, such as the Internet and citation networks, as motivation for the models that are discussed, and includes exercises at the end of each chapter to develop intuition. The book closes with an extensive discussion of related models and problems that demonstratemodern approaches to network theory, such as community structure and directed models |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 08 Feb 2024) |
| Beschreibung: | 1 online resource (xvi, 489 pages) digital, PDF file(s) |
| ISBN: | 9781316795552 |
| DOI: | 10.1017/9781316795552 |
Internformat
MARC
| LEADER | 00000nam a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV049728922 | ||
| 003 | DE-604 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 240604s2024 xx |||| o|||| 00||| eng d | ||
| 020 | |a 9781316795552 |c Online |9 978-1-316-79555-2 | ||
| 024 | 7 | |a 10.1017/9781316795552 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9781316795552 | ||
| 035 | |a (OCoLC)1425944633 | ||
| 035 | |a (DE-599)BVBBV049728922 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 |a DE-634 | ||
| 082 | 0 | |a 511/.5 | |
| 100 | 1 | |a Hofstad, Remco van der |d 1971- |0 (DE-588)17313677X |4 aut | |
| 245 | 1 | 0 | |a Random graphs and complex networks, Volume 2 |c Remco van der Hofstad |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2024 | |
| 300 | |a 1 online resource (xvi, 489 pages) |b digital, PDF file(s) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Cambridge series on statistical and probabilistic mathematics |v 54 | |
| 500 | |a Title from publisher's bibliographic system (viewed on 08 Feb 2024) | ||
| 520 | |a Complex networks are key to describing the connected nature of the society that we live in. This book, the second of two volumes, describes the local structure of random graph models for real-world networks and determines when these models have a giant component and when they are small-, and ultra-small, worlds. This is the first book to cover the theory and implications of local convergence, a crucial technique in the analysis of sparse random graphs. Suitable as a resource for researchers and PhD-level courses, it uses examples of real-world networks, such as the Internet and citation networks, as motivation for the models that are discussed, and includes exercises at the end of each chapter to develop intuition. The book closes with an extensive discussion of related models and problems that demonstratemodern approaches to network theory, such as community structure and directed models | ||
| 650 | 4 | |a Random graphs | |
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexes System |0 (DE-588)4114261-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Netzwerk |g Graphentheorie |0 (DE-588)4705155-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Zufallsgraph |0 (DE-588)4277661-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Zufallsgraph |0 (DE-588)4277661-2 |D s |
| 689 | 0 | 1 | |a Komplexes System |0 (DE-588)4114261-5 |D s |
| 689 | 0 | 2 | |a Netzwerk |g Graphentheorie |0 (DE-588)4705155-3 |D s |
| 689 | 0 | 3 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Hardback |z 978-1-107-17400-9 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Paperback |z 978-1-316-62632-0 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/9781316795552 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-035071162 | |
| 966 | e | |u https://doi.org/10.1017/9781316795552 |l DE-12 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781316795552 |l DE-634 |p ZDB-20-CBO |q BTU_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781316795552 |l DE-92 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1817704718179237888 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Hofstad, Remco van der 1971- |
| author_GND | (DE-588)17313677X |
| author_facet | Hofstad, Remco van der 1971- |
| author_role | aut |
| author_sort | Hofstad, Remco van der 1971- |
| author_variant | r v d h rvd rvdh |
| building | Verbundindex |
| bvnumber | BV049728922 |
| collection | ZDB-20-CBO |
| ctrlnum | (ZDB-20-CBO)CR9781316795552 (OCoLC)1425944633 (DE-599)BVBBV049728922 |
| dewey-full | 511/.5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511/.5 |
| dewey-search | 511/.5 |
| dewey-sort | 3511 15 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1017/9781316795552 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000zcb4500</leader><controlfield tag="001">BV049728922</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">240604s2024 xx |||| o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781316795552</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-316-79555-2</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/9781316795552</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9781316795552</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1425944633</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV049728922</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-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.5</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hofstad, Remco van der</subfield><subfield code="d">1971-</subfield><subfield code="0">(DE-588)17313677X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Random graphs and complex networks, Volume 2</subfield><subfield code="c">Remco van der Hofstad</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2024</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xvi, 489 pages)</subfield><subfield code="b">digital, PDF file(s)</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">Cambridge series on statistical and probabilistic mathematics</subfield><subfield code="v">54</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 08 Feb 2024)</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Complex networks are key to describing the connected nature of the society that we live in. This book, the second of two volumes, describes the local structure of random graph models for real-world networks and determines when these models have a giant component and when they are small-, and ultra-small, worlds. This is the first book to cover the theory and implications of local convergence, a crucial technique in the analysis of sparse random graphs. Suitable as a resource for researchers and PhD-level courses, it uses examples of real-world networks, such as the Internet and citation networks, as motivation for the models that are discussed, and includes exercises at the end of each chapter to develop intuition. The book closes with an extensive discussion of related models and problems that demonstratemodern approaches to network theory, such as community structure and directed models</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Random graphs</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexes System</subfield><subfield code="0">(DE-588)4114261-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzwerk</subfield><subfield code="g">Graphentheorie</subfield><subfield code="0">(DE-588)4705155-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Zufallsgraph</subfield><subfield code="0">(DE-588)4277661-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Zufallsgraph</subfield><subfield code="0">(DE-588)4277661-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Komplexes System</subfield><subfield code="0">(DE-588)4114261-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Netzwerk</subfield><subfield code="g">Graphentheorie</subfield><subfield code="0">(DE-588)4705155-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" 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, Hardback</subfield><subfield code="z">978-1-107-17400-9</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe, Paperback</subfield><subfield code="z">978-1-316-62632-0</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/9781316795552</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="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-035071162</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781316795552</subfield><subfield code="l">DE-12</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/9781316795552</subfield><subfield code="l">DE-634</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BTU_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/9781316795552</subfield><subfield code="l">DE-92</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.BV049728922 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-06T15:18:24Z |
| institution | BVB |
| isbn | 9781316795552 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-035071162 |
| oclc_num | 1425944633 |
| open_access_boolean | |
| owner | DE-12 DE-92 DE-634 |
| owner_facet | DE-12 DE-92 DE-634 |
| physical | 1 online resource (xvi, 489 pages) digital, PDF file(s) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO BTU_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
| publishDate | 2024 |
| publishDateSearch | 2024 |
| publishDateSort | 2024 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Cambridge series on statistical and probabilistic mathematics |
| spelling | Hofstad, Remco van der 1971- (DE-588)17313677X aut Random graphs and complex networks, Volume 2 Remco van der Hofstad Cambridge Cambridge University Press 2024 1 online resource (xvi, 489 pages) digital, PDF file(s) txt rdacontent c rdamedia cr rdacarrier Cambridge series on statistical and probabilistic mathematics 54 Title from publisher's bibliographic system (viewed on 08 Feb 2024) Complex networks are key to describing the connected nature of the society that we live in. This book, the second of two volumes, describes the local structure of random graph models for real-world networks and determines when these models have a giant component and when they are small-, and ultra-small, worlds. This is the first book to cover the theory and implications of local convergence, a crucial technique in the analysis of sparse random graphs. Suitable as a resource for researchers and PhD-level courses, it uses examples of real-world networks, such as the Internet and citation networks, as motivation for the models that are discussed, and includes exercises at the end of each chapter to develop intuition. The book closes with an extensive discussion of related models and problems that demonstratemodern approaches to network theory, such as community structure and directed models Random graphs Graphentheorie (DE-588)4113782-6 gnd rswk-swf Komplexes System (DE-588)4114261-5 gnd rswk-swf Netzwerk Graphentheorie (DE-588)4705155-3 gnd rswk-swf Zufallsgraph (DE-588)4277661-2 gnd rswk-swf Zufallsgraph (DE-588)4277661-2 s Komplexes System (DE-588)4114261-5 s Netzwerk Graphentheorie (DE-588)4705155-3 s Graphentheorie (DE-588)4113782-6 s DE-604 Erscheint auch als Druck-Ausgabe, Hardback 978-1-107-17400-9 Erscheint auch als Druck-Ausgabe, Paperback 978-1-316-62632-0 https://doi.org/10.1017/9781316795552 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Hofstad, Remco van der 1971- Random graphs and complex networks, Volume 2 Random graphs Graphentheorie (DE-588)4113782-6 gnd Komplexes System (DE-588)4114261-5 gnd Netzwerk Graphentheorie (DE-588)4705155-3 gnd Zufallsgraph (DE-588)4277661-2 gnd |
| subject_GND | (DE-588)4113782-6 (DE-588)4114261-5 (DE-588)4705155-3 (DE-588)4277661-2 |
| title | Random graphs and complex networks, Volume 2 |
| title_auth | Random graphs and complex networks, Volume 2 |
| title_exact_search | Random graphs and complex networks, Volume 2 |
| title_full | Random graphs and complex networks, Volume 2 Remco van der Hofstad |
| title_fullStr | Random graphs and complex networks, Volume 2 Remco van der Hofstad |
| title_full_unstemmed | Random graphs and complex networks, Volume 2 Remco van der Hofstad |
| title_short | Random graphs and complex networks, Volume 2 |
| title_sort | random graphs and complex networks volume 2 |
| topic | Random graphs Graphentheorie (DE-588)4113782-6 gnd Komplexes System (DE-588)4114261-5 gnd Netzwerk Graphentheorie (DE-588)4705155-3 gnd Zufallsgraph (DE-588)4277661-2 gnd |
| topic_facet | Random graphs Graphentheorie Komplexes System Netzwerk Graphentheorie Zufallsgraph |
| url | https://doi.org/10.1017/9781316795552 |
| work_keys_str_mv | AT hofstadremcovander randomgraphsandcomplexnetworksvolume2 |