WeightedGraphsandDisconnectedComponentsPatte:加权图和断开连接的组件模式

WeightedGraphsandDisconnectedComponentsPatte:加权图和断开连接的组件模式

ID:43235854

大小:5.43 MB

页数:64页

时间:2019-10-06

WeightedGraphsandDisconnectedComponentsPatte:加权图和断开连接的组件模式_第1页
WeightedGraphsandDisconnectedComponentsPatte:加权图和断开连接的组件模式_第2页
WeightedGraphsandDisconnectedComponentsPatte:加权图和断开连接的组件模式_第3页
WeightedGraphsandDisconnectedComponentsPatte:加权图和断开连接的组件模式_第4页
WeightedGraphsandDisconnectedComponentsPatte:加权图和断开连接的组件模式_第5页
资源描述:

《WeightedGraphsandDisconnectedComponentsPatte:加权图和断开连接的组件模式》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、WeightedGraphsandDisconnectedComponentsPatternsandaGeneratorMaryMcGlohon,LemanAkoglu,ChristosFaloutsosCarnegieMellonUniversitySchoolofComputerScience2McGlohon,Akoglu,FaloutsosKDD08Ingraphsalargestconnectedcomponentemerges.Whataboutthesmaller-sizecomponents?Howdot

2、heyemerge,andjoinwiththelargeone?3McGlohon,Akoglu,FaloutsosKDD08“Disconnected”components4McGlohon,Akoglu,FaloutsosKDD08WeightededgesGraphshaveheavy-taileddegreedistribution.Whatcanwealsosayabouttheseedges?Howaretheyrepeated,orotherwiseweighted?5McGlohon,Akoglu,Fa

3、loutsosKDD08OurgoalsObserve“Next-largestconnectedcomponents”Q1.HowdoestheGCCemerge?Q2.HowdoNLCC’semergeandjoinwiththeGCC?FindpropertiesthatgovernedgeweightsQ3:Howdoesthetotalweightofthegraphrelatetothenumberofedges?Q4:Howdotheweightsofnodesrelatetodegree?Q5:Doest

4、hisrelationchangewiththegraph?Q6:Canweproduceanemergent,generativemodel66McGlohon,Akoglu,FaloutsosKDD08OutlineMotivationRelatedworkPreliminariesDataObservationsModelSummary123457McGlohon,Akoglu,FaloutsosKDD08PropertiesofnetworksSmalldiameter(“smallworld”phenomeno

5、n)[Milgram67][Leskovec,Horovitz07]Heavy-taileddegreedistribution[Barabasi,Albert99][Faloutsos,Faloutsos,Faloutsos99]Densification[Leskovec,Kleinberg,Faloutsos05]“Middleregion”componentsaswellasGCCandsingletons[Kumar,Novak,Tomkins06]8McGlohon,Akoglu,FaloutsosKDD08

6、GenerativeModelsErdos-Renyimodel[Erdos,Renyi60]PreferentialAttachment[Barabasi,Albert99]ForestFiremodel[Leskovec,Kleinberg,Faloutsos05]Kroneckermultiplication[Leskovec,Chakrabarti,Kleinberg,Faloutsos07]EdgeCopyingmodel[Kumar,Raghavan,Rajagopalan,Sivakumar,Tomkins

7、,Upfal00]“Winnersdon’ttakeall”[Pennock,Flake,Lawrence,Glover,Giles02]99McGlohon,Akoglu,FaloutsosKDD08OutlineMotivationRelatedworkPreliminariesDataObservationsModelSummary12345610McGlohon,Akoglu,FaloutsosKDD08DiameterDiameterofagraphisthe“longestshortestpath”.n1n2

8、n3n4n5n6n711McGlohon,Akoglu,FaloutsosKDD08DiameterDiameterofagraphisthe“longestshortestpath”.diameter=3n1n2n3n4n5n6n712McGlohon,Akoglu,FaloutsosKDD08DiameterDi

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

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

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