Edges, Chains, Shadows, Neighbors and Subgraphs in the Intrinsic Order Graph.docVIP

下载本文档

2
0
约 8页
2017-05-08 发布于上海
举报
版权申诉

Edges, Chains, Shadows, Neighbors and Subgraphs in the Intrinsic Order Graph.doc

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Edges, Chains, Shadows, Neighbors and Subgraphs in the Intrinsic Order Graph

IAENG International Journal of Applied Mathematics, 42:1, IJAM_42_1_09 ______________________________________________________________________________________ Edges,Chains,Shadows,Neighborsand SubgraphsintheIntrinsicOrderGraph LuisGonz′alez Abstract—Many different scienti?c, technical or social phe- The behavior of a CSBS is determined by the ordering - nomena can be modeled by a complex system depending on between the current values of the 2n associated binary n a large number n of random Boolean variables. Such systems tuple probabilities Pr{u}. Computing all these 2n proba- are called complex stochastic Boolean systems (CSBSs). The most useful representation of a CSBS is the intrinsic order graph. This is a symmetric digraph on 2 nodes, with a char- n bilities –by using (1)– and ordering them in decreasing or increasing order of their values is only possible in practice acteristic fractal structure. In this paper, different properties forsmallvaluesofthenumbernofbasicvariables.However, of the intrinsic order graph are studied, namely those dealing forlargevaluesofn,toovercometheexponentialnatureof with its edges; chains; shadows, neighbors and degrees of its thisproblem,weneedalternativeproceduresforcomparing vertices; and some relevant subgraphs, as well as the natural the binary string probabilities. For this purpose, in [2] we havede?nedapartialorderrelationontheset{0,1}n ofall isomorphisms between them. Index Terms—complex stochastic Boolean system, edges, the2n binaryn-tuples,theso-calledintrinsicorderbetween intrinsic order graph, neighbors, shadows, subgraphs. binaryn-tuples. The intrinsic order relation is characterized by a simple I. INTRODUCTION positional criterion, the so-called intrinsic order criterion (IOC). IOC enables one to compare (to order) two given binaryn-tupleprobabilitiesPr{u},Pr{v},withoutcomput- ingthem,simplylookingatthepositionsofthe0sand1 sin thebinaryn-tuplesu,v. I N this paper, we consider complex systems depending on an