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 XI International Conference on Complex Networks and their Applications (COMPLEX NETWORKS 2022). 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 provides the basis of a formal language and explores its possibilities in the characterization of multiplex networks. Armed with the formalism developed, the authors define structural metrics for multiplex networks. A methodology to generalize monoplex structural metrics to multiplex networks is also presented so that the reader will be able to generalize other metrics of interest in a systematic way. Therefore, this book will serve as a guide for the theoretical development of new multiplex metrics. Furthermore, this Brief describes the spectral properties of these networks in relation to concepts from algebraic graph theory and the theory of matrix polynomials. The text is rounded off by analyzing the different structural transitions present in multiplex systems as well as by a brief overview of some representative dynamical processes. Multiplex Networks will appeal to students, researchers, and professionals within the fields of network science, graph theory, and data science.

This is the first in a series of volumes, which provide an extensive overview of conjectures and open problems in graph theory. The readership of each volume is geared toward graduate students who may be searching for research ideas. However, the well-established mathematician will find the overall exposition engaging and enlightening. Each chapter, presented in a story-telling style, includes more than a simple collection of results on a particular topic. Each contribution conveys the history, evolution, and techniques used to solve the authors' favorite conjectures and open problems, enhancing the reader's overall comprehension and enthusiasm. The editors were inspired to create these volumes by the popular and well attended special sessions, entitled "My Favorite Graph Theory Conjectures," which were held at the winter AMS/MAA Joint Meeting in Boston (January, 2012), the SIAM Conference on Discrete Mathematics in Halifax (June,2012) and the winter AMS/MAA Joint meeting in Baltimore(January, 2014). In an effort to aid in the creation and dissemination of open problems, which is crucial to the growth and development of a field, the editors requested the speakers, as well as notable experts in graph theory, to contribute to these volumes.

Written for graduate students in mathematics or non-specialist mathematicians who wish to learn the basics about some of the most important current research in the field, this book provides an intensive, yet accessible, introduction to the subject of algebraic combinatorics. After recalling basic notions of combinatorics, representation theory, and some commutative algebra, the main material provides links between the study of coinvariant or diagonally coinvariant spaces and the study of Macdonald polynomials and related operators. This gives rise to a large number of combinatorial questions relating to objects counted by familiar numbers such as the factorials, Catalan numbers, and the number of Cayley trees or parking functions. The author offers ideas for extending the theory to other families of finite Coxeter groups, besides permutation groups.

This book concentrates on the modern theory of dynamical systems and its interactions with number theory and combinatorics. The greater part begins with a course in analytic number theory and focuses on its links with ergodic theory, presenting an exhaustive account of recent research on Sarnak's conjecture on Moebius disjointness. Selected topics involving more traditional connections between number theory and dynamics are also presented, including equidistribution, homogenous dynamics, and Lagrange and Markov spectra. In addition, some dynamical and number theoretical aspects of aperiodic order, some algebraic systems, and a recent development concerning tame systems are described.

This text is intended for an honors calculus course or for an introduction to analysis. Involving rigorous analysis, computational dexterity, and a breadth of applications, it is ideal for undergraduate majors. This third edition includes corrections as well as some additional material. Some features of the text include: The text is completely self-contained and starts with the real number axioms; The integral is defined as the area under the graph, while the area is defined for every subset of the plane; There is a heavy emphasis on computational problems, from the high-school quadratic formula to the formula for the derivative of the zeta function at zero; There are applications from many parts of analysis, e.g., convexity, the Cantor set, continued fractions, the AGM, the theta and zeta functions, transcendental numbers, the Bessel and gamma functions, and many more; Traditionally transcendentally presented material, such as infinite products, the Bernoulli series, and the zeta functional equation, is developed over the reals; and There are 385 problems with all the solutions at the back of the text.

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.

Discrete mathematics has been rising in prominence in the past fifty years, both as a tool with practical applications and as a source of new and interesting mathematics. The topics in discrete mathematics have become so well developed that it is easy to forget that common threads connect the different areas, and it is through discovering and using these connections that progress is often made. For over fifty years, Ron Graham has been able to illuminate some of these connections and has helped to bring the field of discrete mathematics to where it is today. To celebrate his contribution, this volume brings together many of the best researchers working in discrete mathematics, including Fan Chung, Erik D. Demaine, Persi Diaconis, Peter Frankl, Alfred W. Hales, Jeffrey C. Lagarias, Allen Knutson, Janos Pach, Carl Pomerance, N. J. A. Sloane, and of course, Ron Graham himself.

This book is the second edition of the third and last volume of a treatise on projective spaces over a finite field, also known as Galois geometries. This volume completes the trilogy comprised of plane case (first volume) and three dimensions (second volume). This revised edition includes much updating and new material. It is a mostly self-contained study of classical varieties over a finite field, related incidence structures and particular point sets in finite n-dimensional projective spaces. General Galois Geometries is suitable for PhD students and researchers in combinatorics and geometry. The separate chapters can be used for courses at postgraduate level.

Permutation groups, their fundamental theory and applications are discussed in this introductory book. It focuses on those groups that are most useful for studying symmetric structures such as graphs, codes and designs. Modern treatments of the O'Nan-Scott theory are presented not only for primitive permutation groups but also for the larger families of quasiprimitive and innately transitive groups, including several classes of infinite permutation groups. Their precision is sharpened by the introduction of a cartesian decomposition concept. This facilitates reduction arguments for primitive groups analogous to those, using orbits and partitions, that reduce problems about general permutation groups to primitive groups. The results are particularly powerful for finite groups, where the finite simple group classification is invoked. Applications are given in algebra and combinatorics to group actions that preserve cartesian product structures. Students and researchers with an interest in mathematical symmetry will find the book enjoyable and useful.

This book constitutes the refereed proceedings of the 11th International Conference on Combinatorics on Words, WORDS 2017, held in Montreal, QC, Canada, in September 2017. The 21 revised full papers presented together with 5invoted talks were carefully reviewed and selected from 26 submissions. Discrete geometry plays an expanding role in the fields of shape modeling, image synthesis, and image analysis. It deals with topological and geometrical definitions of digitized objects or digitized images and provides both a theoretical and computational framework for computer imaging.

This book provides a detailed exposition of a wide range of topics in geometric group theory, inspired by Gromov's pivotal work in the 1980s. It includes classical theorems on nilpotent groups and solvable groups, a fundamental study of the growth of groups, a detailed look at asymptotic cones, and a discussion of related subjects including filters and ultrafilters, dimension theory, hyperbolic geometry, amenability, the Burnside problem, and random walks on groups. The results are unified under the common theme of Gromov's theorem, namely that finitely generated groups of polynomial growth are virtually nilpotent. This beautiful result gave birth to a fascinating new area of research which is still active today.The purpose of the book is to collect these naturally related results together in one place, most of which are scattered throughout the literature, some of them appearing here in book form for the first time. In this way, the connections between these topics are revealed, providing a pleasant introduction to geometric group theory based on ideas surrounding Gromov's theorem. The book will be of interest to mature undergraduate and graduate students in mathematics who are familiar with basic group theory and topology, and who wish to learn more about geometric, analytic, and probabilistic aspects of infinite groups.

This book is divided into two parts, the first of which seeks to connect the phase transitions of various disciplines, including game theory, and to explore the synergies between statistical physics and combinatorics. Phase Transitions has been an active multidisciplinary field of research, bringing together physicists, computer scientists and mathematicians. The main research theme explores how atomic agents that act locally and microscopically lead to discontinuous macroscopic changes. Adopting this perspective has proven to be especially useful in studying the evolution of random and usually complex or large combinatorial objects (like networks or logic formulas) with respect to discontinuous changes in global parameters like connectivity, satisfiability etc. There is, of course, an obvious strategic element in the formation of a transition: the atomic agents "selfishly" seek to optimize a local parameter. However, up to now this game-theoretic aspect of abrupt, locally triggered changes had not been extensively studied. In turn, the book's second part is devoted to mathematical and computational methods applied to the pricing of financial contracts and the measurement of financial risks. The tools and techniques used to tackle these problems cover a wide spectrum of fields, like stochastic calculus, numerical analysis, partial differential equations, statistics and econometrics. Quantitative Finance is a highly active field of research and is increasingly attracting the interest of academics and practitioners alike. The material presented addresses a wide variety of new challenges for this audience.

Descriptive complexity theory establishes a connection between the computational complexity of algorithmic problems (the computational resources required to solve the problems) and their descriptive complexity (the language resources required to describe the problems). This groundbreaking book approaches descriptive complexity from the angle of modern structural graph theory, specifically graph minor theory. It develops a 'definable structure theory' concerned with the logical definability of graph theoretic concepts such as tree decompositions and embeddings. The first part starts with an introduction to the background, from logic, complexity, and graph theory, and develops the theory up to first applications in descriptive complexity theory and graph isomorphism testing. It may serve as the basis for a graduate-level course. The second part is more advanced and mainly devoted to the proof of a single, previously unpublished theorem: properties of graphs with excluded minors are decidable in polynomial time if, and only if, they are definable in fixed-point logic with counting.

This image-rich book explores the practice as well as the theory of visual representation and presents us with the importance of designing appropriate images for communication to specific target audiences. This includes the appropriate choice of high-tech digital or low-tech analogue technologies in image-making for communication within the medical education, biological research and community health contexts. We hear from medical students about the value of using clay modelling in their understanding of anatomy, from educators and curriculum designers about visual affordances in medical education and from a community-driven project in South Africa about their innovative use of locally designed images and culture-specific narratives for communicating important health information to marginalised communities. A chapter explores the evolution of scientific visualisation and representation of big data to a variety of audiences, and another presents the innovative 3D construction of internal cellular structures from microscopic 2D slices. As we embrace blended learning in anatomy education, a timely chapter prompts us to think further about and contribute to the ongoing discourse around important ethical considerations in the use and sharing of digital images of body donors. This book will appeal to educators, medical illustrators, curriculum designers, post-graduate students, community health practitioners and biomedical researchers.

An accessible and panoramic account of the theory of random walks on groups and graphs, stressing the strong connections of the theory with other branches of mathematics, including geometric and combinatorial group theory, potential analysis, and theoretical computer science. This volume brings together original surveys and research-expository papers from renowned and leading experts, many of whom spoke at the workshop 'Groups, Graphs and Random Walks' celebrating the sixtieth birthday of Wolfgang Woess in Cortona, Italy. Topics include: growth and amenability of groups; Schroedinger operators and symbolic dynamics; ergodic theorems; Thompson's group F; Poisson boundaries; probability theory on buildings and groups of Lie type; structure trees for edge cuts in networks; and mathematical crystallography. In what is currently a fast-growing area of mathematics, this book provides an up-to-date and valuable reference for both researchers and graduate students, from which future research activities will undoubtedly stem.

This textbook provides an introduction to the Catalan numbers and their remarkable properties, along with their various applications in combinatorics. Intended to be accessible to students new to the subject, the book begins with more elementary topics before progressing to more mathematically sophisticated topics. Each chapter focuses on a specific combinatorial object counted by these numbers, including paths, trees, tilings of a staircase, null sums in Zn+1, interval structures, partitions, permutations, semiorders, and more. Exercises are included at the end of book, along with hints and solutions, to help students obtain a better grasp of the material. The text is ideal for undergraduate students studying combinatorics, but will also appeal to anyone with a mathematical background who has an interest in learning about the Catalan numbers. "Roman does an admirable job of providing an introduction to Catalan numbers of a different nature from the previous ones. He has made an excellent choice of topics in order to convey the flavor of Catalan combinatorics. [Readers] will acquire a good feeling for why so many mathematicians are enthralled by the remarkable ubiquity and elegance of Catalan numbers." - From the foreword by Richard Stanley

Generating random networks efficiently and accurately is an important challenge for practical applications, and an interesting question for theoretical study. This book presents and discusses common methods of generating random graphs. It begins with approaches such as Exponential Random Graph Models, where the targeted probability of each network appearing in the ensemble is specified. This section also includes degree-preserving randomisation algorithms, where the aim is to generate networks with the correct number of links at each node, and care must be taken to avoid introducing a bias. Separately, it looks at growth style algorithms (e.g. preferential attachment) which aim to model a real process and then to analyse the resulting ensemble of graphs. It also covers how to generate special types of graphs including modular graphs, graphs with community structure and temporal graphs. The book is aimed at the graduate student or advanced undergraduate. It includes many worked examples and open questions making it suitable for use in teaching. Explicit pseudocode algorithms are included throughout the book to make the ideas straightforward to apply. With larger and larger datasets, it is crucial to have practical and well-understood tools. Being able to test a hypothesis against a properly specified control case is at the heart of the 'scientific method'. Hence, knowledge on how to generate controlled and unbiased random graph ensembles is vital for anybody wishing to apply network science in their research.

This introduction to random walks on infinite graphs gives particular emphasis to graphs with polynomial volume growth. It offers an overview of analytic methods, starting with the connection between random walks and electrical resistance, and then proceeding to study the use of isoperimetric and Poincare inequalities. The book presents rough isometries and looks at the properties of a graph that are stable under these transformations. Applications include the 'type problem': determining whether a graph is transient or recurrent. The final chapters show how geometric properties of the graph can be used to establish heat kernel bounds, that is, bounds on the transition probabilities of the random walk, and it is proved that Gaussian bounds hold for graphs that are roughly isometric to Euclidean space. Aimed at graduate students in mathematics, the book is also useful for researchers as a reference for results that are hard to find elsewhere.

This book presents a novel non-intrusive infrastructure monitoring technique based on the detection and tracking of scattering centers in spaceborne SAR images. The methodology essentially consists of refocusing each available SAR image on an imposed 3D point cloud associated to the envisaged infrastructure element and identifying the reliable scatterers to be monitored by means of four dimensional (4D) tomography. The methodology described in this book provides a new perspective on infrastructure monitoring with spaceborne SAR images, is based on a standalone processing chain, and brings innovative technical aspects relative to conventional approaches. The book is intended primarily for professionals and researchers working in the area of critical infrastructure monitoring by radar remote sensing.

This richly illustrated textbook explores the amazing interaction between combinatorics, geometry, number theory, and analysis which arises in the interplay between polyhedra and lattices. Highly accessible to advanced undergraduates, as well as beginning graduate students, this second edition is perfect for a capstone course, and adds two new chapters, many new exercises, and updated open problems. For scientists, this text can be utilized as a self-contained tooling device. The topics include a friendly invitation to Ehrhart's theory of counting lattice points in polytopes, finite Fourier analysis, the Frobenius coin-exchange problem, Dedekind sums, solid angles, Euler-Maclaurin summation for polytopes, computational geometry, magic squares, zonotopes, and more. With more than 300 exercises and open research problems, the reader is an active participant, carried through diverse but tightly woven mathematical fields that are inspired by an innocently elementary question: What are the relationships between the continuous volume of a polytope and its discrete volume? Reviews of the first edition: "You owe it to yourself to pick up a copy of Computing the Continuous Discretely to read about a number of interesting problems in geometry, number theory, and combinatorics." - MAA Reviews "The book is written as an accessible and engaging textbook, with many examples, historical notes, pithy quotes, commentary integrating the mate rial, exercises, open problems and an extensive bibliography." - Zentralblatt MATH "This beautiful book presents, at a level suitable for advanced undergraduates, a fairly complete introduction to the problem of counting lattice points inside a convex polyhedron." - Mathematical Reviews "Many departments recognize the need for capstone courses in which graduating students can see the tools they have acquired come together in some satisfying way. Beck and Robins have written the perfect text for such a course." - CHOICE

This book constitutes the proceedings of the 27th International Workshop on Combinatorial Algorithms, IWOCA 2016, held in Helsinki, Finland, in August 2016. The 35 papers presented in this volume were carefully reviewed and selected from 87 submissions. They were organized in topical sessions named: computational complexity; computational geometry; networks; enumeration; online algorithms; algorithmic graph theory; dynamic programming; combinatorial algorithms; graph algorithms; combinatorics; and probabilistics.

The canonical way to establish the central limit theorem for i.i.d. random variables is to use characteristic functions and Levy's continuity theorem. This monograph focuses on this characteristic function approach and presents a renormalization theory called mod- convergence. This type of convergence is a relatively new concept with many deep ramifications, and has not previously been published in a single accessible volume. The authors construct an extremely flexible framework using this concept in order to study limit theorems and large deviations for a number of probabilistic models related to classical probability, combinatorics, non-commutative random variables, as well as geometric and number-theoretical objects. Intended for researchers in probability theory, the text is carefully well-written and well-structured, containing a great amount of detail and interesting examples.

Written by leading experts, this book explores several directions of current research at the interface between dynamics and analytic number theory. Topics include Diophantine approximation, exponential sums, Ramsey theory, ergodic theory and homogeneous dynamics. The origins of this material lie in the 'Dynamics and Analytic Number Theory' Easter School held at Durham University in 2014. Key concepts, cutting-edge results, and modern techniques that play an essential role in contemporary research are presented in a manner accessible to young researchers, including PhD students. This book will also be useful for established mathematicians. The areas discussed include ubiquitous systems and Cantor-type sets in Diophantine approximation, flows on nilmanifolds and their connections with exponential sums, multiple recurrence and Ramsey theory, counting and equidistribution problems in homogeneous dynamics, and applications of thin groups in number theory. Both dynamical and 'classical' approaches towards number theoretical problems are also provided.

This book constitutes the refereed proceedings of the 18th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2016, held in Liege, Belgium, in June 2016. The 33 full papers presented were carefully reviewed and selected from 125 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications in these areas. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.