吉尔伯特随机图的零一定律

Proceedings 11th Annual IEEE Symposium on Logic in Computer Science Pub Date : 1996-07-27 DOI:10.1109/LICS.1996.561448

G. McColm

{"title":"吉尔伯特随机图的零一定律","authors":"G. McColm","doi":"10.1109/LICS.1996.561448","DOIUrl":null,"url":null,"abstract":"We look at a competitor of the Erdos-Renyi models of random graphs, one proposed by E. Gilbert (1961): given /spl delta/>0 and a metric space X of diameter >/spl delta/, scatter n vertices at random on X and connect those of distance </spl delta/ apart: we get a random graph G/sub n,/spl delta///sup X/. Question: for fixed X, /spl delta/, do we have 0-1 laws for FO logic? We prove that this is true if X is a circle.","PeriodicalId":382663,"journal":{"name":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Zero-one laws for Gilbert random graphs\",\"authors\":\"G. McColm\",\"doi\":\"10.1109/LICS.1996.561448\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We look at a competitor of the Erdos-Renyi models of random graphs, one proposed by E. Gilbert (1961): given /spl delta/>0 and a metric space X of diameter >/spl delta/, scatter n vertices at random on X and connect those of distance </spl delta/ apart: we get a random graph G/sub n,/spl delta///sup X/. Question: for fixed X, /spl delta/, do we have 0-1 laws for FO logic? We prove that this is true if X is a circle.\",\"PeriodicalId\":382663,\"journal\":{\"name\":\"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science\",\"volume\":\"62 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-07-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LICS.1996.561448\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.1996.561448","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

我们看一下Erdos-Renyi随机图模型的一个竞争者，一个由E. Gilbert(1961)提出的模型:给定/spl delta/>0和一个直径>/spl delta/的度量空间X，在X上随机分散n个顶点，并将距离本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Zero-one laws for Gilbert random graphs

We look at a competitor of the Erdos-Renyi models of random graphs, one proposed by E. Gilbert (1961): given /spl delta/>0 and a metric space X of diameter >/spl delta/, scatter n vertices at random on X and connect those of distance

求助全文

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

来源期刊

Proceedings 11th Annual IEEE Symposium on Logic in Computer Science

自引率

0.00%

发文量