Cost-volume relationships for flows through a disordered network
David Aldous
Abstract
In a network where the cost of flow across an edge is nonlinear in the volume of flow, and where sources and destinations are uniform, one can consider the relationship between total volume v of flow through the network and the minimum cost c = Psi(v) of any flow with volume v. Under a simple probability model (locally tree-like directed network, independent cost-volume functions or different edges) we show how to compute Ψ(v) in the infinite-size limit. The argument uses a probabilistic reformulation of the cavity method from statistical physics, and is not rigorous as presented here. The methodology seems potentially useful for many problems concerning flows on this class of random networks.
Create a lesson
Related papers
Cell-type-specific modularity in E/I networks shapes dynamical regimes and computational capabilities
Emmanouil Giannakakis, Victor Buendía, Oleg Vinogradov et al.
Finite-width shift of the edge of chaos in deep neural networks
Arn Caesar
Neural Networks with Exciton-Polariton Waveguides
Huawen Xu, Ruiqi Bao, Lingyu Tian et al.
Optical Ceiling on Polaron Mobility in Disordered Molecular Semiconductors: Lessons from Eumelanin
Alvan Hunt
Glauber dynamics of the Sherrington--Kirkpatrick spin-glass model: a dynamical cavity method
Grzegorz Szamel
Generative diffusion in long-range correlated landscapes: Speciation cascade and the foam structure of the score
Jerome Garnier-Brun, Giulio Biroli, Marc Mézard et al.