Facets of random symmetric edge polytopes, degree sequences, and clustering

DOI10.46298/dmtcs.9925zbMATH Open1546.05129MaRDI QIDQ6599799

Unnamed Author, Matthew Kahle, Benjamin Braun

Publication date: 6 September 2024

Published in: Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

zbMATH Keywords

facetsclustering metricstype PV adjacency polytopes

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) (n)-dimensional polytopes (52B11) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smooth Fano polytopes whose Ehrhart polynomial has a root with large real part
• Smooth Fano polytopes arising from finite directed graphs
• Roots of Ehrhart polynomials arising from graphs
• The power of pyramid decomposition in Normaliz
• The \(h^\ast\)-polynomials of locally anti-blocking lattice polytopes and their \(\gamma\)-positivity
• Many faces of symmetric edge polytopes
• Facets and facet subgraphs of symmetric edge polytopes
• Counting Equilibria of the Kuramoto Model Using Birationally Invariant Intersection Index
• Networks
• Configuring Random Graph Models with Fixed Degree Sequences
• Symmetric edge polytopes and matching generating polynomials
• Collective dynamics of ‘small-world’ networks
• ARITHMETIC ASPECTS OF SYMMETRIC EDGE POLYTOPES
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. Uniqueness
• On the Gamma-Vector of Symmetric Edge Polytopes

This page was built for publication: Facets of random symmetric edge polytopes, degree sequences, and clustering