相关论文: Discrete Mixed Quantization

We show an asymptotic estimate for the number of labelled planar graphs on $n$ vertices. We also find limit laws for the number of edges, the number of connected components, and other parameters in random planar graphs.

The graph isomorphism problem remains a fundamental challenge in computer science, driving the search for efficient decision algorithms. Due to its ambiguous computational complexity, heuristic approaches such as simulated annealing are…

Two types of errors can occur when discriminating pairs of quantum states. Asymmetric state discrimination involves minimizing the probability of one type of error, subject to a constraint on the other. We give explicit expressions bounding…

While several methods for predicting uncertainty on deep networks have been recently proposed, they do not readily translate to large and complex datasets. In this paper we utilize a simplified form of the Mixture Density Networks (MDNs) to…

In this paper, we present the extended dissipaton theory, including the dissipaton-equation-of-motion formalism and the equivalent dissipaton-embedded quantum master equation. These are exact, non-Markovian, and non-perturbative theories,…

Analytic combinatorics in several variables refers to a suite of tools that provide sharp asymptotic estimates for certain combinatorial quantities. In this paper, we apply these tools to determine the Gilbert-Varshamov (GV) bound for the…

The multiple-Dirichlet-to-Neumann (multiple-DtN) non-reflecting boundary condition is adapted to acoustic scattering from obstacles embedded in the half-plane. The multiple-DtN map is coupled with the method of images as an alternative…

Rigid graph theory is an active area with many open problems, especially regarding embeddings in $\mathbb{R}^d$ or other manifolds, and tight upper bounds on their number for a given number of vertices. Our premise is to relate the number…

In this paper we propose a new approach to detect clusters in undirected graphs with attributed vertices. We incorporate structural and attribute similarities between the vertices in an augmented graph by creating additional vertices and…

In this paper, we present a distributed algorithm utilizing the proximal alternating direction method of multipliers (ADMM) in conjunction with sequential constraint tightening to address mixed-integer quadratic programming (MIQP) problems…

We consider monotone variational inequality (VI) problems in multi-GPU settings where multiple processors/workers/clients have access to local stochastic dual vectors. This setting includes a broad range of important problems from…

We present a technique novel in numerical methods. It compiles the domain of the numerical methods as a discretized volume. Congruent elements are glued together to compile the domain over which the solution of a boundary value problem of a…

The quantization of vector bundles is defined. Examples are constructed for the well controlled case of equivariant vector bundles over compact coadjoint orbits. (Coadjoint orbits are symplectic spaces with a transitive, semisimple symmetry…

The extended Davis-Kahan theorem makes use of polynomial matrix transformations to produce bounds at least as tight as the standard Davis-Kahan theorem. The optimization problem of finding transformation parameters resulting in optimal…

The aim of the paper is to address the behavior in large population of diffusions interacting on a random, possibly diluted and inhomogeneous graph. This is the natural continuation of a previous work, where the homogeneous Erd\H os-R\'enyi…

We present a study on asymptotically compatible Galerkin discretizations for a class of parametrized nonlinear variational problems. The abstract analytical framework is based on variational convergence, or Gamma-convergence. We demonstrate…

In hyperspectral images, some spectral bands suffer from low signal-to-noise ratio due to noisy acquisition and atmospheric effects, thus requiring robust techniques for the unmixing problem. This paper presents a robust supervised spectral…

Gradient schemes is a framework which enables the unified convergence analysis of many different methods -- such as finite elements (conforming, non-conforming and mixed) and finite volumes methods -- for $2^{\rm nd}$ order diffusion…

A mixed Dirichlet-Neumann problem is regularized with a family of singularly perturbed Neumann-Robin boundary problems, parametrized by $\varepsilon > 0$. Using an asymptotic development by Gamma-convergence, the asymptotic behavior of the…

This paper proposes a Mixed-Integer Linear Programming approach for the Soft Graph Clustering Problem. This is the first method that simultaneously allocates membership proportion for vertices that lie in multiple clusters, and that…