Related papers: Different Volume Computation Methods of Graph Poly…
For an elliptic problem with two space dimensions, we propose to formulate the finite volume method with the help of Petrov-Galerkin mixed finite elementsthat are based on the building of a dual Raviart-Thomas basis.
We introduce Random Projection Flows (RPFs), a principled framework for injective normalizing flows that leverages tools from random matrix theory and the geometry of random projections. RPFs employ random semi-orthogonal matrices, drawn…
This manuscript presents a general recursive formula to estimate the size of fibers associated with algebraic maps from graphs to summary statistics of importance for social network analysis, such as number of edges (graph density), degree…
Two variants of the MCV3 scheme are presented based on a flux reconstruction formulation. Different from the original multi-moment constrained finite volume method of third order (MCV3), the multi-moment constraints are imposed at the cell…
This paper proposes a new volume function for calculation of the entropy of planar granular assemblies. This function is extracted from the antisymmetric part of a new geometric tensor and is rigorously additive when summed over grains. It…
A new multi-frequency synthesis algorithm for reconstructing images from multi-frequency VLBI data is proposed. The algorithm is based on a generalized maximum-entropy method, and makes it possible to derive an effective spectral correction…
We consider the problem of molecular graph generation using deep models. While graphs are discrete, most existing methods use continuous latent variables, resulting in inaccurate modeling of discrete graph structures. In this work, we…
We introduce the notion of volume of the representation variety of a finitely presented discrete group in a compact Lie group using the push-forward measure associated to a map defined by a presentation of the discrete group. We show that…
The convex hull of N independent random points chosen on the boundary of a simple polytope in R^n is investigated. Asymptotic formulas for the expected number of vertices and facets, and for the expectation of the volume difference are…
The univariate Ehrhart and $h^*$-polynomials of lattice polytopes have been widely studied. We describe methods from toric geometry for computing multivariate versions of volume, Ehrhart and $h^*$-polynomials of lattice polytropes, which…
The volume of a Meissner polyhedron is computed in terms of the lengths of its dual edges. This allows to reformulate the Meissner conjecture regarding constant width bodies with minimal volume as a series of explicit finite dimensional…
We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…
Polytopes from subgraph statistics are important in applications and conjectures and theorems in extremal graph theory can be stated as properties of them. We have studied them with a view towards applications by inscribing large explicit…
Many graph polynomials, such as the Tutte polynomial, the interlace polynomial and the matching polynomial, have both a recursive definition and a defining subset expansion formula. In this paper we present a general, logic-based framework…
We give a method for computing asymptotic formulas and approximations for the volumes of spectrahedra, based on the maximum-entropy principle from statistical physics. The method gives an approximate volume formula based on a single convex…
In this article, we present a constructive method for computing the frame coefficients of finite wavelet frames over prime fields using tools from computational harmonic analysis and group theory.
In this work, we find an explicit expression for the volume of the trace nonnegative polytope via a generalization of the Irwin-Hall distribution. This volume is an upper bound for the volume of all projected, normalized realizable spectra.…
We present an efficient numerical scheme based on Monte Carlo integration to approximate statistical solutions of the incompressible Euler equations. The scheme is based on finite volume methods, which provide a more flexible framework than…
Finite difference method and finite element method are popular methods for solving groundwater flow equations. This paper presents a new method that uses gradually varied functions to solve such equation. In this paper, we have established…
This manuscript introduces a finite collection of generalized permutohedra associated to a simple graph. The first polytope of this collection is the graphical zonotope of the graph and the last is the graph-associahedron associated to it.…