Related papers: Cubature formulas on combinatorial graphs
In this paper, we study the computation of curvatures at the singular points of algebraic curves and surfaces. The idea is to convert the problem to compute the curvatures of the corresponding regular parametric curves and surfaces, which…
Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…
Sharp quadrature formulas for integrals of complex rational functions on circles, real axis and its segments are obtained. We also find sharp quadrature formulas for calculation of $L_2$-norms of rational functions on such sets. Basing on…
Inspired by notorious combinatorial optimization problems on graphs, in this paper we consider a series of related problems defined using a metric space and topology determined by a graph. Particularly, we present the Independent Set,…
Cubature formulas (CFs) based on radial basis functions (RBFs) have become an important tool for multivariate numerical integration of scattered data. Although numerous works have been published on such RBF-CFs, their stability theory can…
We consider the problem of finding universal bounds of "isoperimetric" or "isodiametric" type on the spectral gap of the Laplacian on a metric graph with natural boundary conditions at the vertices, in terms of various analytical and…
In this paper we study a construction of algebraic curves from combinatorial data. In the study of algebraic curves through degeneration, graphs usually appear as the dual intersection graph of the central fiber. Properties of such graphs…
We provide a necessary and sufficient condition for existence of Gaussian cubature formulas. It consists of checking whether some overdetermined linear system has a solution and so complements Mysovskikh's theorem which requires computing…
Bayesian cubature provides a flexible framework for numerical integration, in which a priori knowledge on the integrand can be encoded and exploited. This additional flexibility, compared to many classical cubature methods, comes at a…
Our main interest in this paper is to study some approximation problems for classes of functions with mixed smoothness. We use technique, based on a combination of results from hyperbolic cross approximation, which were obtained in 1980s --…
Positive interpolatory cubature formulas (CFs) are constructed for quite general integration domains and weight functions. These CFs are exact for general vector spaces of continuous real-valued functions that contain constants. At the same…
73 new cubature rules are found for three standard multidimensional integrals with spherically symmetric regions and weights, using direct search with a numerical zero-finder. All but four of the new rules have fewer integration points than…
We derive new formulas for the high dimensional biharmonic potential acting on Gaussians or Gaussians times special polynomials. These formulas can be used to construct accurate cubature formulas of an arbitrary high order which are fast…
In this paper, we propose a closed-form solution to the inverse problem in interpolation with periodic uniform B-spline curves. This solution is obtained by modifying the one we have established to a similar problem with relaxed uniform…
Graphs are closely related to quantum error-correcting codes: every stabilizer code is locally equivalent to a graph code, and every codeword stabilized code can be described by a graph and a classical code. For the construction of good…
In this paper, an efficient numerical technique for the time-fractional telegraph equation is proposed. The aim of this paper is to use a relatively new type of B-spline called the cubic trigonometric B-splines for the proposed scheme. This…
The aim of this paper is to derive on the basis of the Euler's formula several analytical relations which hold for certain classes of planar graphs and which can be useful in algorithmic graph theory.
Graph Laplacians on finite compact metric graphs are considered under the assumption that the matching conditions at the graph vertices are of either $\delta$ or $\delta'$ type. In either case, an infinite series of trace formulae which…
In this paper, we establish a simple formula for computing the Lin-Lu-Yau Ricci curvature on graphs. For any edge $xy$ in a simple locally finite graph $G$, the curvature $\kappa(x,y)$ can be expressed as a cost function of an optimal…
The family Blow Up formula is recalled. Certain combinatoric graphs are introduced for the discussion of the counting of nodal curves on an Kahler surface.