Some Observations on Dynamic Random Walks and Network Renormalization

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We 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.

Original languageAmerican English
Title of host publicationFundamentals of Computation Theory - 22nd International Symposium, FCT 2019, Proceedings
EditorsLeszek Antoni Gąsieniec, Jesper Jansson, Christos Levcopoulos
PublisherSpringer Verlag
Pages18-28
Number of pages11
ISBN (Print)9783030250263
DOIs
StatePublished - 2019
Event22nd International Symposium on Fundamentals of Computation Theory, FCT 2019 - Copenhagen, Denmark
Duration: Aug 12 2019Aug 14 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11651 LNCS

Conference

Conference22nd International Symposium on Fundamentals of Computation Theory, FCT 2019
Country/TerritoryDenmark
CityCopenhagen
Period8/12/198/14/19

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Keywords

  • Dynamic random walks
  • Markov influence systems
  • Network renormalization

Fingerprint

Dive into the research topics of 'Some Observations on Dynamic Random Walks and Network Renormalization'. Together they form a unique fingerprint.

Cite this