michael krivelevich benny sudakov pseudo random graphs

michael krivelevich benny sudakov pseudo random graphs

ID:7293263

大小:5.86 MB

页数:64页

时间:2018-02-10

michael krivelevich benny sudakov pseudo random graphs_第1页
michael krivelevich benny sudakov pseudo random graphs_第2页
michael krivelevich benny sudakov pseudo random graphs_第3页
michael krivelevich benny sudakov pseudo random graphs_第4页
michael krivelevich benny sudakov pseudo random graphs_第5页
资源描述:

《michael krivelevich benny sudakov pseudo random graphs》由会员上传分享,免费在线阅读,更多相关内容在工程资料-天天文库

1、BOLYAISOCIETYConferenceonFiniteMATHEMATICALSTUDIES,15andInfiniteSetsBudapest,pp.199-262.PSEUDO-RANDOMGRAPHSM.KRIVELEVICH*andB.SUDAKOVt1.INTRODUCTIONRandomgraphshaveproventobeoneofthemostimportantandfruit•fulconceptsinmodernCombinatoricsandTheoreticalComputerScience.Besidesbeinga

2、fascinatingstudysubjectfortheirownsake,theyserveasessentialinstrumentsinprovinganenormousnumberofcombinatorialstatements,makingtheirrolequitehardtooverestimate.Theirtremen•doussuccessservesasanaturalmotivationforthefollowingverygeneralanddeepinformalquestions:whataretheessential

3、propertiesofrandomgraphs?Howcanonetellwhenagivengraphbehaveslikearandomgraph?Howtocreatedeterministicallygraphsthatlookrandom-like?Thisleadsustoaconceptofpseudo-randonigraphs.Speakingveryinformally,apseudo-randomgraphG=(V,E)isagraphthatbehaveslikeatrulyrandomgraphG(IVI,p)ofthesa

4、meedgedensityp=IEI/(I~I).Althoughthelastsentencegivessomeinitialideaaboutthisconcept,itisnotveryinformative,asfirstofallitdoesnotsayinwhichaspectthepseudo-randomgraphbehaviorissimilartothatofthecorrespondingrandomgraph,andsecondlyitdoesnotsupplyanyquantitativemeasureofthissimila

5、rity.Therearequiteafewpossiblegraphparametersthatcanpotentiallyserveforcomparingpseudo-randomand'ResearchsupportedinpartbyaUSA-IsraelBSFGrant,byagrant.fromtheIsraelScienceFoundationandbyaBergmannMemorialGrant.tResearchsupportedinpartbyNSFgrantsDMS-0355497,DMS-0106589,andbyanAlfr

6、edP.Sloanfellowship.Partofthisresearchwasdonewhilevisit.ingMicrosoftResearch.200M.KrivelevichandB.Sudakovrandomgraphs(andinfactquiteafewofthemareequivalentincertain,verynaturalsense,aswewillseelater),butprobablythemostimportantcharacteristicsofatrulyrandomgraphisitsedgedistribut

7、ion.Wecanthusmakeasignificantstepforwardandsaythatapseudo-randomgraphisagraphwithedgedistributionresemblingtheoneofatrulyrandomgraphwiththesameedgedensity.Still,thequantitativemeasureofthisresemblanceremainstobeintroduced.Althoughfirstexamplesandapplicationsofpseudo-randomgraphs

8、ap•pearedverylongtimeago,itwasAndrewThomasonwho

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。