圆上随机图的一阶0 - 1定律

Random Struct. Algorithms Pub Date : 1999-05-01 DOI:10.1002/(SICI)1098-2418(199905)14:3%3C239::AID-RSA3%3E3.0.CO;2-3

G. McColm

{"title":"圆上随机图的一阶0 - 1定律","authors":"G. McColm","doi":"10.1002/(SICI)1098-2418(199905)14:3%3C239::AID-RSA3%3E3.0.CO;2-3","DOIUrl":null,"url":null,"abstract":"We look at a competitor of the Erdős–Renyi models of random graphs, one proposed in E. Gilbert [J. Soc. Indust. Appl. Math. 9:4, 533–543 (1961)]: given δ>0 and a metric space X of diameter >δ, scatter n vertices at random on X and connect those of distance <δ apart: we get a random graph G. Letting X be a circle, we look at zero-one laws for (in First Order Logic) various δ. ©1999 John Wiley & Sons, Inc. Random Struct. Alg., 14, 239–266, 1999","PeriodicalId":303496,"journal":{"name":"Random Struct. Algorithms","volume":"74 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"First order zero-one laws for random graphs on the circle\",\"authors\":\"G. McColm\",\"doi\":\"10.1002/(SICI)1098-2418(199905)14:3%3C239::AID-RSA3%3E3.0.CO;2-3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We look at a competitor of the Erdős–Renyi models of random graphs, one proposed in E. Gilbert [J. Soc. Indust. Appl. Math. 9:4, 533–543 (1961)]: given δ>0 and a metric space X of diameter >δ, scatter n vertices at random on X and connect those of distance <δ apart: we get a random graph G. Letting X be a circle, we look at zero-one laws for (in First Order Logic) various δ. ©1999 John Wiley & Sons, Inc. Random Struct. Alg., 14, 239–266, 1999\",\"PeriodicalId\":303496,\"journal\":{\"name\":\"Random Struct. Algorithms\",\"volume\":\"74 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Random Struct. Algorithms\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/(SICI)1098-2418(199905)14:3%3C239::AID-RSA3%3E3.0.CO;2-3\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Random Struct. Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/(SICI)1098-2418(199905)14:3%3C239::AID-RSA3%3E3.0.CO;2-3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 9

摘要

我们来看看Erdős-Renyi随机图模型的一个竞争者，一个由E. Gilbert [J.]提出的模型。Soc。工业上。达成。数学。9:4,533-543(1961)]:给定δ>0和一个直径>δ的度量空间X，在X上随机分散n个顶点，并将距离<δ的顶点分开:我们得到一个随机图g，设X是一个圆，我们观察(在一阶逻辑中)各种δ的0 - 1定律。©1999 John Wiley & Sons, Inc随机结构。Alg。科学通报，14,239-266,1999

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

First order zero-one laws for random graphs on the circle

We look at a competitor of the Erdős–Renyi models of random graphs, one proposed in E. Gilbert [J. Soc. Indust. Appl. Math. 9:4, 533–543 (1961)]: given δ>0 and a metric space X of diameter >δ, scatter n vertices at random on X and connect those of distance <δ apart: we get a random graph G. Letting X be a circle, we look at zero-one laws for (in First Order Logic) various δ. ©1999 John Wiley & Sons, Inc. Random Struct. Alg., 14, 239–266, 1999

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Random Struct. Algorithms

自引率

0.00%

发文量

期刊最新文献

Monochromatic paths in random tournaments On Generalized Independent Subsets of Trees Inequalities in Probability Theory and Turán-Type Problems for Graphs with Colored Vertices On the effect of selection in genetic algorithms The Boyer-Moore-Horspool heuristic with Markovian input