A Divide-and-Conquer Algorithm for Generating Markov Bases of Multi-way Tables

被引：0
|
作者：
Adrian Dobra
Seth Sullivant
机构：
[1] Duke University,Institute of Statistics and Decision Sciences and Department of Molecular Genetics & Microbiology
[2] University of California,Department of Mathematics
来源：
Computational Statistics | 2004年 / 19卷
关键词：
Contingency tables; Decomposable graphical models; Disclosure limitation; Exact distributions; Gröbner bases; Markov bases;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We describe a divide-and-conquer technique for generating a Markov basis that connects all tables of counts having a fixed set of marginal totals. This procedure is based on decomposing the independence graph induced by these marginals. We discuss the practical imports of using this method in conjunction with other algorithms for determining Markov bases.
引用
收藏
页码：347 / 366
页数：19
相关论文
共 50 条
  • [21] DIVIDE-AND-CONQUER APPROXIMATION ALGORITHM FOR VERTEX COVER
    Asgeirsson, Eyjolfur Ingi
    Stein, Cliff
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2009, 23 (03) : 1261 - 1280
  • [22] A DIVIDE-AND-CONQUER ALGORITHM FOR THE SYMMETRICAL TRIDIAGONAL EIGENPROBLEM
    GU, M
    EISENSTAT, SC
    SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1995, 16 (01) : 172 - 191
  • [23] A divide-and-conquer algorithm for quantum state preparation
    Araujo, Israel F.
    Park, Daniel K.
    Petruccione, Francesco
    da Silva, Adenilton J.
    SCIENTIFIC REPORTS, 2021, 11 (01)
  • [24] Engineering the divide-and-conquer closest pair algorithm
    Jiang, Minghui
    Gillespie, Joel
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2007, 22 (04) : 532 - 540
  • [25] A divide-and-conquer algorithm of Delaunay triangulation with GPGPU
    Chen, Min-Bin
    2012 FIFTH INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS AND PROGRAMMING (PAAP), 2012, : 175 - 177
  • [26] Engineering the Divide-and-Conquer Closest Pair Algorithm
    Minghui Jiang
    Joel Gillespie
    Journal of Computer Science and Technology, 2007, 22 : 532 - 540
  • [27] A divide-and-conquer algorithm for quantum state preparation
    Israel F. Araujo
    Daniel K. Park
    Francesco Petruccione
    Adenilton J. da Silva
    Scientific Reports, 11
  • [28] AN IMPLEMENTATION OF A DIVIDE-AND-CONQUER ALGORITHM FOR THE UNITARY EIGENPROBLEM
    AMMAR, GS
    REICHEL, L
    SORENSEN, DC
    ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1992, 18 (03): : 292 - 307
  • [29] An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts
    Xiao, Mingyu
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2008, 5369 : 208 - 219
  • [30] A general and efficient divide-and-conquer algorithm framework for multi-core clusters
    Carlos H. González
    Basilio B. Fraguela
    Cluster Computing, 2017, 20 : 2605 - 2626
12345