Related papers: A constructive method to minimize couple matchings
We introduce a notion of minimal uniform attractor for nonautonomous random dynamical systems, which depends jointly on time and on a random parameter. Several examples are provided to illustrate the concept and to compare it with existing…
A key idea in convex optimization theory is to use well-structured affine functions to approximate general functions, leading to impactful developments in conjugate functions and convex duality theory. This raises the question: what are the…
We describe a framework for random pairwise comparisons matrices, inspired by selected constructions releted to the so called inconsistency reduction of pairwise comparisons (PC) matrices. In to build up structures on random pairwise…
Matching mechanisms play a central role in operations management across diverse fields including education, healthcare, and online platforms. However, experimentally comparing a new matching algorithm against a status quo presents some…
Our study is dedicated to the probabilistic representation and numerical approximation of solutions to coupled systems of variational inequalities. The dynamics of each component of the solution is driven by a different linear parabolic…
We consider three different methods for the coupling of the finite element method and the boundary element method, the Bielak-MacCamy coupling, the symmetric coupling, and the Johnson-N\'ed\'elec coupling. For each coupling we provide…
This paper aims at comparing two coupling approaches as basic layers for building clustering criteria, suited for modularizing and clustering very large networks. We briefly use "optimal transport theory" as a starting point, and a way as…
The mutual information (MI) between two random variables is an important correlation measure in data analysis. The Shannon entropy of a joint probability distribution is the variable part under fixed marginals. We aim to minimize and…
We analyze various uncertainty measures for spatial diffusion processes. In this manifestly non-quantum setting, we focus on the existence issue of complementary pairs whose joint dispersion measure has strictly positive lower bound.
This paper investigates large-population stochastic control problems in which agents share their state information and cooperate to minimize a convex cost functional. The latter is decomposed into individual and coupling costs, with the…
This paper is concerned with the detection of multiple change-points in the joint distribution of independent categorical variables. The procedures introduced rely on model selection and are based on a penalized least-squares criterion.…
Removing the field redefinitions, the Bianchi identities and the total derivative freedoms from the general form of the gauge invariant couplings at order $\ell_p^6$ for the bosonic fields of M-theory, we have found that the minimum number…
A joint mix is a random vector with a constant component-wise sum. The dependence structure of a joint mix minimizes some common objectives such as the variance of the component-wise sum, and it is regarded as a concept of extremal negative…
A simple experimental setup consisting of a spontaneous parametric down-conversion source and passive linear optics is proposed for conditional preparation of a maximally entangled polarization state of two photons. Successful preparation…
In this paper, we introduce a graph matching method that can account for constraints of arbitrary order, with arbitrary potential functions. Unlike previous decomposition approaches that rely on the graph structures, we introduce a…
This paper proposes a numerical method, based on information theoretic ideas, to a class of distributed control problems. As a particular test case, the well-known and numerically "over-mined" problem of decentralized control and implicit…
Computationally efficient solutions for pseudometrics quantifying deviation from topological conjugacy between dynamical systems are presented. Deviation from conjugacy is quantified in a Pareto optimal sense that accounts for spectral…
We study the design of one-to-one matching mechanisms that are strategy-proof for both sides and as stable as possible. Motivated by the impossibility result of Roth (1982), we formulate the mechanism design problem as a linear program that…
We present a novel method for isogeometric analysis (IGA) to directly work on geometries constructed by Boolean operations including difference (i.e., trimming), union and intersection. Particularly, this work focuses on the union…
Removing the field redefinitions, the Bianchi identities and the total derivative freedoms from the general form of gauge invariant NS-NS couplings at order $\alpha'^3$, we have found that the minimum number of independent couplings is 872.…