From the physics of interacting polymers to optimizing routes on the London Underground
Explore this paper's citation graph
Summary
This work uses the physics of interacting polymers and disordered systems to analyze macroscopic properties of generic path optimization problems and derives a simple, principled, generic, and distributed routing algorithm capable of considering all individual path choices simultaneously.
- Type
- article
- Published
- 2013-07-29
- Cited by
- 59
- References
- 45
- Access
- Open access
- OpenAlex
- https://openalex.org/W23898198
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:12775311
Keywords
Gadolinium, Neutron, Isotope, Dance, Radiochemistry
References
- Optimal transportation network with concave cost functions: loop analysis and algorithms.
- Overlay distribution structures and their applications
- Random Graphs: Notation
- Analytic and Algorithmic Solution of Random Satisfiability Problems
- Statistical Physics of Spin Glasses and Information Processing
- Routing in the Internet
- OSPF: Anatomy of an Internet Routing Protocol
- On self adaptive routing in dynamic environments - an evaluation and design using a simple, probabilistic scheme
- Deciphering the splicing code
- Spin Glass Theory and Beyond
- Dynamic overlay routing based on available bandwidth estimation: A simulation study
- Structure, scaling, and phase transition in the optimal transport network.
- Information Theory and Reliable Communication
- Greedy distributed optimization of multi-commodity flows
- Nature of the collapse transition for polymers.
- The Competition for Shortest Paths on Sparse Graphs
- The maximum concurrent flow problem
- ON A ROUTING PROBLEM
- Bethe-Ansatz results for a solvable O(n) model on the square lattice.
- Topology of the fittest transportation network.
Cited by
- The Edge-Disjoint Path Problem on Random Graphs by Message-Passing
- Navigability of interconnected networks under random failures
- Hidden Connectivity in Networks with Vulnerable Classes of Nodes
- Distance measures and evolution of polymer chains in their topological space.
- Shortest node-disjoint paths on random graphs
- Efficient algorithm for routing optimization via statistical mechanics
- Congestion avoidance routing in urban rail transit networks
- Solving the undirected feedback vertex set problem by local search
- Social networks in primates: smart and tolerant species have more efficient networks
- Physics-inspired methods for networking and communications
- Personalized routing for multitudes in smart cities
- REGULAR A RTICLE Open Access
- Big Data for Social Transportation
- Congestion Avoidance Routing Based on Large-Scale Social Signals
- Message passing for distributed optimisation of power allocation with renewable resources
- Which publication is your representative work?
- Decentralized network control, optimization and random walks on networks
- Rentian scaling for the measurement of optimal embedding of complex networks into physical space
- Distributed Optimization in Transportation and Logistics Networks
- Color-avoiding percolation.
Related papers
- Beam Studies in Gadolinium Neutron Capture Therapy Using Neutron Generators
- Neutron Capture Measurements and Resonance Parameters of Gadolinium
- Simultaneous measurement of (n, γ) and (n, fission) cross sections with the DANCE 4π BaF2 array
- Gadolinium-neutron-activation determination with a Pu-Be source
- Development of a Large-Volume Fast-Neutron Detector for Environmental Neutron Monitoring
- Evaluation of Lithium Gadolinium Borate Capture-Gated Spectrometer Neutron Efficiencies