Mathematics of Networks: Modulus Theory and Convex Optimization explores the question: “What can be learned by adapting the theory of p-modulus (and related continuum analysis concepts) to discrete graphs?” This book navigates the rich landscape of p-modulus on graphs, demonstrating how this theory elegantly connects concepts from graph theory, probability, and convex optimization.
This book is ideal for anyone seeking a deeper understanding of the theoretical foundations of network analysis and applied graph theory. It serves as an excellent primary text or reference for graduate and advanced undergraduate courses across multiple disciplines, including mathematics, data science, and engineering, particularly those focusing on network analysis, applied graph theory, optimization, and related areas.
Features:
- Accessible to students with a solid foundation in multivariable calculus and linear algebra.
- Broad interdisciplinary appeal, relevant to mathematics, data science, and engineering curricula.
- Numerous engaging exercises.
Pay easily by card, Klarna, Apple Pay or Google Pay. Not happy? You always have a 14-day money-back guarantee. Read more in our terms. If you have any questions, email us at hello@memmo.org.
Memmo makes studying easier – wherever you are in the world. We bring your course books and smart study tools together in one place: summaries, quizzes, podcasts and flashcards. Plus Ted, your study buddy who answers anything you wonder. Over 75,000 students already study here – built to help you learn faster and stress less.