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 条
  • [1] A divide-and-conquer algorithm for generating Markov bases of multi-way tables
    Dobra, A
    Sullivant, S
    COMPUTATIONAL STATISTICS, 2004, 19 (03) : 347 - 366
  • [2] Deriving Parametric Multi-way Recursive Divide-and-Conquer Dynamic Programming Algorithms using Polyhedral Compilers
    Javanmard, Mohammad Mahdi
    Ahmad, Zafar
    Kong, Martin
    Pouchet, Louis-Noel
    Chowdhury, Rezaul
    Harrison, Robert
    CGO'20: PROCEEDINGS OF THE18TH ACM/IEEE INTERNATIONAL SYMPOSIUM ON CODE GENERATION AND OPTIMIZATION, 2020, : 317 - 329
  • [3] A divide-and-conquer discretization algorithm
    Min, F
    Xie, LJ
    Liu, QH
    Cai, HB
    FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, PT 1, PROCEEDINGS, 2005, 3613 : 1277 - 1286
  • [4] Multi-way Divide and Conquer Parallel Programming based on PLists
    Niculescu, Virginia
    Bufnea, Darius
    Sterca, Adrian
    Silimon, Robert
    2019 27TH INTERNATIONAL CONFERENCE ON SOFTWARE, TELECOMMUNICATIONS AND COMPUTER NETWORKS (SOFTCOM), 2019, : 252 - 257
  • [5] Generating synchronization statements in divide-and-conquer programs
    Hijma, Pieter
    van Nieuwpoort, Rob V.
    Jacobs, Ceriel J. H.
    Bal, Henri E.
    PARALLEL COMPUTING, 2012, 38 (1-2) : 75 - 89
  • [6] A DIVIDE-AND-CONQUER ALGORITHM FOR GRID GENERATION
    DOUGHERTY, RL
    HYMAN, JM
    APPLIED NUMERICAL MATHEMATICS, 1994, 14 (1-3) : 125 - 134
  • [7] A DIVIDE-AND-CONQUER ALGORITHM FOR THE BIDIAGONAL SVD
    GU, M
    EISENSTAT, SC
    SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1995, 16 (01) : 79 - 92
  • [8] A divide-and-conquer algorithm for curve fitting
    Buchinger, Diego
    Rosso Jr, Roberto Silvio Ubertino
    COMPUTER-AIDED DESIGN, 2022, 151
  • [9] Fast broadcast by the divide-and-conquer algorithm
    Kim, DY
    Kim, DS
    2004 IEEE INTERNATIONAL CONFERENCE ON CLUSTER COMPUTING, 2004, : 487 - 488
  • [10] Random sampling of contingency tables via probabilistic divide-and-conquer
    Stephen DeSalvo
    James Zhao
    Computational Statistics, 2020, 35 : 837 - 869
12345