Skip to main content

Some Observations on Dynamic Random Walks and Network Renormalization

Author(s): Chazelle, Bernard

Download
To refer to this page use: http://arks.princeton.edu/ark:/88435/pr17r7c
Full metadata record
DC FieldValueLanguage
dc.contributor.authorChazelle, Bernard-
dc.date.accessioned2021-10-08T19:45:57Z-
dc.date.available2021-10-08T19:45:57Z-
dc.date.issued2019en_US
dc.identifier.citationChazelle, Bernard. "Some Observations on Dynamic Random Walks and Network Renormalization." International Symposium on Fundamentals of Computation Theory (2019): pp. 18-28. doi:10.1007/978-3-030-25027-0_2en_US
dc.identifier.issn0302-9743-
dc.identifier.urihttps://www.cs.princeton.edu/~chazelle/pubs/fct2019.pdf-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/pr17r7c-
dc.description.abstractWe recently developed a general bifurcation analysis framework for establishing the periodicity of certain time-varying random walks. In this work, we look at the special case of lazy uniform-inflow random walks and show how a much simpler version of the argument can be used to resolve their analysis. We also revisit a renormalization technique for network sequences that we introduced earlier and we propose a few simplifications. This work can be viewed as a gentle introduction to Markov influence systems.en_US
dc.format.extent18 - 28en_US
dc.language.isoen_USen_US
dc.relation.ispartofInternational Symposium on Fundamentals of Computation Theoryen_US
dc.rightsAuthor's manuscripten_US
dc.titleSome Observations on Dynamic Random Walks and Network Renormalizationen_US
dc.typeConference Articleen_US
dc.identifier.doi10.1007/978-3-030-25027-0_2-
dc.identifier.eissn1611-3349-
pu.type.symplectichttp://www.symplectic.co.uk/publications/atom-terms/1.0/conference-proceedingen_US

Files in This Item:
File Description SizeFormat 
DynamicRandomWalksNetworkRenormalization.pdf254.5 kBAdobe PDFView/Download


Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.