Flows on Graphs with Random Capacities

Simple item page
dc.creatorAntal, T.
dc.creatorKrapivsky, P. L.
dc.date2006-09-06
dc.date.accessioned2026-07-07T07:23:27Z
dc.date.available2026-07-07T07:23:27Z
dc.descriptionWe investigate flows on graphs whose links have random capacities. For binary trees we derive the probability distribution for the maximal flow from the root to a leaf, and show that for infinite trees it vanishes beyond a certain threshold that depends on the distribution of capacities. We then examine the maximal total flux from the root to the leaves. Our methods generalize to simple graphs with loops, e.g., to hierarchical lattices and to complete graphs.
dc.description8 pages, 6 figures
dc.identifierhttps://arxiv.org/abs/cond-mat/0609145
dc.identifierhttp://arxiv.org/abs/cond-mat/0609145
dc.identifierPhysical Review E 74, 051110 (2006)
dc.identifierdoi:10.1103/PhysRevE.74.051110
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/115983
dc.subjectStatistical Mechanics
dc.subjectDisordered Systems and Neural Networks
dc.titleFlows on Graphs with Random Capacities
dc.typetext

Files

Collections

arXiv