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.
Betal nemt med kort, Klarna, Apple Pay eller Google Pay. Ikke tilfreds? Du har altid 14 dages fortrydelsesret. Læs mere i vores vilkår. Har du spørgsmål, så send os en mail på hello@memmo.org.
Memmo gør det nemmere at studere – uanset hvor du er i verden. Hos os samler du dine kursusbøger og smarte studieværktøjer ét sted: resuméer, quizzer, podcasts og flashcards. Og så er der Ted, din studieven, der svarer på alt, du undrer dig over. Over 50 000 studerende studerer allerede her – bygget til at hjælpe dig med at lære hurtigere og stresse mindre.