Matrix Multinomial Systems with Finite Syntax

R. Hanel
{"title":"Matrix Multinomial Systems with Finite Syntax","authors":"R. Hanel","doi":"10.5220/0005877100260031","DOIUrl":null,"url":null,"abstract":"Typically, describing complex processes and the sequences of events they generate requires both statistical and structural information. Statistical information alone does not suffice when intrinsic constraints allow a process to produce well-formed sequences of events but not others. Typically, processes become history dependent; the multiplicity of well-formed sequences with identical histogram and derived concepts, entropy for instance, start to depend on the structure, the grammar, of the underlying process. We demonstrate that for a sufficiently well behaved class of complex processes, it is possible to derive an exact criterion for deciding whether a sequence of arbitrary length is well formed or not. The approach is based on representing events by matrices and sequences of events by products of respective matrices. Formally such processes have a multinomial structure only that the elements are not numbers, but matrices. We demonstrate the approach by applying it to enumerate the well known Oslo sand-pile model, resulting in an elegant formula for the number of stable attractor states for Oslo sand-piles of arbitrary size.","PeriodicalId":414016,"journal":{"name":"International Conference on Complex Information Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Complex Information Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5220/0005877100260031","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Typically, describing complex processes and the sequences of events they generate requires both statistical and structural information. Statistical information alone does not suffice when intrinsic constraints allow a process to produce well-formed sequences of events but not others. Typically, processes become history dependent; the multiplicity of well-formed sequences with identical histogram and derived concepts, entropy for instance, start to depend on the structure, the grammar, of the underlying process. We demonstrate that for a sufficiently well behaved class of complex processes, it is possible to derive an exact criterion for deciding whether a sequence of arbitrary length is well formed or not. The approach is based on representing events by matrices and sequences of events by products of respective matrices. Formally such processes have a multinomial structure only that the elements are not numbers, but matrices. We demonstrate the approach by applying it to enumerate the well known Oslo sand-pile model, resulting in an elegant formula for the number of stable attractor states for Oslo sand-piles of arbitrary size.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
有限句法的矩阵多项式系统
通常,描述复杂的过程及其产生的事件序列需要统计信息和结构信息。当内在约束允许流程产生格式良好的事件序列而不能产生其他事件序列时,仅统计信息是不够的。通常,进程变得依赖于历史;具有相同直方图和派生概念(例如熵)的格式良好序列的多样性开始依赖于底层过程的结构、语法。我们证明,对于一类表现良好的复杂过程,有可能推导出一个精确的准则来决定任意长度的序列是否形成良好。该方法基于用矩阵表示事件,用各自矩阵的乘积表示事件序列。形式上,这样的过程具有多项式结构,只是元素不是数字,而是矩阵。我们通过将其应用于列举著名的奥斯陆沙堆模型来证明该方法,从而得到了任意大小的奥斯陆沙堆的稳定吸引子状态数的优雅公式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Moving Other Way: Exploring Word Mover Distance Extensions Artificial Neural Networks Jamming on the Beat FLOPTICS: A Novel Automated Gating Technique for Flow Cytometry Data It Means More if It Sounds Good: Yet Another Hypotheses Concerning the Evolution of Polysemous Words An Empirical Research on the Investment Strategy of Stock Market based on Deep Reinforcement Learning model
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1