On extreme points of the diffusion polytope
arXiv:1604.08573 · doi:10.1016/j.physa.2017.01.038
Abstract
We consider a class of diffusion problems defined on simple graphs in which the populations at any two vertices may be averaged if they are connected by an edge. The diffusion polytope is the convex hull of the set of population vectors attainable using finite sequences of these operations. A number of physical problems have linear programming solutions taking the diffusion polytope as the feasible region, e.g. the free energy that can be removed from plasma using waves, so there is a need to describe and enumerate its extreme points. We review known results for the case of the complete graph , and study a variety of problems for the path graph and the cyclic graph . We describe the different kinds of extreme points that arise, and identify the diffusion polytope in a number of simple cases. In the case of increasing initial populations on the diffusion polytope is topologically an -dimensional hypercube.
arXiv comment10 pages, 8 figures
References in corpus (8)
- Emergence of scaling in random networks
- Epidemic spreading in scale-free networks
- Resilience of the Internet to random breakdowns
- The abelian sandpile and related models
- Diffusion, localization and dispersion relations on ``small-world'' lattices
- Optimization of Network Robustness to Waves of Targeted and Random Attack
- Ignition threshold for non-Maxwellian plasmas
- Maximal energy extraction under discrete diffusive exchange
Cited by in corpus (7)
- Continuous thermomajorization and a complete set of laws for Markovian thermal processes
- Recovering Gardner Restacking with Purely Diffusive Operations
- Available Energy from Diffusive and Reversible Phase Space Rearrangements
- Loss-Cone Stabilization in Rotating Mirrors: Thresholds and Thermodynamics
- Minimum Stabilizing Energy Release for Mixing Processes
- Upper and Lower Bounds on Phase-Space Rearrangements
- Majorization requires infinitely many second laws