Semi-Markov Graph Dynamics 英文参考文献.docVIP

Semi-MarkovGraphDynamics MarcoRaberto1,FabioRapallo2,EnricoScalas2,3* 1Dipartimento di Ingegneria Biofisica ed Elettronica,Universita` degli Studi di Genova, Genova, Italy, 2Dipartimento di Scienze eTecnologie Avanzate, Universita` del PiemonteOrientale‘‘AmedeoAvogadro’’,Alessandria,Italy,3BasqueCenterforAppliedMathematics,BizkaiaTechnologyPark,Derio,Spain Abstract Inthispaper,weoutlineamodelofgraph(ornetwork)dynamicsbasedontwoingredients.ThefirstingredientisaMarkov chainonthespaceofpossiblegraphs.Thesecondingredientisasemi-Markovcountingprocessofrenewaltype.Themodel consistsinsubordinatingtheMarkovchaintothesemi-Markovcountingprocess.Insimplewords,thismeansthatthechain transitionsoccuratrandomtimeinstantscalledepochs.Themodelisquiterichanditspossibleconnectionswithalgebraic geometryarebrieflydiscussed.Moreover,forthesakeofsimplicity,wefocusonthespaceofundirectedgraphswithafixed numberofnodes.However,inanexample,wepresentaninterbankmarketmodelwhereitismeaningfultousedirected graphsorevenweightedgraphs. Citation:RabertoM,RapalloF,ScalasE(2011)Semi-MarkovGraphDynamics.PLoSONE6(8):e23370.doi:10.1371/journal.pone.0023370 Editor:MatjazPerc,UniversityofMaribor,Slovenia ReceivedMay21,2011;AcceptedJuly13,2011;PublishedAugust24,2011 Copyright: ? 2011 Raberto et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricteduse,distribution,andreproductioninanymedium,providedtheoriginalauthorandsourcearecredited. Funding: This study was funded in part by the INdAM (Istituto Italiano di Alta Matematica http://www.altamatematica.it/en), by the Erasmus Teaching Staff program,andtheResearchPromotionPlan2010ofUniversitatJaumeI,CastellondeLaPlana,Spain.Thefundershadnoroleinstudydesign,datacollectionand analysis,decisiontopublish,orpreparationofthemanuscript. CompetingInterests:EnricoScalasandFabioRapalloareAcademicEditorsforPLoSONE. *E-mail:enrico.scalas@mfn.unipmn.it Introduction article(asretrievedon4May2011