On best transitive approximations to simple graphs
Given any ﬁnite graph, which transitive graphs approximate it most closely and how fast can we ﬁnd 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 . 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.
|Keywords||No keywords specified (fix it)|
No categories specified
(categorize this paper)
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Infinitary Logics and Very Sparse Random Graphs.James F. Lynch - 1997 - Journal of Symbolic Logic 62 (2):609-623.
The Dimension of the Negation of Transitive Closure.Gregory L. McColm - 1995 - Journal of Symbolic Logic 60 (2):392-414.
Transitive Indistinguishability and Approximate Measurement with Standard Finite Ratio-Scale Representations.Patrick Suppes - 2006 - Journal of Mathematical Psychology 50:329-336.
On Some Putative Graph-Theoretic Counterexamples to the Principle of the Identity of Indiscernibles.Rafael De Clercq - 2012 - Synthese 187 (2):661-672.
A Condition for Transitivity in Probabilistic Support.Tomoji Shogenji - 2003 - British Journal for the Philosophy of Science 54 (4):613-616.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads3 ( #700,438 of 2,171,798 )
Recent downloads (6 months)0
How can I increase my downloads?