arXiv 1007.18972010-07math.CO

The edit distance function and symmetrization

Ryan R. Martin

备注：: 21 pages, 8 figures
发表信息：: Electron. J. Combin. 20(3) (2013), Research Paper 26, 25pp

英文摘要：

The edit distance between two graphs on the same labeled vertex set is the size of the symmetric difference of the edge sets. The distance between a graph, $G$, and a hereditary property, ${\cal H}$, is the minimum of the distance between $G$ and each $G'\in{\cal H}$. The edit distance function of ${\cal H}$ is a function of $p\in[0,1]$ and is the limit of the maximum normalized distance between a graph of density $p$ and ${\cal H}$. This paper develops a method, called localization, for computing the edit distance function of various hereditary properties. For any graph $H$, ${\rm Forb}(H)$ denotes the property of not having an induced copy of $H$. This paper gives some results regarding estimation of the function for an arbitrary hereditary property. This paper also gives the edit distance function for ${\rm Forb}(H)$, where $H$ is a cycle on 9 or fewer vertices.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

On the computation of edit distance functions

The edit distance between two graphs on the same labeled vertex set is the size of the symmetric difference of the edge sets. The edit distance function of the hereditary property, $\mathcal{H}$, is a function of $p\in[0,1]$ and is the limit of the maximum normalized distance between a graph of density $p$ and $\mathcal{H}$. This paper uses the symmetrization method of Sidorenko in order to compute the edit distance function of various hereditary properties. For any graph $H$, ${\rm Forb}(H)$ denotes the property of not having an induced copy of $H$. We compute the edit distance function for $…

2016-05-21math.CO

The edit distance function of some graphs

The edit distance function of a hereditary property $\mathscr{H}$ is the asymptotically largest edit distance between a graph of density $p\in[0,1]$ and $\mathscr{H}$. Denote by $P_n$ and $C_n$ the path graph of order $n$ and the cycle graph of order $n$, respectively. Let $C_{2n}^*$ be the cycle graph $C_{2n}$ with a diagonal, and $\widetilde{C_n}$ be the graph with vertex set $\{v_0, v_1, \ldots, v_{n-1}\}$ and $E(\widetilde{C_n})=E(C_n)\cup \{v_0v_2\}$. Marchant and Thomason determined the edit distance function of $C_6^{*}$. Peck studied the edit distance function of $C_n$, while Berikkyzy…

2018-05-11math.CO

Edit distance and its computation

In this paper, we provide a method for determining the asymptotic value of the maximum edit distance from a given hereditary property. This method permits the edit distance to be computed without using Szemerédi's Regularity Lemma directly. Using this new method, we are able to compute the edit distance from hereditary properties for which it was previously unknown. For some graphs $H$, the edit distance from ${\rm Forb}(H)$ is computed, where ${\rm forb}(H)$ is the class of graphs which contain no induced copy of graph $H$. Those graphs for which we determine the edit distance asymptotically …

2016-05-21math.CO

关于圈幂的编辑距离

On the Edit Distance of Powers of Cycles

在同一个标记顶点集上的两个图之间的编辑距离被定义为边集的对称差的大小。遗传特性$\mathcal{H}$的编辑距离函数是$p\in [0,1]$的函数，其在极限下测量密度$p$和$\mathcal{H}$的图之间的最大归一化编辑距离。在本文中，我们解决了编辑距离函数为$\mbox{Forb}(H)$，其中$H=C_h^t$，$t^{\rm th}$功率的周期长度$h$。对于不能被$t+1$整除的$h\geq 2t(t+1)+1$和$h$，我们确定$p$的所有值的函数。对于可被$t+1$整除的$h\geq 2t(t+1)+1$和$h$，除了小的$p$值之外，对于所有其它值都得到该函数。我们也得到了一些结果，为较小的值的$h$。

2015-09-24math.CO

词可表图和可比图的编辑距离

The edit distance of word-representable and comparability graphs

University of Strathclyde（斯特拉斯克莱德大学）；Iowa State University（爱荷华州立大学）

本文研究了词可表图和可比图的编辑距离，确定了在不同边密度下，这些图类的最大编辑距离函数，并给出了词可表图、k-词可表图以及可比图的编辑距离结果。

2026-05-18math.CO

Multicolor and directed edit distance

The editing of a combinatorial object is the alteration of some of its elements such that the resulting object satisfies a certain fixed property. The edit problem for graphs, when the edges are added or deleted, was first studied independently by the authors and Kézdy [J. Graph Theory (2008), 58(2), 123--138] and by Alon and Stav [Random Structures Algorithms (2008), 33(1), 87--104]. In this paper, a generalization of graph editing is considered for multicolorings of the complete graph as well as for directed graphs. Specifically, the number of edge-recolorings sufficient to be performed on a…

2016-05-21math.CO

更多相关论文收起更多论文

On the editing distance of graphs

An edge-operation on a graph $G$ is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs $\mathcal{G}$, the editing distance from $G$ to $\mathcal{G}$ is the smallest number of edge-operations needed to modify $G$ into a graph from $\mathcal{G}$. In this paper, we fix a graph $H$ and consider ${\rm Forb}(n,H)$, the set of all graphs on $n$ vertices that have no induced copy of $H$. We provide bounds for the maximum over all $n$-vertex graphs $G$ of the editing distance from $G$ to ${\rm Forb}(n,H)$, using an invariant we call the…

2016-05-21math.CO

关于无$K_{2,t}$图的编辑距离II：$t\geq 5$情形

On the edit distance from $K_{2,t}$-free graphs II: Cases $t\geq 5$

同一顶点集上的两个图之间的编辑距离定义为它们的边集的对称差的大小。遗传属性的编辑距离函数$\mathcal{H}$是$p$的函数，并且在该度量下渐近地测量具有从$\mathcal{H}$到$p$的边密度$p$的最远图。编辑距离函数已被证明是难以计算的许多遗传属性。一些令人惊讶的连接到极值图论问题，如强正则图和Zarankiewicz问题，已被发现在试图计算各种编辑距离函数。本文讨论了当$t\geq5$和$t$分别为两个顶点的完全二部图的一个类和另一个类时，完全二部图没有导出副本的遗传性质$\forb(K_{2,t})$.这项工作是作者先前一篇论文的继续。采用各种各样的技术和有色正则图的建设，我们能够延长的间隔，在此期间的编辑距离函数的遗传性是众所周知的，并确定其最大值为所有奇数$t$。我们还探讨了几种结构，以改善已知的上界的功能。

2011-02-19math.CO

Accumulation points of the edit distance function

Given a hereditary property $\mathcal H$ of graphs and some $p\in[0,1]$, the edit distance function $\operatorname{ed}_{\mathcal H}(p)$ is (asymptotically) the maximum proportion of "edits" (edge-additions plus edge-deletions) necessary to transform any graph of density $p$ into a member of $\mathcal H$. For any fixed $p\in[0,1]$, $\operatorname{ed}_{\mathcal H}(p)$ can be computed from an object known as a colored regularity graph (CRG). This paper is concerned with those points $p\in[0,1]$ for which infinitely many CRGs are required to compute $\operatorname{ed}_{\mathcal H}$ on any open int…

2022-02-13math.CO

编辑未标记有序树之间的距离

Edit Distance between Unlabeled Ordered Trees

在单栈可排序排列--避免模式231的排列--和平面树之间存在双射。我们定义了一个编辑之间的排列，这是一致的树之间的标准编辑距离。这种一对一的对应关系产生了一个多项式算法的子置换问题的$(231)$避免置换。此外，我们还得到了有序树与某些特殊有序树之间编辑距离的生成函数。对于一般情况下，我们表明，平面树和所有其他平面树之间的平均编辑距离至少是$n/ln(n)$。一些结果可以扩展到标记树考虑着色Dyck路径或等价着色的一个堆栈可排序排列。

2005-06-27cs.DMmath.CO

广义Turán问题中基于图对称化论证的稳定性

Stability from graph symmetrization arguments in generalized Turán problems

Alfréd Rényi Institute of Mathematics（阿尔弗雷德·雷尼数学研究所）；Department of Computer Science and Information Theory, Faculty of Electrical Engineering and Informatics, Budapest University of Technology and Economics（布达佩斯科技大学电气与信息工程学院计算机科学与信息论系）

本文在广义Turán问题中，通过图对称化论证证明了完全多部图、任意图、二分图分别满足相关Turán稳定性性质，正面回答了特定问题，为该领域提供了稳定性相关的新结论。

2026-08-31math.CO

两条随机字符串之间平均编辑距离的上界

Upper bounds on the average edit distance between two random strings

本文采用Lueker技术改进了两条随机字符串平均编辑距离的已知上界，特别是针对小字母表的所有已知上界，同时提供了一种新实现来改进除大小为2和4外所有小字母表上最长公共子序列平均长度的下界。

2024-07-25cs.DMmath.CO

一种针对带抽象权重的树的持久性驱动编辑距离

A Persistence-Driven Edit Distance for Trees with Abstract Weights

本文面向带抽象边权的树，提出一种受持久性与拓扑数据分析启发的新型编辑距离，给出持久集示例，并说明其可用动态二元线性规划计算。

2025-07-24math.ATmath.CO

一种用于定义在合并树上的函数的有限稳定编辑距离

A Finitely Stable Edit Distance for Functions Defined on Merge Trees

本文提出一种比较不同合并树上函数的稳定编辑距离，可通过动态二进制线性规划计算，并在模拟数据上验证其适用于持久性图失效的TDA场景。

2025-07-24math.ATmath.CO

On the edit distance function of the random graph

Given a hereditary property of graphs $\mathcal{H}$ and a $p\in [0,1]$, the edit distance function ${\rm ed}_{\mathcal{H}}(p)$ is asymptotically the maximum proportion of edge-additions plus edge-deletions applied to a graph of edge density $p$ sufficient to ensure that the resulting graph satisfies $\mathcal{H}$. The edit distance function is directly related to other well-studied quantities such as the speed function for $\mathcal{H}$ and the $\mathcal{H}$-chromatic number of a random graph. Let $\mathcal{H}$ be the property of forbidding an Erdős-Rényi random graph $F\sim \mathbb{G}(n_0,p_0…

2020-07-16math.COmath.PR

Trace Reconstruction with Bounded Edit Distance

The trace reconstruction problem studies the number of noisy samples needed to recover an unknown string $\boldsymbol{x}\in\{0,1\}^n$ with high probability, where the samples are independently obtained by passing $\boldsymbol{x}$ through a random deletion channel with deletion probability $q$. The problem is receiving significant attention recently due to its applications in DNA sequencing and DNA storage. Yet, there is still an exponential gap between upper and lower bounds for the trace reconstruction problem. In this paper we study the trace reconstruction problem when $\boldsymbol{x}$ is c…

2021-04-14cs.ITmath.COmath.IT