About the L2 analyticity of markov operators on graphs

Joseph Feneuil

Research output: Contribution to journalArticlepeer-review


Let Γ be a graph and P be a reversible random walk on Γ. From the L2 analyticity of the Markov operator P, we deduce that an iterate of odd exponent of P is ‘lazy’, that is, there exists an integer k such that the transition probability (for the random walk P2k+1) from a vertex x to itself is uniformly bounded from below. The proof does not require the doubling property on G but only a polynomial control of the volume.

Original languageEnglish (US)
Pages (from-to)1793-1805
Number of pages13
JournalProceedings of the American Mathematical Society
Issue number4
StatePublished - 2018

Bibliographical note

Publisher Copyright:
© 2017 American Mathematical Society.


  • Discrete analyticity
  • Graphs
  • Lazy random walks
  • Markov chains


Dive into the research topics of 'About the L2 analyticity of markov operators on graphs'. Together they form a unique fingerprint.

Cite this