000			01694nam a2200181 4500
999			_c54210 _d54210
008			191027b2010 ||||| |||| 00| 0 eng d
020			_a9781470438364
082			_a511.5 LOV-L
100			_aLovasz, Laszio
245			_aLarge networks and graph limits / _cLaszlo Lovasz
260			_aRhode Island _bAmerican Mathematical Society _c2012
300			_a475 p.
365			_aINR _b1360.00.
440			_aAmerican Mathematical Society _vVolume 60.
500			_aRecently, 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 connection 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 connection with other parts of Mathematics (classical and non-classical, like probability theory, measure theory, tensor Algebra, and semidefinite optimization). This book explains many of these connections, first at an informal level to emphasise 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.
650			_aAlgebra, Abstract
650			_aGraph theory