Ultrametricity of optimal transport substates for multiple interacting paths over a square lattice network
Marco Cogoni, Giovanni Busonera, Gianluigi Zanetti

TL;DR
This paper models multiple interacting transport paths on a lattice network using polydisperse self-avoiding walks, revealing ultrametric structures in the system's ground states under certain cost functions.
Contribution
It introduces a novel approach to analyze complex network transport systems with concave costs, demonstrating ultrametricity in the conformational substate space.
Findings
Ultrametric structure observed in ground states for concave cost functions.
Non-monotonic behavior of cost gains with increasing polymer density.
Phase transition from convex to concave cost functions identified.
Abstract
We model a set of point-to-point transports on a network as a system of polydisperse interacting self-avoiding walks (SAWs) over a finite square lattice. The ends of each SAW may be located both at random, uniformly distributed, positions or with one end fixed at a lattice corner. The total energy of the system is computed as the sum over all SAWs, which may represent either the time needed to complete the transport over the network, or the resources needed to build the networking infrastructure. We focus especially on the second aspect by assigning a concave cost function to each site to encourage path overlap. A Simulated Annealing optimization, based on a modified BFACF Montecarlo algorithm developed for polymers, is used to probe the complex conformational substates structure. We characterize the average cost gains (and path-length variation) for increasing polymer density with…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
