On best transitive approximations to simple graphs

Abstract

Given any finite graph, which transitive graphs approximate it most closely and how fast can we find them? The answer to this question depends on the concept of “closest approximation” involved. In [8,9] a qualitative concept of best approximation is formulated. Roughly, a qualitatively best transitive approximation of a graph is a transitive graph which cannot be “improved” without also going against the original graph. A quantitative concept of best approximation goes back at least to [10]. A quantitatively best transitive approximation is a transitive graph that makes the minimal number of mistakes against the original graph. In other words, the sum of the edges that are removed from and are added to the original graph is minimal.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,347

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Similar books and articles

Infinitary logics and very sparse random graphs.James F. Lynch - 1997 - Journal of Symbolic Logic 62 (2):609-623.
Twilight graphs.J. C. E. Dekker - 1981 - Journal of Symbolic Logic 46 (3):539-571.
Effective coloration.Dwight R. Bean - 1976 - Journal of Symbolic Logic 41 (2):469-480.
Closer.Rafael De Clercq & Leon Horsten - 2005 - Synthese 146 (3):371 - 393.
The dimension of the negation of transitive closure.Gregory L. McColm - 1995 - Journal of Symbolic Logic 60 (2):392-414.
A condition for transitivity in probabilistic support.Tomoji Shogenji - 2003 - British Journal for the Philosophy of Science 54 (4):613-616.
Isomorphisms and nonisomorphisms of graph models.Harold Schellinx - 1991 - Journal of Symbolic Logic 56 (1):227-249.

Analytics

Added to PP
2009-01-28

Downloads
3 (#1,716,608)

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Author's Profile

Leon Horsten
Universität Konstanz

Citations of this work

Closer.Rafael De Clercq & Leon Horsten - 2005 - Synthese 146 (3):371 - 393.

Add more citations

References found in this work

No references found.

Add more references