Networks are everywhere: networks of friends, transportation networks and the Web. Neurons in our brains and proteins within our bodies form networks that determine our intelligence and survival. This modern, accessible textbook introduces the basics of network science for a wide range of job sectors from management to marketing, from biology to engineering, and from neuroscience to the social sciences. Students will develop important, practical skills and learn to write code for using networks in their areas of interest - even as they are just learning to program with Python. Extensive sets of tutorials and homework problems provide plenty of hands-on practice and longer programming tutorials online further enhance students' programming skills. This intuitive and direct approach makes the book ideal for a first course, aimed at a wide audience without a strong background in mathematics or computing but with a desire to learn the fundamentals and applications of network science.

The study of network theory is a highly interdisciplinary field, which has emerged as a major topic of interest in various disciplines ranging from physics and mathematics, to biology and sociology. This book promotes the diverse nature of the study of complex networks by balancing the needs of students from very different backgrounds. It references the most commonly used concepts in network theory, provides examples of their applications in solving practical problems, and clear indications on how to analyse their results. In the first part of the book, students and researchers will discover the quantitative and analytical tools necessary to work with complex networks, including the most basic concepts in network and graph theory, linear and matrix algebra, as well as the physical concepts most frequently used for studying networks. They will also find instruction on some key skills such as how to proof analytic results and how to manipulate empirical network data. The bulk of the text is focused on instructing readers on the most useful tools for modern practitioners of network theory. These include degree distributions, random networks, network fragments, centrality measures, clusters and communities, communicability, and local and global properties of networks. The combination of theory, example and method that are presented in this text, should ready the student to conduct their own analysis of networks with confidence and allow teachers to select appropriate examples and problems to teach this subject in the classroom.

Written by two prominent figures in the field, this comprehensive text provides a remarkably student-friendly approach. Its sound yet accessible treatment emphasizes the history of graph theory and offers unique examples and lucid proofs. 2004 edition.

This book provides an up-to-date introduction to information theory. In addition to the classical topics discussed, it provides the first comprehensive treatment of the theory of I-Measure, network coding theory, Shannon and non-Shannon type information inequalities, and a relation between entropy and group theory. ITIP, a software package for proving information inequalities, is also included. With a large number of examples, illustrations, and original problems, this book is excellent as a textbook or reference book for a senior or graduate level course on the subject, as well as a reference for researchers in related fields.

Illustrated throughout in full colour, this pioneering text is the only book you need for an introduction to network science.

A comprehensive look at the emerging science of networks Network science helps you design faster, more resilient communication networks; revise infrastructure systems such as electrical power grids, telecommunications networks, and airline routes; model market dynamics; understand synchronization in biological systems; and analyze social interactions among people. This is the first book to take a comprehensive look at this emerging science. It examines the various kinds of networks (regular, random, small-world, influence, scale-free, and social) and applies network processes and behaviors to emergence, epidemics, synchrony, and risk. The book's uniqueness lies in its integration of concepts across computer science, biology, physics, social network analysis, economics, and marketing. The book is divided into easy-to-understand topical chapters and the presentation is augmented with clear illustrations, problems and answers, examples, applications, tutorials, and a discussion of related Java software. Chapters cover: Origins Graphs Regular Networks Random Networks Small-World Networks Scale-Free Networks Emergence Epidemics Synchrony Influence Networks Vulnerability Net Gain Biology This book offers a new understanding and interpretation of the field of network science. It is an indispensable resource for researchers, professionals, and technicians in engineering, computing, and biology. It also serves as a valuable textbook for advanced undergraduate and graduate courses in related fields of study.

String theory made understandable. Barton Zwiebach is once again faithful to his goal of making string theory accessible to undergraduates. He presents the main concepts of string theory in a concrete and physical way to develop intuition before formalism, often through simplified and illustrative examples. Complete and thorough in its coverage, this new edition now includes AdS/CFT correspondence and introduces superstrings. It is perfectly suited to introductory courses in string theory for students with a background in mathematics and physics. New sections cover strings on orbifolds, cosmic strings, moduli stabilization, and the string theory landscape. Now with almost 300 problems and exercises, with password-protected solutions for instructors at www.cambridge.org/zwiebach.

This book offers an excellent and practically oriented introduction to the basic concepts of modern circuit theory. It builds a thorough and rigorous understanding of the analysis techniques of electric networks, and also explains the essential procedures involved in the synthesis of passive networks. Written specifically to meet the needs of undergraduate students of electrical and electronics engineering, electronics and communication engineering, instru-mentation and control engineering, and computer science and engineering, the book provides modularized coverage of the full spectrum of network theory suitable for a one-semester course. A balanced emphasis on conceptual understanding and problem-solving helps students master the basic principles and properties that govern circuit behaviour. A large number of solved examples show students the step-by-step processes for applying the techniques presented in the text. A variety of exercises with answers at the chapter ends allow students to practice the solution methods. Besides students pursuing courses in engineering, the book is also suitable for self-study by those preparing for AMIE and competitive examinations. An objective-type question bank at the end of book is designed to see how well the students have mastered the material presented in the text.

This book aims to explain the basics of graph theory that are needed at an introductory level for students in computer or information sciences. To motivate students and to show that even these basic notions can be extremely useful, the book also aims to provide an introduction to the modern field of network science. Mathematics is often unnecessarily difficult for students, at times even intimidating. For this reason, explicit attention is paid in the first chapters to mathematical notations and proof techniques, emphasizing that the notations form the biggest obstacle, not the mathematical concepts themselves. This approach allows to gradually prepare students for using tools that are necessary to put graph theory to work: complex networks. In the second part of the book the student learns about random networks, small worlds, the structure of the Internet and the Web, peer-to-peer systems, and social networks. Again, everything is discussed at an elementary level, but such that in the end students indeed have the feeling that they: 1.Have learned how to read and understand the basic mathematics related to graph theory. 2.Understand how basic graph theory can be applied to optimization problems such as routing in communication networks. 3.Know a bit more about this sometimes mystical field of small worlds and random networks. There is an accompanying web site www.distributed-systems.net/gtcn from where supplementary material can be obtained, including exercises, Mathematica notebooks, data for analyzing graphs, and generators for various complex networks.