000			03102nam a22003017a 4500
999			_c58632 _d58632
005			20211130124814.0
008			211130b ||||| |||| 00| 0 eng d
020			_a9781470438364
028			_a:Variety Books Publishers & Distributors _b:B-10 Street No 2 West Vinod Nagar Delhi 110092 _c:IM2893 _d:25/11/2021
082			_a511.5 LOV
100			_aLovasz, Laszlo
245			_aLarge Networks and Graph Limits _c/ Laszlo Lovasz
260			_aNew Delhi _b:University Press _c2017
300			_axiv, 475 pages : illustrations _c ; 26 cm
365			_b1510
490			_aColloquium publications (American Mathematical Society), v. 60.
505			_a Large graphs: an informal introduction -- Large graphs in mathematics and physics -- Notation and terminology -- Graph parameters and connection matrices -- Graph homomorphisms -- Graph algebras and homomorphism functions -- Kernels and graphons -- The cut distance -- Szemerédi partitions -- Sampling --Convergence of dense graph sequences -- Convergence from the right -- On the structure of graphons -- The space of graphons -- Algorithms for large graphs and graphons -- Extremal theory of dense graphs -- Multigraphs and decorated graphs -- Graphings -- Convergence of bounded degree graphs --Right convergence of bounded degree graphs -- On the structure of graphings -- Algorithms for bounded degree graphs -- Other combinatorial structures.
520			_a"Recently, 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). This book explains many of these connections, first at an informal level to emphasize the need to apply more advanced mathematical methods, and then gives an exact development of the algebraic theory of graph homomorphisms and of the analytic theory of graph limits."--Publisher description
650			_aMathematics
650			_aGeneral principles of mathematics
650			_aGraph theory.
650			_aCombinatorics -- Graph theory -- None of the above, but in this section.
650			_aCombinatorics -- Graph theory -- Extremal problems.
650			_aCombinatorics -- Graph theory -- Random graphs.
650			_aCombinatorics -- Graph theory -- Small world graphs, complex networks.
700			_aLovasz, Laszlo
942			_cMDL