Water transport on infinite graphs

DOI10.1002/rsa.20801zbMath1414.05204arXiv1803.05907OpenAlexW2963709870MaRDI QIDQ5381054

Timo Hirscher, Olle Häggström

Publication date: 7 June 2019

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1803.05907

zbMATH Keywords

optimizationgraph algorithmsinfinite pathwater transportDeffuant model

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Infinite graphs (05C63)

Related Items

Overly determined agents prevent consensus in a generalized Deffuant model on ℤ with dispersed opinions ⋮ Infinite paths on a random environment of \({\mathbb{Z}}^2\) with bounded and recurrent sums

Cites Work

• A pairwise averaging procedure with application to consensus formation in the Deffuant model
• Further results on consensus formation in the Deffuant model
• Probability
• Unnamed Item