Interacting two-state Markov chains on undirected networks
classification
🧮 math.DS
math.PR
keywords
chainsinteractingmarkovtwo-statebilinearcontinuous-timeelementaryentropy
read the original abstract
It is shown that irreducible two-state continuous-time Markov chains interacting on a network in a bilinear fashion have a unique stable steady state. The proof is elementary and uses the relative entropy function.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.