On extreme points of the diffusion polytope

Hay, M. J.; Schiff, J.; Fisch, N. J.

doi:10.1016/j.physa.2017.01.038

Title: On extreme points of the diffusion polytope

Full Record
Other Related Research

Abstract

Here, 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 also review known results for the case of the complete graph Kn, and study a variety of problems for the path graph Pn and the cyclic graph Cn. Finall, 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 Pn the diffusion polytope is topologically an n-dimensional hypercube.

Authors:

Hay, M. J. ^[1]; Schiff, J. ^[2];

^[3]

Princeton Univ., NJ (United States). Dept. of Astrophysical Sciences
Bar-IIan Univ., Ramat Gan (Israel). Dept. of Mathematics
Princeton Univ., NJ (United States). Dept. of Astrophysical Sciences; Princeton Plasma Physics Lab. (PPPL), Princeton, NJ (United States)

Publication Date:: Wed Jan 04 00:00:00 EST 2017

Research Org.:: Princeton Plasma Physics Laboratory (PPPL), Princeton, NJ (United States)

Sponsoring Org.:: USDOE Office of Science (SC), Fusion Energy Sciences (FES); USDOE National Nuclear Security Administration (NNSA)

OSTI Identifier:: 1350094

Alternate Identifier(s):: OSTI ID: 1550650

Grant/Contract Number:: AC02-09CH11466; 274-FG52-08NA28553; DE274-FG52-08NA28553

Resource Type:: Accepted Manuscript

Journal Name:: Physica. A

Additional Journal Information:: Journal Volume: 473; Journal Issue: C; Journal ID: ISSN 0378-4371

Publisher:: Elsevier

Country of Publication:: United States

Language:: English

Subject:: 70 PLASMA PHYSICS AND FUSION TECHNOLOGY; Combinatorics; Optimization; Diffusion; Plasma; Networks; Algebra

Citation Formats


                    Hay, M. J., Schiff, J., and Fisch, N. J. On extreme points of the diffusion polytope.  United States: N. p., 2017. 
Web.  doi:10.1016/j.physa.2017.01.038.

Copy to clipboard


                    Hay, M. J., Schiff, J., & Fisch, N. J. On extreme points of the diffusion polytope.  United States.  https://doi.org/10.1016/j.physa.2017.01.038

Copy to clipboard


                    Hay, M. J., Schiff, J., and Fisch, N. J. Wed .  
"On extreme points of the diffusion polytope".  United States.  https://doi.org/10.1016/j.physa.2017.01.038.  https://www.osti.gov/servlets/purl/1350094.

Copy to clipboard


                    
@article{osti_1350094,

  title        = {On extreme points of the diffusion polytope},

  author       = {Hay, M. J. and Schiff, J. and Fisch, N. J.},

  abstractNote = {Here, 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 also review known results for the case of the complete graph Kn, and study a variety of problems for the path graph Pn and the cyclic graph Cn. Finall, 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 Pn the diffusion polytope is topologically an n-dimensional hypercube.},

  doi          = {10.1016/j.physa.2017.01.038},

  journal      = {Physica. A},

  number       = C,

  volume       = 473,

  place        = {United States},

  year         = {Wed Jan 04 00:00:00 EST 2017},

  month        = {Wed Jan 04 00:00:00 EST 2017}

}

Copy to clipboard

Journal Article:

Free Publicly Available Full Text

Accepted Manuscript (Publisher)

Accepted Manuscript (DOE)

Publisher's Version of Record

https://doi.org/10.1016/j.physa.2017.01.038

Other availability

Search WorldCat to find libraries that may hold this journal

Citation Metrics:

Cited by: 4 works

Citation information provided by
Web of Science

Save / Share:

Export Metadata

Save to My Library

Similar Records in DOE PAGES and OSTI.GOV collections:

On dicycle packings and the linear ordering polytope

Conference Penn, M ; Nubov, Z

The acyclic tournaments of order n it forms the linear ordering polytope P{sub LO}{sup n}. Let D be a digraph that induces a facet-defining inequality for P{sub LO}{sup n} that is nonequivalent to a trivial inequality or to a 3-dicycle inequality. We show that for such a digraph the following holds: the value {tau} of a minimum integral dicycle cover is greater than the value {tau}* of a minimum dicycle cover. We show that {tau}* can be found by solving a linear program of polynomial size. The generalized transitive tournaments of order n forms the polytope P{sub C}{sup n} whichmore »« less
On the symmetric circuit polytope

Conference Bauer, P

Given an undirected graph G = (V,e) and a cost vector c {element_of} R{sup E}, the weighted girth problem is to find a circuit, i.e. simple cycle, in G having minimum total cost. Since the traveling salesman problem can be reduced to it, this problem is in general NP-hard. We consider the case where G is the complete graph K{sub n} and investigate the facial structure of the circuit polytope P{sub C}{sup n}, which is the convex hull of the incidence vectors of circuits of K{sub n}. We introduce several new classes of facets, partly obtained from the traveling salesmanmore »« less
All 0-1 polytopes are traveling salesman polytopes

Conference Billera, L ; Sarangarajan, A

We study the facial structure of two important permutation polytopes in R{sup n2}, the Birkhoff or assignment polytope B{sub n}, defined as the convex hull of all n {times} n permutation matrices, and the asymmetric traveling salesman polytope T{sub n}, defined as the convex hull of those n {times} n permutation matrices corresponding to n-cycles. Using an isomorphism between the face lattice of B{sub n} and the lattice of elementary bipartite graphs, we show, for example, that every pair of vertices of B{sub n} is contained in a cubical face, showing faces of B{sub n} to be fairly special 0-1more »« less
Feynman polytopes and the tropical geometry of UV and IR divergences

Journal Article Arkani-Hamed, Nima ; Hillman, Aaron ; Mizera, Sebastian - Physical Review D

We introduce a class of polytopes that concisely capture the structure of UV and IR divergences of general Feynman integrals in Schwinger parameter space, treating them in a unified way as worldline segments shrinking and expanding at different relative rates. While these polytopes conventionally arise as convex hulls - via Newton polytopes of Symanzik polynomials - we show that they also have a remarkably simple dual description as cut out by linear inequalities defining the facets. It is this dual definition that makes it possible to transparently understand and efficiently compute leading UV and IR divergences for any Feynman integral.more »« less
https://doi.org/10.1103/PhysRevD.105.125013
Transforming clique tree inequalities to induce facets for the 2-edge connected polytope

Conference Boyd, S

The 2-edge connected polytope Q{sub 2E}{sup n} is the convex hull of all 0-1 incidence vectors of 2-edge connected spanning subgraphs of the complete graph K{sub n}. This polytope is related to the travelling salesman polytope, which is a face of Q{sub 2E}{sup n}. By exploiting this relationship and applying the theory from Boyd and Pulleyblank (1991), we show how the clique tree inequalities for the traveling salesman polytope can be transformed into a large new class of facet-inducing inequalities for Q{sub 2E}{sup n}. We also discuss how this class can be generalized to include the lifted 2-cover inequalities introducedmore » by Grotschel, Monma and Stoer (1989).« less

Similar Records