Displacement of transport processes on networked topologies
Consider a particle whose position evolves along the edges of a network. One definition for the displacement of a particle is the length of the shortest path on the network between the current and initial positions of the particle. Such a definition fails to incorporate information of the actual pat...
Main Authors: | Wilson, DB, Baker, RE, Woodhouse, FG |
---|---|
Format: | Journal article |
Published: |
Society for Industrial and Applied Mathematics
2019
|
Similar Items
-
Crowded transport within networked representations of complex geometries
by: Wilson, DB, et al.
Published: (2021) -
Topology-dependent density optima for efficient simultaneous network exploration
by: Wilson, D, et al.
Published: (2018) -
Crowded transport within networked representations of complex geometries
by: Daniel B. Wilson, et al.
Published: (2021-10-01) -
Improvement of transportation process management effectiveness: Assessment and analysis of network topologies
by: Nadezhkin Vadim A., et al.
Published: (2024-01-01) -
Topological assessment of recoverability in public transport networks
by: Renzo Massobrio, et al.
Published: (2024-03-01)