{"title":"概率论中的不等式和Turán-Type彩色顶点图的问题","authors":"A. Sidorenko","doi":"10.1002/rsa.3240020107","DOIUrl":null,"url":null,"abstract":"The “best” inequalities of type P{(ζ, η)⊂ E} ≧f(P{η⊂ D1}P{η⊂Dm}) for independent and identically distributed random elements ζ and η can be reduced to Turan-type problems for graphs with colored vertices. In the present work we describe a finite algorithm for obtaining the asymptotical solution for an arbitrary problem of such type. In the case of two colors we obtain the final form of asymptotic solution without using the algorithm.","PeriodicalId":303496,"journal":{"name":"Random Struct. Algorithms","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Inequalities in Probability Theory and Turán-Type Problems for Graphs with Colored Vertices\",\"authors\":\"A. Sidorenko\",\"doi\":\"10.1002/rsa.3240020107\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The “best” inequalities of type P{(ζ, η)⊂ E} ≧f(P{η⊂ D1}P{η⊂Dm}) for independent and identically distributed random elements ζ and η can be reduced to Turan-type problems for graphs with colored vertices. In the present work we describe a finite algorithm for obtaining the asymptotical solution for an arbitrary problem of such type. In the case of two colors we obtain the final form of asymptotic solution without using the algorithm.\",\"PeriodicalId\":303496,\"journal\":{\"name\":\"Random Struct. Algorithms\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-07-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Random Struct. Algorithms\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/rsa.3240020107\",\"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/rsa.3240020107","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Inequalities in Probability Theory and Turán-Type Problems for Graphs with Colored Vertices
The “best” inequalities of type P{(ζ, η)⊂ E} ≧f(P{η⊂ D1}P{η⊂Dm}) for independent and identically distributed random elements ζ and η can be reduced to Turan-type problems for graphs with colored vertices. In the present work we describe a finite algorithm for obtaining the asymptotical solution for an arbitrary problem of such type. In the case of two colors we obtain the final form of asymptotic solution without using the algorithm.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
