Geodesic
Polytopes from Subgraph Statistics
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011), DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011) (2011).

Voir la notice de l'article provenant de la source Episciences

We study polytopes that are convex hulls of vectors of subgraph densities. Many graph theoretical questions can be expressed in terms of these polytopes, and statisticians use them to understand exponential random graph models. Relations among their Ehrhart polynomials are described, their duals are applied to certify that polynomials are non-negative, and we find some of their faces. For the general picture we inscribe cyclic polytopes in them and calculate volumes. From the volume calculations we conjecture that a variation of the Selberg integral indexed by Schur polynomials has a combinatorial formula. We inscribe polynomially parametrized sets, called curvy zonotopes, in the polytopes and show that they approximate the polytopes arbitrarily close. 
@article{DMTCS_2011_special_260_a25,
     author = {Engstr\"om, Alexander and Nor\'en, Patrik},
     title = {Polytopes from {Subgraph} {Statistics}},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)},
     year = {2011},
     doi = {10.46298/dmtcs.2912},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2912/}
}
TY  - JOUR
AU  - Engström, Alexander
AU  - Norén, Patrik
TI  - Polytopes from Subgraph Statistics
JO  - Discrete mathematics & theoretical computer science
PY  - 2011
VL  - DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2912/
DO  - 10.46298/dmtcs.2912
LA  - en
ID  - DMTCS_2011_special_260_a25
ER  - 
%0 Journal Article
%A Engström, Alexander
%A Norén, Patrik
%T Polytopes from Subgraph Statistics
%J Discrete mathematics & theoretical computer science
%D 2011
%V DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2912/
%R 10.46298/dmtcs.2912
%G en
%F DMTCS_2011_special_260_a25
Engström, Alexander; Norén, Patrik. Polytopes from Subgraph Statistics. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011), DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011) (2011). doi : 10.46298/dmtcs.2912. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2912/

Cité par Sources :