Exchangeable Markov processes on graphs: Feller case

preprint2015arXivOpen access

Abstract

The transition law of every exchangeable Feller process on the space of countable graphs is determined by a σσ-finite measure on the space of {0,1}×{0,1}\{0,1\}\times\{0,1\}-valued arrays. In discrete-time, this characterization amounts to a construction from an independent, identically distributed sequence of exchangeable random functions. In continuous-time, the behavior is enriched by a Lévy--Itô-type decomposition of the jump measure into mutually singular components that govern global, vertex-level, and edge-level dynamics. Furthermore, every such process almost surely projects to a Feller process in the space of graph limits.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.