Ideal Relative Flow Distribution on Directed Network

In this paper the authors propose a new concept to prioritize the importance of a link in a directed network graph based on an ideal flow distribution. An ideal flow is the infinite limit of relative aggregated count of random walk agents' trajectories on a network graph distributed over space and time. The standard ideal flow, which is uniformly distributed flow over space and time, maximize the entropy for the utilization of a network. The authors show that the simulated trajectories of random walk agents would form an ideal relative flow distribution is converged to stationary values. This implies that ideal flow matrix depends only on the network structure. Ideal flow matrix is invariant to scalar multiplication and remarkably it is always premagic. Demonstration of ideal flow to the real world network was fitted into Sioux Falls transportation network.

Language

  • English
  • Japanese

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01674264
  • Record Type: Publication
  • Source Agency: Japan Science and Technology Agency (JST)
  • Files: TRIS, JSTAGE
  • Created Date: Apr 25 2018 3:04PM