首页/论文/2001.06422

arXiv 2001.064222020-01-17cs.DS

An efficient sampling algorithm for difficult tree pairs

Sean Cleary, Roland Maio

备注：: 16 pages, 2 figures

英文摘要：

It is an open question whether there exists a polynomial-time algorithm for computing the rotation distances between pairs of extended ordered binary trees. The problem of computing the rotation distance between an arbitrary pair of trees, (S, T), can be efficiently reduced to the problem of computing the rotation distance between a difficult pair of trees (S', T'), where there is no known first step which is guaranteed to be the beginning of a minimal length path. Of interest, therefore, is how to sample such difficult pairs of trees of a fixed size. We show that it is possible to do so efficiently, and present such an algorithm that runs in time $O(n^4)$.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

Counting difficult tree pairs with respect to the rotation distance problem

Rotation distance between rooted binary trees is the minimum number of simple rotations needed to transform one tree into the other. Computing the rotation distance between a pair of rooted trees can be quickly reduced in cases where there is a common edge between the trees, or where a single rotation introduces a common edge. Tree pairs which do not have such a reduction are difficult tree pairs, where there is no generally known first step. Here, we describe efforts to count and estimate the number of such difficult tree pairs, and find that the fraction decreases exponentially fast toward z…

2020-03-04cs.DS

Unbiased and Efficient Sampling of Dependency Trees

DeepMind（深度思维）

Most computational models of dependency syntax consist of distributions over spanning trees. However, the majority of dependency treebanks require that every valid dependency tree has a single edge coming out of the ROOT node, a constraint that is not part of the definition of spanning trees. For this reason all standard inference algorithms for spanning trees are suboptimal for inference over dependency trees. Zmigrod et al. (2021b) proposed algorithms for sampling with and without replacement from the dependency tree distribution that incorporate the single-root constraint. In this paper we …

2022-11-28cs.CLcs.DS

SDDM矩阵的保行列式稀疏化及其在生成树计数和抽样中的应用

Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning Trees

我们表明，频谱稀疏化例程的变体可以保持图的总生成树计数，这是基尔霍夫的矩阵树定理，相当于一个图的拉普拉斯小调，或等价的，任何SDDM矩阵的行列式。我们的分析利用这种组合连接来桥接统计杠杆分数/有效阻力和随机图分析[Janson，Combinatorics，Probability and Computing '94]。这导致了一个例程，在二次时间内，以保持行列式和生成树分布的方式将图稀疏化到大约$n^{1.5}$边（假设稀疏化的图被视为随机对象）。扩展该算法的工作与舒尔补充和近似Choleksy因子分解导致算法的计数和采样生成树，这是近最佳的稠密图。我们给出了一个算法，计算一个$(1 \pm δ)$近似的行列式的任何SDDM矩阵具有恒定的概率在约$n^2 δ^{-2}$时间。这是图的第一个例程，它在计算任意矩阵的行列式时优于通用例程。我们还给出了一个算法，在大约$n^2 δ^{-2}$的时间生成的一个加权无向图的生成树从分布的总变化距离为$δ$从$w$ -均匀分布。

2017-05-02cs.DS

不采样树的树加权划分采样

Sampling Tree-Weighted Partitions Without Sampling Trees

Claremont McKenna College（克莱蒙特麦肯纳学院）；Yale University（耶鲁大学）；Carnegie Mellon University（卡内基梅隆大学）

本文提出一种新的算法，用于大规模平面图的树加权划分采样，无需先采样树。算法在平面图上具有线性时间复杂度，优于现有方法。

2026-05-07cs.DMcs.DSmath.CO

通过完整方程对二元树和一元-二元树进行高效随机抽样

Efficient random sampling of binary and unary-binary trees via holonomic equations

我们提出了一个新的均匀随机抽样器的二叉树与$n$内部节点消耗$2n + Θ(\log(n)^2)$随机位的平均。这使得它是准最优的，并且优于经典的Remy算法。我们还提出了一个采样器的一元二叉树的$n$节点采取$Θ(n)$随机位的平均。这两个算法都是第一个线性时间算法是最佳的常数。

2014-01-07cs.DSmath.CO

计算、生成和采样树对齐

Counting, generating and sampling tree alignments

成对有序树比对是RNA二级结构比较中出现的组合对象。然而，通常表示的树比对作为超树是模糊的，即两个不同的超树可能会导致相同的树对之间的匹配相同的集合。这种模糊性是没有信息的，对任何概率分析都是有害的。我们的第一个结果是一个精确的渐近枚举的树对齐，从上下文无关的语法通过基本的分析组合学。我们的第二个结果集中在两个给定的有序树$S$和$T$之间的比对。通过改进我们的语法来对齐特定的树，我们得到了一个分解方案的对齐空间，并使用它来设计一个有效的动态规划算法的吉布斯-玻尔兹曼概率分布下的抽样对齐。这推广了现有的树比对算法，并打开了门的概率分析的空间次优RNA二级结构的比对。

2016-03-07cs.DSq-bio.QM

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

Binary Decision Diagrams: from Tree Compaction to Sampling

Any Boolean function corresponds with a complete full binary decision tree. This tree can in turn be represented in a maximally compact form as a direct acyclic graph where common subtrees are factored and shared, keeping only one copy of each unique subtree. This yields the celebrated and widely used structure called reduced ordered binary decision diagram (ROBDD). We propose to revisit the classical compaction process to give a new way of enumerating ROBDDs of a given size without considering fully expanded trees and the compaction step. Our method also provides an unranking procedure for th…

2020-05-24cs.DSmath.CO

VAC：一种基于体积采样的近似Cholesky分解消去规则

VAC: A Volume-sampling-based Elimination Rule for Approximate Cholesky Factorization

本文提出VAC采样规则，通过均匀随机生成树减少近似Cholesky分解的填充，保留理论保证并支持线性时间与对数深度并行。

2026-09-25cs.DS

广播拥堵 clique 模型中的快速生成树采样

Fast Spanning Tree Sampling in Broadcast Congested Clique

Stanford University（斯坦福大学）

本文提出了一种在广播拥堵 clique 模型中以 polylogarithmic 轮数采样随机生成树的算法，其总变差距离不超过 O(n^{-c})，并优于之前的最佳算法。

2026-03-26cs.DCcs.DS

随机生成树采样的量子加速

Quantum Speedup for Sampling Random Spanning Trees

本文提出一种量子算法，在$\widetilde{O}(\sqrt{mn})$时间内采样加权图的随机生成树，实现亚线性运行时间并超越经典最优算法，同时证明其最优性，展示了量子计算在基本图采样问题中的加速潜力。

2025-04-24cs.DSquant-ph

比矩阵乘法更快的随机生成树抽样

Sampling Random Spanning Trees Faster than Matrix Multiplication

我们提出了一个算法，以高概率，生成一个随机生成树从边加权无向图在$\tilde{O}(n^{4/3}m^{1/2}+n^{2})$时间（$\tilde{O}(\cdot)$符号隐藏$\operatorname{polylog}(n)$因素）。树是从一个分布中采样的，其中每棵树的概率与其边权重的乘积成比例。这改进了以前的最佳算法，由于Colbourn等人。运行在矩阵乘法时间，$O(n^ω)$。对于未加权图的特殊情况，这改进了$m \gg n^{5/3}$的$\tilde{O}(\min\{n^ω,m\sqrt{n},m^{4/3}\})$的最佳先前已知的运行时间（Colbourn等人，'96，Kelner-Madry '09，Madry等人，'15）。有效电阻度量对我们的算法至关重要，正如Madry等人的工作一样，但是我们避开了先前算法所使用的基于行列式和基于随机游走的技术。相反，我们的算法是基于高斯消除，以及有效电阻被保留在图中的事实，从消除顶点的子集（称为舒尔补）。作为我们的算法的一部分，我们展示了如何计算$ε$ -近似有效电阻的一组$S$顶点对通过近似舒尔补充$\tilde{O}(m+(n + |S|)ε^{-2})$时间，而不使用约翰逊-林登施特劳斯引理，需要$\tilde{O}( \min\{(m + |S|)ε^{-2}, m+nε^{-4} +|S|ε^{-2}\})$…

2017-06-20cs.DS

Communication-Efficient Weighted Sampling and Quantile Summary for GBDT

Hong Kong University of Science and Technology（香港科技大学）

Gradient boosting decision tree (GBDT) is a powerful and widely-used machine learning model, which has achieved state-of-the-art performance in many academic areas and production environment. However, communication overhead is the main bottleneck in distributed training which can handle the massive data nowadays. In this paper, we propose two novel communication-efficient methods over distributed dataset to mitigate this problem, a weighted sampling approach by which we can estimate the information gain over a small subset efficiently, and distributed protocols for weighted quantile problem us…

2019-09-17cs.DScs.LG

标记边游走：一种用于图划分采样的新型MCMC算法

The Marked Edge Walk: A Novel MCMC Algorithm for Sampling of Graph Partitions

Department of Mathematics, Dartmouth College（数学系，达特茅斯学院）；Department of Mathematics and Statistics, Vassar College（数学与统计学系，瓦萨学院）

本文提出标记边游走（MEW）算法，一种基于标记生成树空间的MCMC提议，用于图划分采样，在真实图上对多种目标分布收敛，减少生成树偏差，提升灵活集合生成。

2026-09-15cs.DScs.LGphysics.soc-ph

Optimal Sublinear Sampling of Spanning Trees and Determinantal Point Processes via Average-Case Entropic Independence

Stanford University（斯坦福大学）

We design fast algorithms for repeatedly sampling from strongly Rayleigh distributions, which include random spanning tree distributions and determinantal point processes. For a graph $G=(V, E)$, we show how to approximately sample uniformly random spanning trees from $G$ in $\widetilde{O}(\lvert V\rvert)$ time per sample after an initial $\widetilde{O}(\lvert E\rvert)$ time preprocessing. For a determinantal point process on subsets of size $k$ of a ground set of $n$ elements, we show how to approximately sample in $\widetilde{O}(k^ω)$ time after an initial $\widetilde{O}(nk^{ω-1})$ time prep…

2022-09-18cs.DScs.LGmath.PR

多项式时间内采样平衡网格森林

Sampling Balanced Forests of Grids in Polynomial Time

Claremont McKenna College（克莱蒙特麦肯纳学院）；Carnegie Mellon University（卡内基梅隆大学）；Yale University（耶鲁大学）

该研究解决了Charikar等人的猜想，提出多项式时间算法用于采样平衡网格图划分，相关结果可应用于选区划分等领域。

2026-08-24cs.DMcs.DSmath.CO

树上边着色随机采样至最大度情形的最优混合

Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree

本文证明树上边着色的Glauber动力学在q≥Δ+2时具有O(n)最优松弛时间，并为q=Δ+1情形提出更新相邻边对的替代链，同时给出Δ-正则完全树的混合时间上界。

2024-07-05cs.DMcs.DSmath.PR

为旅行推销员重新组装树木

Reassembling trees for the traveling salesman

许多最近的近似算法的旅行商问题的不同变种（不对称TSP，图TSP，s-t-路径TSP）利用众所周知的事实，自然的线性规划松弛的解决方案可以写为凸组合的生成树。主要的论点是，从这样的分布中随机抽样一棵树，然后以最小的代价完成一次旅行，比简单地取一棵最小代价生成树（如Christofides算法）产生更好的近似保证。我们认为，一个额外的步骤可以帮助：在采样之前重新组装生成树。在一定条件下，交换生成树中的两条边可以改善生成树的性质。我们证明了有用的度量S-T-路径TSP设计一个确定性的多项式时间算法，提高SebIgn以前的最佳近似比8/5。

2016-01-05cs.DMcs.DSmath.CO

Counting and Sampling from Markov Equivalent DAGs Using Clique Trees

University of Illinois at Urbana-Champaign（伊利诺伊大学厄巴纳-香槟分校）；Sharif University of Technology（谢里夫理工大学）；Georgia Institute of Technology（佐治亚理工学院）；Carnegie Mellon University（卡内基梅隆大学）

A directed acyclic graph (DAG) is the most common graphical model for representing causal relationships among a set of variables. When restricted to using only observational data, the structure of the ground truth DAG is identifiable only up to Markov equivalence, based on conditional independence relations among the variables. Therefore, the number of DAGs equivalent to the ground truth DAG is an indicator of the causal complexity of the underlying structure--roughly speaking, it shows how many interventions or how much additional information is further needed to recover the underlying DAG. I…

2018-09-11cs.AIcs.DScs.LG