Facets of random symmetric edge polytopes, degree sequences, and clustering
DOI10.46298/DMTCS.9925zbMATH Open1546.05129MaRDI QIDQ6599799FDOQ6599799
Authors: Benjamin Braun, Matthew Kahle 
Publication date: 6 September 2024
Published in: Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)
Random graphs (graph-theoretic aspects) (05C80) Planar graphs; geometric and topological aspects of graph theory (05C10) (n)-dimensional polytopes (52B11) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20)
Cites Work
- Title not available (Why is that?)
- Collective dynamics of `small-world' networks
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. Uniqueness
- 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
- Title not available (Why is that?)
- On the Gamma-Vector of Symmetric Edge Polytopes
- Networks
- Configuring random graph models with fixed degree sequences
- The \(h^\ast\)-polynomials of locally anti-blocking lattice polytopes and their \(\gamma\)-positivity
- Arithmetic aspects of symmetric edge polytopes
- Counting Equilibria of the Kuramoto Model Using Birationally Invariant Intersection Index
- Many faces of symmetric edge polytopes
- Title not available (Why is that?)
- Facets and facet subgraphs of symmetric edge polytopes
- Symmetric edge polytopes and matching generating polynomials
This page was built for publication: Facets of random symmetric edge polytopes, degree sequences, and clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6599799)
