• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Research on Algorithms for Random Generation of Discrete Objects

Research Project

Project/Area Number 20740056
Research Category

Grant-in-Aid for Young Scientists (B)

Allocation TypeSingle-year Grants
Research Field General mathematics (including Probability theory/Statistical mathematics)
Research InstitutionKyoto University

Principal Investigator

KIJIMA Shuji  Kyoto University, システム情報科学研究院, 准教授 (70452307)

Project Period (FY) 2008 – 2010
Project Status Completed (Fiscal Year 2010)
Budget Amount *help
¥3,380,000 (Direct Cost: ¥2,600,000、Indirect Cost: ¥780,000)
Fiscal Year 2010: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2009: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2008: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Keywords応用数学 / アルゴリズム / 確率論 / マルコフ連鎖 / グラフ論 / 離散数学 / 乱択アルゴリズム / マルコフ連鎖モンテカルロ法 / 列挙 / コーダルグラフ / 分配束
Research Abstract

This research is concerned with algorithms for random sampling of combinatorial objects. From a computational complexity theoretical viewpoint, this research tries to figure out whether polynomial time algorithms exist for several objects. For chorda graph sandwiches, queuing networks, ideals of partially ordered sets, Tutte polynomials etc, we obtained some computational complexity results on polynomial time algorithms and impossibility.

Report

(4 results)
  • 2010 Annual Research Report   Final Research Report ( PDF )
  • 2009 Annual Research Report
  • 2008 Annual Research Report
  • Research Products

    (36 results)

All 2011 2010 2009 2008 Other

All Journal Article (12 results) (of which Peer Reviewed: 12 results) Presentation (24 results)

  • [Journal Article] A polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise2011

    • Author(s)
      Masaki Yamamoto, Shuji Kijima, Yasuko Matsui
    • Journal Title

      Journal of Combinatorial Optimization

    • NAID

      110007338415

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] On listing, sampling, and counting the chordal graphs with edge constraints2010

    • Author(s)
      Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno
    • Journal Title

      Theoretical Computer Science 411-(26-28)

      Pages: 2591-2601

    • Related Report
      2010 Final Research Report
    • Peer Reviewed
  • [Journal Article] Pattern formation through optimum matching by CORDA oblivious robots2010

    • Author(s)
      Nao Fujinaga, Hirotaka Ono, Shujji Kijima, Masafumi Yamashita
    • Journal Title

      Lecture Notes in Computer Science 6490

      Pages: 1-15

    • Related Report
      2010 Final Research Report
    • Peer Reviewed
  • [Journal Article] Upper and lower bounds of space complexity of self-stabilizing leader election in mediated population protocol2010

    • Author(s)
      Ryu Mizoguchi, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita
    • Journal Title

      Lecture Notes in Computer Science 6490

      Pages: 491-503

    • Related Report
      2010 Final Research Report
    • Peer Reviewed
  • [Journal Article] On listing, sampling, and counting the chordal graphs with edge constraints2010

    • Author(s)
      Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno
    • Journal Title

      Theoretical Computer Science

      Volume: 411-(26-28) Pages: 2591-2601

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Pattern formation through optimum matching by CORDA oblivious robots2010

    • Author(s)
      Nao Fujinaga, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 6490 Pages: 1-15

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Upper and lower bounds of space complexity of self-stabilizing leader election in mediated population protocol2010

    • Author(s)
      Ryu Mizoguchi, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 6490 Pages: 491-503

    • Related Report
      2010 Annual Research Report
    • Peer Reviewed
  • [Journal Article] On listing, sampling, and counting the chordal graphs with edge constraints2010

    • Author(s)
      S.Kijima, M.Kiyomi, Y.Okamoto, T.Uno
    • Journal Title

      Theoretical Computer Science (掲載確定)

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] A polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise2009

    • Author(s)
      M.Yamamoto, S.Kijima, Y.Matsui
    • Journal Title

      Lecture Notes in Computer Science 5609

      Pages: 328-337

    • NAID

      110007338415

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Approximation algorithm and perfect sampler for closed Jackson networks with single servers2008

    • Author(s)
      Shuji Kijima, Tomomi Matsui
    • Journal Title

      SIAM Journal on Computing 38-4

      Pages: 1484-1503

    • Related Report
      2010 Final Research Report
    • Peer Reviewed
  • [Journal Article] Approximation algorithm and perfect sampler for closed Jackson networks with single servers2008

    • Author(s)
      S. Kijima and T. Matsui
    • Journal Title

      SIAM Journal on Computing 38-4

      Pages: 1484-1503

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] A polynomial-time perfect sampler for the Q-lsing with a vertex-independent noise

    • Author(s)
      Masaki Yamamoto, Shuji Kijima, Yasuko Matsui
    • Journal Title

      Journal of Combinatorial Optimization, to appear

    • Related Report
      2010 Final Research Report
    • Peer Reviewed
  • [Presentation] Online prediction over permutahedron2011

    • Author(s)
      Shota Yasutake, Kohei Hatano, Shuji Ki.jima, Eiji Takimoto, MasayukiTakeda
    • Organizer
      第134回アルゴリズム研究会
    • Place of Presentation
      琉球大学
    • Year and Date
      2011-03-07
    • Related Report
      2010 Annual Research Report 2010 Final Research Report
  • [Presentation] Approximating thepath-distance-width fork-cocomparability graphs2011

    • Author(s)
      大舘陽太, 斎藤寿樹, 山中克久, 来嶋秀治, 岡本吉央, 小野廣隆, 宇野裕之, 山崎浩一
    • Organizer
      2010年度冬のLAシンポジウム
    • Place of Presentation
      京都大学数理解析研究所
    • Year and Date
      2011-02-20
    • Related Report
      2010 Final Research Report
  • [Presentation] Approximating the path-distance-width for k-cocomparability graphs2011

    • Author(s)
      大舘陽太, 斎藤寿樹, 山中克久, 来嶋秀治, 岡本吉央, 小野廣隆, 宇野裕之, 山崎浩一
    • Organizer
      2010年度 冬のLAシンポジウム
    • Place of Presentation
      京都大学数理解析研究所
    • Year and Date
      2011-02-02
    • Related Report
      2010 Annual Research Report
  • [Presentation] How slow, or fast, are standard random walks?-analyses of hitting and cover times on tree2011

    • Author(s)
      Yoshiaki Nonaka, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita
    • Organizer
      The 17th Computing: the Australasian Theory Symposium(CATS2011)
    • Place of Presentation
      Perth, Australia
    • Year and Date
      2011-01-19
    • Related Report
      2010 Final Research Report
  • [Presentation] How slow, or fast, are standard random walks? --analyses of hitting and cover times on tree2011

    • Author(s)
      Yoshiaki Nonaka, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita
    • Organizer
      The 17th Computing : the Australasian Theory Symposium
    • Place of Presentation
      Perth, Australia
    • Year and Date
      2011-01-19
    • Related Report
      2010 Annual Research Report
  • [Presentation] グラフクラスと部分グラフ同型性2010

    • Author(s)
      斎藤寿樹, 大舘陽太, 来嶋秀治, 宇野毅明
    • Organizer
      第132回アルゴリズム研究会
    • Place of Presentation
      関西大学先端科学技術推進機構
    • Year and Date
      2010-11-19
    • Related Report
      2010 Final Research Report
  • [Presentation] グラフクラスと部分グラフ同型性2010

    • Author(s)
      斎藤寿樹, 大舘陽太, 来嶋秀治, 宇野毅明
    • Organizer
      第132回アルゴリズム研究会
    • Place of Presentation
      関西大学
    • Year and Date
      2010-11-19
    • Related Report
      2010 Annual Research Report
  • [Presentation] Computational experiments of perfect sampling algorithms for two-way contingency tables2010

    • Author(s)
      Rye Nakatsubo, Shuji Kijima, Tomomi Matsui
    • Organizer
      International Conference OPERATIONS RESEARCH (MUNICH 2010)
    • Place of Presentation
      Universitat der Bundeswehr Munchen, Germany
    • Year and Date
      2010-09-02
    • Related Report
      2010 Final Research Report
  • [Presentation] Computational experiments of perfect sampling algorithms for two-way contingency tables2010

    • Author(s)
      Ryo Nakatsubo, Shuji Kijima, Tomomi Matsui
    • Organizer
      International Conference OPERATIONS RESEARCH
    • Place of Presentation
      Universitat der Bundeswehr Munchen, Germany
    • Year and Date
      2010-09-02
    • Related Report
      2010 Annual Research Report
  • [Presentation] Counting the number of dominating sets in graph classes2010

    • Author(s)
      Shuji Kijima Yoshio Okamoto, Takeaki Uno
    • Organizer
      The 13th Japan-Korea Joint Workshop on Algorithms and Computation(WAAC 2010)
    • Place of Presentation
      Kanazawa Culture Hall, Kanazawa, Tshikawa, Japan
    • Year and Date
      2010-07-23
    • Related Report
      2010 Final Research Report
  • [Presentation] Counting the number of dominating sets in graph classes2010

    • Author(s)
      Shuji Kijima, Yoshio Okamoto, Takeaki Uno
    • Organizer
      The 13th Japan-Korea Joint Workshop on Algorithms and Computation
    • Place of Presentation
      Kanazawa Culture Hall
    • Year and Date
      2010-07-23
    • Related Report
      2010 Annual Research Report
  • [Presentation] 支配集合数え上げ問題とグラフクラス2010

    • Author(s)
      来嶋秀治, 岡本吉央, 宇野毅明
    • Organizer
      日本応用数理学会2010年研究部会連合発表会, 離散システム研究部会
    • Place of Presentation
      筑波大学
    • Year and Date
      2010-03-08
    • Related Report
      2010 Final Research Report
  • [Presentation] 支配集合数え上げ問題とグラフクラス2010

    • Author(s)
      来嶋秀治, 岡本吉央, 宇野毅明
    • Organizer
      日本応用数理学会 2010年 研究部会 連合発表会
    • Place of Presentation
      筑波大学
    • Year and Date
      2010-03-08
    • Related Report
      2009 Annual Research Report
  • [Presentation] 対数優/劣モジュラ分布からのサンプリング2010

    • Author(s)
      来嶋秀治
    • Organizer
      2009年度冬のLAシンポジウム
    • Place of Presentation
      京都大学数理解析研究所
    • Year and Date
      2010-02-03
    • Related Report
      2010 Final Research Report
  • [Presentation] 対数優/劣モジュラ分布からのサンプリング2010

    • Author(s)
      来嶋秀治
    • Organizer
      2009年度冬のLAシンポジウム
    • Place of Presentation
      京都大学
    • Year and Date
      2010-02-03
    • Related Report
      2009 Annual Research Report
  • [Presentation] Randomized approximateion for generalized median stable matching2009

    • Author(s)
      S.Kijima, T.Nemoto
    • Organizer
      ISMP 2009
    • Place of Presentation
      Chicago, USA
    • Year and Date
      2009-08-24
    • Related Report
      2009 Annual Research Report
  • [Presentation] 一般化メディアン安定結婚問題に対する乱択近似アルゴリズム2008

    • Author(s)
      来嶋秀治, 根本俊男
    • Organizer
      情報処理学アルゴリズム研究会第120回研究会
    • Place of Presentation
      大阪大学医学部学友会館・医療情報センター(銀杏会館)
    • Year and Date
      2008-11-07
    • Related Report
      2008 Annual Research Report
  • [Presentation] 一般化メディアン安定結婚問題に対する乱択近似アルゴリズム2008

    • Author(s)
      来嶋秀治
    • Organizer
      日本オペレーションズリサーチ学会「計算と最適化」研究部会第13回研究会
    • Place of Presentation
      公立大学法人首都大学東京秋葉原サテライトキャンパス
    • Year and Date
      2008-11-01
    • Related Report
      2008 Annual Research Report
  • [Presentation] Enumeration of graph sandwiches[invited talk]2008

    • Author(s)
      Shoji Kijima
    • Organizer
      Acceleration and Visualization of Computation for Enumeration Problems
    • Place of Presentation
      Kyoto RIMS, Japan
    • Year and Date
      2008-09-29
    • Related Report
      2010 Final Research Report
  • [Presentation] Enumeration of graph sandwiches2008

    • Author(s)
      S. Kijima
    • Organizer
      Acceleration and Visualization of Computation for Enumeration Problems
    • Place of Presentation
      RIMS, KyoM, Japan(inirited talk)
    • Year and Date
      2008-09-29
    • Related Report
      2008 Annual Research Report
  • [Presentation] 列挙, 数え上げ, ランダム生成2008

    • Author(s)
      来嶋秀治
    • Organizer
      FIT2008第7回情報科学技術フォーラム, イベント企画:データサイエンスで活躍する列挙アルゴリズムー設計技法とその応用一
    • Place of Presentation
      慶鷹義塾大学湘南藤沢キャンパス[招待講演]
    • Year and Date
      2008-09-02
    • Related Report
      2010 Final Research Report
  • [Presentation] 列挙, 数え上げ, ランダム生成2008

    • Author(s)
      来嶋秀治
    • Organizer
      FIT2008第7回情報科学技術フォーラム,イベント企画 : データサイエンスで活躍する列挙アルゴリズム-設計技法とその応用-」
    • Place of Presentation
      慶應義塾大学湘南藤沢キャンパス(招待講演)
    • Year and Date
      2008-09-02
    • Related Report
      2008 Annual Research Report
  • [Presentation] On listing, sampling, and counting the chordal graphs with edge constraints2008

    • Author(s)
      S. Kijima, M. Kiyomi, Y. Okamoto. and T. Uno
    • Organizer
      14th Annual International Coinputing and Combinatorics Confeience (COCOON 2008)
    • Place of Presentation
      Dalian, China
    • Year and Date
      2008-06-29
    • Related Report
      2008 Annual Research Report
  • [Presentation] 列挙, 数え上げ, サンプリングのはなし2008

    • Author(s)
      来嶋秀治
    • Organizer
      第4回組合せ論若手研究集会
    • Place of Presentation
      慶鷹義塾大学[招待講演]
    • Year and Date
      2008-02-06
    • Related Report
      2010 Final Research Report

URL: 

Published: 2008-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi