Limit Theorems for the Maximal Path Weight in a Directed Graph on the Line with Random Weights of Edges.
Takis KonstantopoulosA. V. LogachovA. A. MogulskiiS. G. FossPublished in: Probl. Inf. Transm. (2021)
Keyphrases
- directed graph
- edge weights
- limit theorems
- total weight
- random walk
- heavy traffic
- shortest path problem
- weight assignment
- undirected graph
- confidence intervals
- source node
- directed acyclic graph
- graph structure
- strongly connected
- maximum flow
- queue length
- steady state
- disjoint paths
- weight function
- queueing networks
- monte carlo
- upper bound
- learning algorithm