Large networks and graph limits (Record no. 1685)

000 -LEADER
fixed length control field 02538nam a2200205Ia 4500
003 - CONTROL NUMBER IDENTIFIER
control field OSt
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240826124806.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 180205s9999 xx 000 0 und d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781470438364
040 ## - CATALOGING SOURCE
Original cataloging agency ICTS-TIFR
050 ## - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA166
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Lovasz, Laszlo
245 ## - TITLE STATEMENT
Title Large networks and graph limits
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Name of publisher, distributor, etc. AMS,
Date of publication, distribution, etc. [c2012]
Place of publication, distribution, etc. Rhode Island:
300 ## - Physical Description
Pages: 475 p.
505 ## - FORMATTED CONTENTS NOTE
Formatted contents note Part 1. Large graphs: An informal introduction<br/>Chapter 1. Very large networks<br/>Chapter 2. Large graphs in mathematics and physics<br/><br/>Part 2. The algebra of graph homomorphisms<br/>Chapter 3. Notation and terminology<br/>Chapter 4. Graph parameters and connection matrices<br/>Chapter 5. Graph homomorphisms<br/>Chapter 6. Graph algebras and homomorphism functions<br/><br/>Part 3. Limits of dense graph sequences<br/>Chapter 7. Kernels and graphons<br/>Chapter 8. The cut distance<br/>Chapter 9. Szemerédi partitions<br/>Chapter 10. Sampling<br/>Chapter 11. Convergence of dense graph sequences<br/>Chapter 12. Convergence from the right<br/>Chapter 13. On the structure of graphons<br/>Chapter 14. The space of graphons<br/>Chapter 15. Algorithms for large graphs and graphons<br/>Chapter 16. Extremal theory of dense graphs<br/>Chapter 17. Multigraphs and decorated graphs<br/><br/>Part 4. Limits of bounded degree graphs<br/>Chapter 18. Graphings<br/>Chapter 19. Convergence of bounded degree graphs<br/>Chapter 20. Right convergence of bounded degree graphs<br/>Chapter 21. On the structure of graphings<br/>Chapter 22. Algorithms for bounded degree graphs<br/><br/>Part 5. Extensions: A brief survey<br/>Chapter 23. Other combinatorial structures<br/>
520 ## - SUMMARY, ETC.
Summary, etc. It became apparent that a large number of the most interesting structures and phenomena of the world can be described by networks. Developing a mathematical theory of very large networks is an important challenge. This book describes one recent approach to this theory, the limit theory of graphs, which has emerged over the last decade. The theory has rich connections with other approaches to the study of large networks, such as “property testing” in computer science and regularity partition in graph theory. It has several applications in extremal graph theory, including the exact formulations and partial answers to very general questions, such as which problems in extremal graph theory are decidable. It also has less obvious connections with other parts of mathematics (classical and non-classical, like probability theory, measure theory, tensor algebras, and semidefinite optimization).
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Mathematics
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Koha item type Book
Holdings
Withdrawn status Lost status Damaged status Not for loan Collection code Home library Shelving location Date acquired Full call number Accession No. Koha item type
          ICTS Rack No 4 01/18/2018 QA166 00948 Book