Related papers: Cubature formulas on combinatorial graphs

We introduce and investigate generalizations of interval and proper interval graphs to simplicial complexes, including strong interval, unit interval, and under closed variants. Through equivalent combinatorial and algebraic…

We consider three variants of the problem of finding a maximum weight restricted $2$-matching in a subcubic graph $G$. (A $2$-matching is any subset of the edges such that each vertex is incident to at most two of its edges.) Depending on…

We define pure graphs, invertible graphs, and the notion of complementation of bicoloured graphs. The study of pure graphs is motivated by two conjectures about the transition systems of eulerian graphs and by the Cycle Double Cover…

We establish the connection between a recent new construction technique for quantum error correcting codes, based on graphs, and the so-called stabilizer codes: Each stabilizer code can be realized as a graph code and vice versa.

Graphlet analysis is an approach to network analysis that is particularly popular in bioinformatics. We show how to set up a system of linear equations that relate the orbit counts and can be used in an algorithm that is significantly…

We obtain cubature formulas of volume potentials over bounded domains combining the basis functions introduced in the theory of approximate approximations with their integration over the tangential-halfspace. Then the computation is reduced…

We present a complete computational classification of the combinatorial types of hyperplane sections, or slices, of the regular cube up to dimension six. For each dimension, we determine the exact number of distinct combinatorial types.…

Vertex scaling of piecewise linear metrics on surfaces introduced by Luo is a straightforward discretization of smooth conformal structures on surfaces. Combinatorial $\alpha$-curvature for vertex scaling of piecewise linear metrics on…

We introduce two novel evolutionary formulations of the problem of coloring the nodes of a graph. The first formulation is based on the relationship that exists between a graph's chromatic number and its acyclic orientations. It views such…

We suggest a combinatorial classification of metric filtrations in measure spaces; a complete invariant of such a filtration is its combinatorial scheme, a measure on the space of hierarchies of the group~$\mathbb Z$. In turn, the notion of…

Laplace operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. Assuming rational independence of edge lengths, necessary and sufficient…

Active contour models based on partial differential equations have proved successful in image segmentation, yet the study of their geometric formulation on arbitrary geometric graphs is still at an early stage. In this paper, we introduce…

In this note, we intend to produce all latin squares from one of them using suitable move which is defined by small trades and do the similar work on 4-cycle systems. These problems, reformulate as finding basis for the kernel of special…

Based on a novel point of view on 1-dimensional Gaussian quadrature, we present a new approach to the computation of d-dimensional cubature formulae. It is well known that the nodes of 1-dimensional Gaussian quadrature can be computed as…

We are concerned with a stochastic mean curvature flow of graphs with extra force over a periodic domain of any dimension. Based on compact embedding method of variational SPDE, we prove the existence of martingale solution. Moreover, we…

We constructed linear algorithms of sampling recovery and cubature formulas on Smolyak grids parametrized by $m \in \mathbb{N}$ of periodic $d$-variate functions having Lipschitz-H\"older mixed smoothness $\alpha > 0$ based on B-spline…

Submodular functions are a fundamental object of study in combinatorial optimization, economics, machine learning, etc. and exhibit a rich combinatorial structure. Many subclasses of submodular functions have also been well studied and…

We present two cubature on Wiener space algorithms for the numerical solution of McKean-Vlasov SDEs with smooth scalar interaction. The analysis hinges on sharp gradient to time-inhomogeneous parabolic PDEs bounds. These bounds may be of…

In this paper, we propose a perturbation framework to measure the robustness of graph properties. Although there are already perturbation methods proposed to tackle this problem, they are limited by the fact that the strength of the…

In this paper, we investigate the prescribed curvature problem associated with a special Lin-Lu-Yau curvature on finite graphs of girth at least 6. We define the corresponding Calabi flow for this curvature type, and establish an equivalent…