Artículos relacionados a Mathematics of Networks: Modulus Theory and Convex...
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Acerca del autor
Nathan Albin received a BA in Mathematics from the University of Hawaii and Hilo in 2001. Following a short stint as a software engineer, he attended graduate school at the University of Utah and received a PhD in Mathematics in 2006. He was then awarded an NSF Mathematical Sciences Postdoctoral Research Fellowship, hence spent one year researching at the University of Duisburg-Essen, before moving to Pasadena, CA to complete his postdoctoral research at Caltech. He was hired as an Assistant Professor of Mathematics in 2011 and was promoted to Associate Professor in 2016. His primary research interests include Applied Mathematics, Network Theory, Optimization Theory, and Numerical Analysis.
Pietro Poggi-Corradini grew up in Milan, Italy, and in 1992 received a Bachelor in Mathematics from the University of Milan. He then pursued his studies at the University of Washington in Seattle (USA) and graduated in 1996 with a PhD Thesis in Complex Dynamics and Operator Theory under Professor Don Marshall. Thereafter he became Whyburn Instructor at the University of Virginia and in 1998 joined the faculty at Kansas State University. He has been Full Professor at Kansas State University since 2005. His interests currently span Network Theory, Complex Analysis, Probability, and Applied Mathematics.
"Sobre este título" puede pertenecer a otra edición de este libro.
Comprar nuevo
Ver este artículo
EUR 112,30
EUR 31,42 gastos de envío desde Australia a España
Destinos, gastos y plazos de envíoResultados de la búsqueda para Mathematics of Networks: Modulus Theory and Convex...
Imagen de archivo
Mathematics of Networks (Hardcover)
Librería: AussieBookSeller, Truganina, VIC, Australia
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: new. Hardcover. 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. Mathematics of Networks: Modulus Theory and Convex Optimization is a book that seeks to answer the question: What can be learned by adapting the theory of p-modulus (and related continuum analysis concepts) to discrete graphs? Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. Nº de ref. del artículo: 9780367457075
Cantidad disponible: 1 disponibles
Imagen de archivo
Mathematics of Networks: Modulus Theory and Convex Optimization
Impresión bajo demandaLibrería: THE SAINT BOOKSTORE, Southport, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Hardback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 526. Nº de ref. del artículo: C9780367457075
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Mathematics of Networks (Hardcover)
Librería: CitiRetail, Stevenage, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: new. Hardcover. 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. Mathematics of Networks: Modulus Theory and Convex Optimization is a book that seeks to answer the question: What can be learned by adapting the theory of p-modulus (and related continuum analysis concepts) to discrete graphs? Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Nº de ref. del artículo: 9780367457075
Cantidad disponible: 1 disponibles
Imagen de archivo
Mathematics of Networks (Hardcover)
Librería: Grand Eagle Retail, Fairfield, OH, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: new. Hardcover. 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. Mathematics of Networks: Modulus Theory and Convex Optimization is a book that seeks to answer the question: What can be learned by adapting the theory of p-modulus (and related continuum analysis concepts) to discrete graphs? Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Nº de ref. del artículo: 9780367457075
Cantidad disponible: 1 disponibles