咨询与建议

限定检索结果

文献类型

  • 5 篇 期刊文献

馆藏范围

  • 5 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 4 篇 理学
    • 3 篇 统计学(可授理学、...
    • 2 篇 数学
  • 1 篇 工学
    • 1 篇 电气工程
    • 1 篇 电子科学与技术(可...
    • 1 篇 计算机科学与技术...

主题

  • 5 篇 finitary coding
  • 2 篇 factor of iid
  • 2 篇 ising model
  • 1 篇 induced transfor...
  • 1 篇 phase transition...
  • 1 篇 random-cluster m...
  • 1 篇 monotone specifi...
  • 1 篇 symbolic dynamic...
  • 1 篇 bernoulli shift
  • 1 篇 random number ge...
  • 1 篇 random dynamics
  • 1 篇 coupling from th...
  • 1 篇 finite expected ...
  • 1 篇 interval algorit...
  • 1 篇 random fields
  • 1 篇 markov chain
  • 1 篇 quasi-transitive...
  • 1 篇 markov process

机构

  • 2 篇 univ british col...
  • 1 篇 chalmers univ te...
  • 1 篇 univ british col...
  • 1 篇 kanazawa univ gr...
  • 1 篇 northeastern uni...
  • 1 篇 cwi dept pna nl-...

作者

  • 3 篇 spinka yinon
  • 1 篇 harel matan
  • 1 篇 van den berg j
  • 1 篇 fujisaki hiroshi
  • 1 篇 steif je
  • 1 篇 angel omer

语言

  • 5 篇 英文
检索条件"主题词=finitary coding"
5 条 记 录,以下是1-10 订阅
排序:
finitary coding for the sub-critical Ising model with finite expected coding volume
收藏 引用
ELECTRONIC JOURNAL OF PROBABILITY 2020年 第none期25卷 1-27页
作者: Spinka, Yinon Univ British Columbia Vancouver BC Canada
It has been shown by van den Berg and Steif [5] that the sub-critical Ising model on Z(d) is a finitary factor of a finite-valued i.i.d. process. We strengthen this by showing that the factor map can be made to have f... 详细信息
来源: 评论
finitary codings for the random-cluster model and other infinite-range monotone models
收藏 引用
ELECTRONIC JOURNAL OF PROBABILITY 2022年 第none期27卷 1-32页
作者: Harel, Matan Spinka, Yinon Northeastern Univ Boston MA 02115 USA Univ British Columbia Vancouver BC Canada
A random field X = (X-v)(v is an element of G) on a quasi-transitive graph G is a factor of an i.i.d. process if it can be written as X = phi(Y) for some i.i.d. process Y = (Y-v)(v is an element of G) and equivariant ... 详细信息
来源: 评论
On the existence and nonexistence of finitary codings for a class of random fields
收藏 引用
ANNALS OF PROBABILITY 1999年 第3期27卷 1501-1522页
作者: van den Berg, J Steif, JE CWI Dept PNA NL-1098 SJ Amsterdam Netherlands Chalmers Univ Technol Dept Math S-41296 Gothenburg Sweden
We study the existence of finitary codings (also called finitary homomorphisms or finitary factor maps) from a finite-valued i.i.d. process to certain random fields. For Markov random fields we show, using ideas of Ma... 详细信息
来源: 评论
Generating stochastic processes based on the finitary interval algorithm
收藏 引用
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2008年 第9期E91A卷 2482-2488页
作者: Fujisaki, Hiroshi Kanazawa Univ Grad Sch Nat Sci & Technol Kanazawa Ishikawa 9201192 Japan
We point out that the interval algorithm can be expressed in the form of a shift on the sequence space. Then we clarify that, by using a Bernoulli process, the interval algorithm can generate only a block of Markov ch... 详细信息
来源: 评论
Markov chains with exponential return times are finitary
收藏 引用
ERGODIC THEORY AND DYNAMICAL SYSTEMS 2021年 第10期41卷 2918-2926页
作者: Angel, Omer Spinka, Yinon Univ British Columbia Dept Math 1984 Math Rd Vancouver BC V6T 1Z2 Canada
Consider an ergodic Markov chain on a countable state space for which the return times have exponential tails. We show that the stationary version of any such chain is a finitary factor of an independent and identical... 详细信息
来源: 评论