Journal Article FZJ-2023-01636

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png
Branching in flow networks with linear congestion

 ;  ;

2022
APS College Park, MD

Physical review research 4(4), 043208 () [10.1103/PhysRevResearch.4.043208]

This record in other databases:    

Please use a persistent id in citations:   doi:

Abstract: In our modern world, we rely on the proper functioning of a variety of networks with complex dynamics. Many of them are prone to congestion due to high loads, which determines their operation and resilience to failures. In this article, we propose a fundamental model of congestion where travel times increase linearly with the load. We show that this model interpolates between shortest path and Ohmic flow dynamics, which both have a broad range of applications. We formulate the model as a quadratic programme and derive a generalization of Ohm's law, where the flow of every link is determined by a potential gradient in a nonlinear way. We provide analytic solutions for fundamental network topologies that elucidate the transition from localized flow to a branched flow. Furthermore, we discuss how to solve the model efficiently for large networks and investigate the resilience to structural damages.

Classification:

Contributing Institute(s):
  1. Systemforschung und Technologische Entwicklung (IEK-STE)
Research Program(s):
  1. 1112 - Societally Feasible Transformation Pathways (POF4-111) (POF4-111)

Appears in the scientific report 2023
Database coverage:
Medline ; Creative Commons Attribution CC BY 4.0 ; DOAJ ; OpenAccess ; Article Processing Charges ; Clarivate Analytics Master Journal List ; DOAJ Seal ; Emerging Sources Citation Index ; Fees ; SCOPUS ; Web of Science Core Collection
Click to display QR Code for this record

The record appears in these collections:
Document types > Articles > Journal Article
Workflow collections > Public records
Workflow collections > Publication Charges
IEK > IEK-STE
Publications database
Open Access

 Record created 2023-03-30, last modified 2024-02-26