offdiagonal complexity a computationally quick complexity measure for graphs and networks

offdiagonal complexity a computationally quick complexity measure for graphs and networks

ID:33507421

大小:279.55 KB

页数:12页

时间:2019-02-26

offdiagonal complexity a computationally quick complexity measure for graphs and networks_第1页
offdiagonal complexity a computationally quick complexity measure for graphs and networks_第2页
offdiagonal complexity a computationally quick complexity measure for graphs and networks_第3页
offdiagonal complexity a computationally quick complexity measure for graphs and networks_第4页
offdiagonal complexity a computationally quick complexity measure for graphs and networks_第5页
资源描述:

《offdiagonal complexity a computationally quick complexity measure for graphs and networks》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、OffdiagonalComplexity:Acomputationallyquickcomplexitymeasureforgraphsandnetworks(PhysicaA,inprint)JensChristianClaussenInstitutf¨urTheoretischePhysikundAstrophysik,Universit¨atKiel,Leibnizstraße15,24098Kiel,Germanyphone++49-431-880-4096claussen@theo-physik.uni-kiel.deAbstractAvastvarietyofbiolo

2、gical,social,andeconomicalnetworksshowstopologiesdras-ticallydifferingfromrandomgraphs;yetthequantitativecharacterizationremainsunsatisfactoryfromaconceptualpointofview.Motivatedfromthediscussionofsmallscale-freenetworks,abiasedlinkdistributionentropyisdefined,whichtakesanextremumforapowerlawdis

3、tribution.Thisapproachisextendedtothenode-nodelinkcross-distribution,whosenondiagonalelementscharacterizethegraphstructurebeyondlinkdistribution,clustercoefficientandaveragepathlength.Fromhereasimple(andcomputationallycheap)complexitymeasurecanbedefined.ThisOffdiagonalComplexity(OdC)isproposedasan

4、ovelmeasuretocharacterizethecomplexityofanundirectedgraph,ornetwork.WhilebothforregularlatticesandfullyconnectednetworksOdCiszero,ittakesamoderatelylowvalueforarandomgraphandshowshighvaluesforapparentlycomplexstructuresasscale-freenet-worksandhierarchicaltrees.TheOffdiagonalComplexityapporachis

5、appliedtotheHelicobacterpyloriproteininteractionnetworkandrandomlyrewiredsurrogates.arXiv:q-bio/0410024v2[q-bio.MN]23Aug20061IntroductionWhilerandomgraphtheoryandscale-freenetworkresearchknowasetofstandardmeasurestoquantifytheirproperties,thequestionofcomplexityofagraphstillisinitsinfancies.A‘

6、blind’applicationofothercomplexityPreprintsubmittedtoElsevierScienceOctober16,2004;revisedAugust11,2006measures(asforbinarysequencesorcomputerprograms)doesnotaccountforthespecialpropertiessharedbygraphsandespeciallyscale-freegraphs.Moreover,someknowncomplexitymeasuresthemselveshaveahighcompu-t

7、ationalcomplexity.Sinceaseriesofseminalpapers(Watts&Strogatz[1],Barabasi&Albert[2][2,3],Newman[4],Dorogovtsev&Mendes[5])since1999(seealso[6]foranoverview),small-worldandscale-freenetworksareahottopicofinvestigationinabroadrangeofsystems

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

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

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