This book presents interdisciplinary, cutting-edge and creative applications of graph theory and modeling in science, technology, architecture and art. Topics are divided into three parts: the first one examines mechanical problems related to gears, planetary gears and engineering installations; the second one explores graph-based methods applied to medical analyses as well as biological and chemical modeling; and the third part includes various topics e.g. drama analysis, aiding of design activities and network visualisation. The authors represent several countries in Europe and America, and their contributions show how different, useful and fruitful the utilization of graphs in modelling of engineering systems can be. The book has been designed to serve readers interested in the subject of graph modelling and those with expertise in related areas, as well as members of the worldwide community of graph modelers.

This book contains contributions presented at the 12th International Conference on Complex Networks (CompleNet), 24-26 May 2021. CompleNet is an international conference on complex networks that brings together researchers and practitioners from diverse disciplines-from sociology, biology, physics, and computer science-who share a passion to better understand the interdependencies within and across systems. CompleNet is a venue to discuss ideas and findings about all types networks, from biological, to technological, to informational and social. It is this interdisciplinary nature of complex networks that CompleNet aims to explore and celebrate.

Gian-Carlo Rota was one of the most original and colourful mathematicians of the 20th century. His work on the foundations of combinatorics focused on the algebraic structures that lie behind diverse combinatorial areas, and created a new area of algebraic combinatorics. Written by two of his former students, this book is based on notes from his influential graduate courses and on face-to-face discussions. Topics include sets and valuations, partially ordered sets, distributive lattices, partitions and entropy, matching theory, free matrices, doubly stochastic matrices, Moebius functions, chains and antichains, Sperner theory, commuting equivalence relations and linear lattices, modular and geometric lattices, valuation rings, generating functions, umbral calculus, symmetric functions, Baxter algebras, unimodality of sequences, and location of zeros of polynomials. Many exercises and research problems are included, and unexplored areas of possible research are discussed. A must-have for all students and researchers in combinatorics and related areas.

Gian-Carlo Rota was one of the most original and colourful mathematicians of the 20th century. His work on the foundations of combinatorics focused on the algebraic structures that lie behind diverse combinatorial areas, and created a new area of algebraic combinatorics. Written by two of his former students, this book is based on notes from his influential graduate courses and on face-to-face discussions. Topics include sets and valuations, partially ordered sets, distributive lattices, partitions and entropy, matching theory, free matrices, doubly stochastic matrices, Moebius functions, chains and antichains, Sperner theory, commuting equivalence relations and linear lattices, modular and geometric lattices, valuation rings, generating functions, umbral calculus, symmetric functions, Baxter algebras, unimodality of sequences, and location of zeros of polynomials. Many exercises and research problems are included, and unexplored areas of possible research are discussed. A must-have for all students and researchers in combinatorics and related areas.

Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. The theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology, and information theory. With a careful combination of symbolic enumeration methods and complex analysis, drawing heavily on generating functions, results of sweeping generality emerge that can be applied in particular to fundamental structures such as permutations, sequences, strings, walks, paths, trees, graphs and maps. This account is the definitive treatment of the topic. The authors give full coverage of the underlying mathematics and a thorough treatment of both classical and modern applications of the theory. The text is complemented with exercises, examples, appendices and notes to aid understanding. The book can be used for an advanced undergraduate or a graduate course, or for self-study.

This much-needed new book is the first to specifically detail free Lie algebras. Lie polynomials appeared at the turn of the century and were identified with the free Lie algebra by Magnus and Witt some thirty years later. Many recent, important developments have occurred in the field--especially from the point of view of representation theory--that have necessitated a thorough treatment of the subject. This timely book covers all aspects of the field, including characterization of Lie polynomials and Lie series, subalgebras and automorphisms, canonical projections, Hall bases, shuffles and subwords, circular words, Lie representations of the symmetric group, related symmetric functions, descent algebra, and quasisymmetric functions. With its emphasis on the algebraic and combinatorial point of view as well as representation theory, this book will be welcomed by students and researchers in mathematics and theoretical computer science.

Algorithmic Aspects of Graph Connectivity is the first comprehensive book on this central notion in graph and network theory, emphasizing its algorithmic aspects. Because of its wide applications in the fields of communication, transportation, and production, graph connectivity has made tremendous algorithmic progress under the influence of the theory of complexity and algorithms in modern computer science. The book contains various definitions of connectivity, including edge-connectivity and vertex-connectivity, and their ramifications, as well as related topics such as flows and cuts. The authors comprehensively discuss new concepts and algorithms that allow for quicker and more efficient computing, such as maximum adjacency ordering of vertices. Covering both basic definitions and advanced topics, this book can be used as a textbook in graduate courses in mathematical sciences, such as discrete mathematics, combinatorics, and operations research, and as a reference book for specialists in discrete mathematics and its applications.

The Nature of Complex Networks provides a systematic introduction to the statistical mechanics of complex networks and the different theoretical achievements in the field that are now finding strands in common. The book presents a wide range of networks and the processes taking place on them, including recently developed directions, methods, and techniques. It assumes a statistical mechanics view of random networks based on the concept of statistical ensembles but also features the approaches and methods of modern random graph theory and their overlaps with statistical physics. This book will appeal to graduate students and researchers in the fields of statistical physics, complex systems, graph theory, applied mathematics, and theoretical epidemiology.

In the two-volume set 'A Selection of Highlights' we present basics of mathematics in an exciting and pedagogically sound way. This volume examines many fundamental results in Geometry and Discrete Mathematics along with their proofs and their history. In the second edition we include a new chapter on Topological Data Analysis and enhanced the chapter on Graph Theory for solving further classical problems such as the Traveling Salesman Problem.

This book collects original peer-reviewed contributions to the conferences organised by the international research network "Minimal surfaces: Integrable Systems and Visualization" financed by the Leverhulme Trust. The conferences took place in Cork, Granada, Munich and Leicester between 2016 and 2019. Within the theme of the network, the presented articles cover a broad range of topics and explore exciting links between problems related to the mean curvature of surfaces in homogeneous 3-manifolds, like minimal surfaces, CMC surfaces and mean curvature flows, integrable systems and visualisation. Combining research and overview articles by prominent international researchers, the book offers a valuable resource for both researchers and students who are interested in this research area.

This book illustrates how modern mathematical wavelet transform techniques offer fresh insights into the complex behavior of neural systems at different levels: from the microscopic dynamics of individual cells to the macroscopic behavior of large neural networks. It also demonstrates how and where wavelet-based mathematical tools can provide an advantage over classical approaches used in neuroscience. The authors well describe single neuron and populational neural recordings. This 2nd edition discusses novel areas and significant advances resulting from experimental techniques and computational approaches developed since 2015, and includes three new topics: * Detection of fEPSPs in multielectrode LFPs recordings. * Analysis of Visual Sensory Processing in the Brain and BCI for Human Attention Control; * Analysis and Real-time Classification of Motor-related EEG Patterns; The book is a valuable resource for neurophysiologists and physicists familiar with nonlinear dynamical systems and data processing, as well as for graduate students specializing in these and related areas.

Simulating for a crisis is far more than creating a simulation of a crisis situation. In order for a simulation to be useful during a crisis, it should be created within the space of a few days to allow decision makers to use it as quickly as possible. Furthermore, during a crisis the aim is not to optimize just one factor, but to balance various, interdependent aspects of life. In the COVID-19 crisis, decisions had to be made concerning e.g. whether to close schools and restaurants, and the (economic) consequences of a 3 or 4-week lock-down had to be considered. As such, rather than one simulation focusing on a very limited aspect, a framework allowing the simulation of several different scenarios focusing on different aspects of the crisis was required. Moreover, the results of the simulations needed to be easily understandable and explainable: if a simulation indicates that closing schools has no effect, this can only be used if the decision makers can explain why this is the case. This book describes how a simulation framework was created for the COVID-19 crisis, and demonstrates how it was used to simulate a wide range of scenarios that were relevant for decision makers at the time. It also discusses the usefulness of the approach, and explains the decisions that had to be made along the way as well as the trade-offs. Lastly, the book examines the lessons learned and the directions for the further development of social simulation frameworks to make them better suited to crisis situations, and to foster a more resilient society.

Oriented matroids play the role of matrices in discrete geometry, when metrical properties, such as angles or distances, are neither required nor available. Thus they are of great use in such areas as graph theory, combinatorial optimization and convex geometry. The variety of applications corresponds to the variety of ways they can be defined. Each of these definitions corresponds to a differing data structure for an oriented matroid, and handling them requires computational support, best realised through a functional language. Haskell is used here, and, for the benefit of readers, the book includes a primer on it. The combination of concrete applications and computation, the profusion of illustrations, many in colour, and the large number of examples and exercises make this an ideal introductory text on the subject. It will also be valuable for self-study for mathematicians and computer scientists working in discrete and computational geometry.

This book highlights new and original contributions on Graph Theory and Combinatorial Optimization both from the theoretical point of view and from applications in all fields. The book chapters describe models and methods based on graphs, structural properties, discrete optimization, network optimization, mixed-integer programming, heuristics, meta-heuristics, math-heuristics, and exact methods as well as applications. The book collects selected contributions from the CTW2020 international conference (18th Cologne-Twente Workshop on Graphs and Combinatorial Optimization), held online on September 14-16, 2020. The conference was organized by IASI-CNR with the contribution of University of Roma Tre, University Roma Tor Vergata, and CNRS-LIX and with the support of AIRO. It is addressed to researchers, PhD students, and practitioners in the fields of Graph Theory, Discrete Mathematics, Combinatorial Optimization, and Operations Research.

This textbook, suitable for an early undergraduate up to a graduate course, provides an overview of many basic principles and techniques needed for modern data analysis. In particular, this book was designed and written as preparation for students planning to take rigorous Machine Learning and Data Mining courses. It introduces key conceptual tools necessary for data analysis, including concentration of measure and PAC bounds, cross validation, gradient descent, and principal component analysis. It also surveys basic techniques in supervised (regression and classification) and unsupervised learning (dimensionality reduction and clustering) through an accessible, simplified presentation. Students are recommended to have some background in calculus, probability, and linear algebra. Some familiarity with programming and algorithms is useful to understand advanced topics on computational techniques.

This book A Guide to Graph Algorithms offers high-quality content in the research area of graph algorithms and explores the latest developments in graph algorithmics. The reader will gain a comprehensive understanding of how to use algorithms to explore graphs. It is a collection of texts that have proved to be trend setters and good examples of that. The book aims at providing the reader with a deep understanding of the structural properties of graphs that are useful for the design of efficient algorithms. These algorithms have applications in finite state machine modelling, social network theory, biology, and mathematics. The book contains many exercises, some up at present-day research-level. The exercises encourage the reader to discover new techniques by putting things in a clear perspective. A study of this book will provide the reader with many powerful tools to model and tackle problems in real-world scenarios.

A series of important applications of combinatorics on words has emerged with the development of computerized text and string processing. The aim of this volume, the third in a trilogy, is to present a unified treatment of some of the major fields of applications. After an introduction that sets the scene and gathers together the basic facts, there follow chapters in which applications are considered in detail. The areas covered include core algorithms for text processing, natural language processing, speech processing, bioinformatics, and areas of applied mathematics such as combinatorial enumeration and fractal analysis. No special prerequisites are needed, and no familiarity with the application areas or with the material covered by the previous volumes is required. The breadth of application, combined with the inclusion of problems and algorithms and a complete bibliography will make this book ideal for graduate students and professionals in mathematics, computer science, biology and linguistics.

This brief investigates the asymptotic behavior of some PDEs on networks. The structures considered consist of finitely interconnected flexible elements such as strings and beams (or combinations thereof), distributed along a planar network. Such study is motivated by the need for engineers to eliminate vibrations in some dynamical structures consisting of elastic bodies, coupled in the form of chain or graph such as pipelines and bridges. There are other complicated examples in the automotive industry, aircraft and space vehicles, containing rather than strings and beams, plates and shells. These multi-body structures are often complicated, and the mathematical models describing their evolution are quite complex. For the sake of simplicity, this volume considers only 1-d networks.

Honesty in voting, it turns out, is not always the best policy. Indeed, in the early 1970s, Allan Gibbard and Mark Satterthwaite, building on the seminal work of Nobel laureate Kenneth Arrow, proved that with three or more alternatives there is no reasonable voting system that is non-manipulable; voters will always have an opportunity to benefit by submitting a disingenuous ballot. The ensuing decades produced a number of theorems of striking mathematical naturality that dealt with the manipulability of voting systems. This 2005 book presents many of these results from the last quarter of the twentieth century, especially the contributions of economists and philosophers, from a mathematical point of view, with many new proofs. The presentation is almost completely self-contained, and requires no prerequisites except a willingness to follow rigorous mathematical arguments. Mathematics students, as well as mathematicians, political scientists, economists and philosophers will learn why it is impossible to devise a completely unmanipulable voting system.

This book highlights cutting-edge research in the field of network science, offering scientists, researchers, students and practitioners a unique update on the latest advances in theory and a multitude of applications. It presents the peer-reviewed proceedings of the IX International Conference on Complex Networks and their Applications (COMPLEX NETWORKS 2020). The carefully selected papers cover a wide range of theoretical topics such as network models and measures; community structure, network dynamics; diffusion, epidemics and spreading processes; resilience and control as well as all the main network applications, including social and political networks; networks in finance and economics; biological and neuroscience networks and technological networks.

This book highlights cutting-edge research in the field of network science, offering scientists, researchers, students and practitioners a unique update on the latest advances in theory and a multitude of applications. It presents the peer-reviewed proceedings of the IX International Conference on Complex Networks and their Applications (COMPLEX NETWORKS 2020). The carefully selected papers cover a wide range of theoretical topics such as network models and measures; community structure, network dynamics; diffusion, epidemics and spreading processes; resilience and control as well as all the main network applications, including social and political networks; networks in finance and economics; biological and neuroscience networks and technological networks.

The rapidly expanding area of algebraic graph theory uses two different branches of algebra to explore various aspects of graph theory: linear algebra (for spectral theory) and group theory (for studying graph symmetry). These areas have links with other areas of mathematics, such as logic and harmonic analysis, and are increasingly being used in such areas as computer networks where symmetry is an important feature. Other books cover portions of this material, but this book is unusual in covering both of these aspects and there are no other books with such a wide scope. Peter J. Cameron, internationally recognized for his substantial contributions to the area, served as academic consultant for this volume, and the result is ten expository chapters written by acknowledged international experts in the field. Their well-written contributions have been carefully edited to enhance readability and to standardize the chapter structure, terminology and notation throughout the book. To help the reader, there is an extensive introductory chapter that covers the basic background material in graph theory, linear algebra and group theory. Each chapter concludes with an extensive list of references.

Mahler measure, a height function for polynomials, is the central theme of this book. It has many interesting properties, obtained by algebraic, analytic and combinatorial methods. It is the subject of several longstanding unsolved questions, such as Lehmer's Problem (1933) and Boyd's Conjecture (1981). This book contains a wide range of results on Mahler measure. Some of the results are very recent, such as Dimitrov's proof of the Schinzel-Zassenhaus Conjecture. Other known results are included with new, streamlined proofs. Robinson's Conjectures (1965) for cyclotomic integers, and their associated Cassels height function, are also discussed, for the first time in a book.One way to study algebraic integers is to associate them with combinatorial objects, such as integer matrices. In some of these combinatorial settings the analogues of several notorious open problems have been solved, and the book sets out this recent work. Many Mahler measure results are proved for restricted sets of polynomials, such as for totally real polynomials, and reciprocal polynomials of integer symmetric as well as symmetrizable matrices. For reference, the book includes appendices providing necessary background from algebraic number theory, graph theory, and other prerequisites, along with tables of one- and two-variable integer polynomials with small Mahler measure. All theorems are well motivated and presented in an accessible way. Numerous exercises at various levels are given, including some for computer programming. A wide range of stimulating open problems is also included. At the end of each chapter there is a glossary of newly introduced concepts and definitions. Around the Unit Circle is written in a friendly, lucid, enjoyable style, without sacrificing mathematical rigour. It is intended for lecture courses at the graduate level, and will also be a valuable reference for researchers interested in Mahler measure. Essentially self-contained, this textbook should also be accessible to well-prepared upper-level undergraduates.

This book presents a printed testimony for the fact that George Andrews, one of the world's leading experts in partitions and q-series for the last several decades, has passed the milestone age of 80. To honor George Andrews on this occasion, the conference "Combinatory Analysis 2018" was organized at the Pennsylvania State University from June 21 to 24, 2018. This volume comprises the original articles from the Special Issue "Combinatory Analysis 2018 - In Honor of George Andrews' 80th Birthday" resulting from the conference and published in Annals of Combinatorics. In addition to the 37 articles of the Andrews 80 Special Issue, the book includes two new papers. These research contributions explore new grounds and present new achievements, research trends, and problems in the area. The volume is complemented by three special personal contributions: "The Worlds of George Andrews, a daughter's take" by Amy Alznauer, "My association and collaboration with George Andrews" by Krishna Alladi, and "Ramanujan, his Lost Notebook, its importance" by Bruce Berndt. Another aspect which gives this Andrews volume a truly unique character is the "Photos" collection. In addition to pictures taken at "Combinatory Analysis 2018", the editors selected a variety of photos, many of them not available elsewhere: "Andrews in Austria", "Andrews in China", "Andrews in Florida", "Andrews in Illinois", and "Andrews in India". This volume will be of interest to researchers, PhD students, and interested practitioners working in the area of Combinatory Analysis, q-Series, and related fields.

Rosemary Bailey covers in this study the mathematics of association schemes--an area lying between pure mathematics and statistics that relates to the optimal design of scientific experiments. The book is accessible to mathematicians as well as statisticians. Arising from a graduate course taught by the author, it appeals to students as well as researchers as a valuable reference work from which to learn about the statistical/combinatorial aspects of their work.