Logical indetermination coupling:a method to minimize drawing matches and its applications - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2020

Logical indetermination coupling:a method to minimize drawing matches and its applications

Résumé

While justifying that independence is a canonic coupling, the authors show the existence of a second equilibrium to reduce the information conveyed from the margins to the joined distribution: the so-called indetermination. They use this null information property to apply indetermination to graph clustering. Furthermore, they break down a drawing under indetermination to emphasis it is the best construction to reduce couple matchings, meaning, the expected number of equal couples drawn in a row. Using this property, they notice that indetermination appears in two problems (Guessing and Task Partitioning) where couple matchings reduction is a key objective.
Fichier principal
Vignette du fichier
article.pdf (369.01 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03086553 , version 1 (22-12-2020)
hal-03086553 , version 2 (27-02-2022)
hal-03086553 , version 3 (13-02-2023)

Identifiants

Citer

Pierre Bertrand, Michel Broniatowski, Jean-François Marcotorchino. Logical indetermination coupling:a method to minimize drawing matches and its applications. 2020. ⟨hal-03086553v1⟩
132 Consultations
76 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More