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

12/29/2020
by   Pierre Bertrand, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/27/2021

One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons

We consider the problem of drawing an outerplanar graph with n vertices ...
research
12/11/2018

Bundled Crossings Revisited

An effective way to reduce clutter in a graph drawing that has (many) cr...
research
12/19/2017

Asymptotic Coupling and Its Applications in Information Theory

A coupling of two distributions P_X and P_Y is a joint distribution P_XY...
research
06/15/2023

Minimizing an Uncrossed Collection of Drawings

In this paper, we introduce the following new concept in graph drawing. ...
research
07/25/2023

Upward Planarity Testing of Biconnected Outerplanar DAGs Solves Partition

We show an O(n)-time reduction from the problem of testing whether a mul...
research
05/04/2021

Continuous indetermination and average likelihood minimization

The authors transpose a discrete notion of indetermination coupling in t...

Please sign up or login with your details

Forgot password? Click here to reset