相关论文: Discrete Mixed Quantization

Vertex bisection is a graph partitioning problem in which the aim is to find a partition into two equal parts that minimizes the number of vertices in one partition set that have a neighbor in the other set. We are interested in giving…

In this paper we consider a mixed boundary value problem with a nonhomogeneous, nonlinear differential operator (called double phase operator), a nonlinear convection term (a reaction term depending on the gradient), three multivalued terms…

We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global…

Within the mode-coupling theory (MCT) of the glass transition, we reconsider the numerical schemes to evaluate the MCT functional. Here we propose nonuniform discretizations of the wave number, in contrast to the standard equidistant grid,…

We define a graph-based rate optimization problem and consider its computation, which provides a unified approach to the computation of various theoretical limits, including the (conditional) graph entropy, rate-distortion functions and…

In theory, diffusion curves promise complex color gradations for infinite-resolution vector graphics. In practice, existing realizations suffer from poor scaling, discretization artifacts, or insufficient support for rich boundary…

A modified gamma kernel should not be automatically preferred to the standard gamma kernel, especially for univariate convex densities with a pole at the origin. In the multivariate case, multiple combined gamma kernels, defined as a…

The Hamiltonian theory of zero-curvature equations with spectral parameter on an arbitrary compact Riemann surface is constructed. It is shown that the equations can be seen as commuting flows of an infinite-dimensional field generalization…

This paper studies the large sample asymptotics of data analysis procedures based on the optimization of functionals defined on $k$-NN graphs on point clouds. The paper is framed in the context of minimization of balanced cut functionals,…

We present a new application of harmonic analysis to quantum information by constructing intriguing classes of quantum channels stemming from specific representations of multiplier algebras over locally compact groups $G$. Beginning with a…

We analyze spectral properties of a quantum graph in the form of a ring chain with a $\delta$ coupling in the vertices exposed to a homogeneous magnetic field perpendicular to the graph plane. We find the band spectrum in the case when the…

One of the most promising applications of quantum computing is simulating quantum many-body systems. However, there is still a need for methods to efficiently investigate these systems in a native way, capturing their full complexity. Here,…

Combinatorial discrepancy is a complexity measure of a collection of sets which quantifies how well the sets in the collection can be simultaneously balanced. More precisely, we are given an n-point set $P$, and a collection $\mathcal{F} =…

In this paper we study "discrete polynomial blending," a term used to define a certain discretized version of curve blending whereby one approximates from the "sum of tensor product polynomial spaces" over certain grids. Our strategy is to…

We study right limits of the Bergman Shift matrix. Our results have applications to ratio asymptotics, weak asymptotic measures, relative asymptotics, and zero counting measures of the orthogonal and orthonormal polynomials.

This paper introduces a graph Laplacian regularization in the hyperspectral unmixing formulation. The proposed regularization relies upon the construction of a graph representation of the hyperspectral image. Each node in the graph…

We develop graph-based methods for semi-supervised learning based on label propagation on a data similarity graph. When data is abundant or arrive in a stream, the problems of computation and data storage arise for any graph-based method.…

This paper addresses the problem of separating spectral sources which are linearly mixed with unknown proportions. The main difficulty of the problem is to ensure the full additivity (sum-to-one) of the mixing coefficients and…

We consider Calderon's problem for the connection Laplacian on a real-analytic vector bundle over a manifold with boundary. We prove a uniqueness result for this problem when all geometric data are real-analytic, recovering the topology and…

Representations of certain vertex algebras, here called of CohFT-type, can be used to construct vector bundles of coinvariants and conformal blocks on moduli spaces of stable curves [DGT2]. We show that such bundles define semisimple…