Exact analysis of summary statistics for continuous-time discrete-state Markov processes on networks using graph-automorphism lumping
Abstract We propose a unified framework to represent a wide range of continuous-time discrete-state Markov processes on networks, and show how many network dynamics models in the literature can be represented in this unified framework. We show how a particular sub-set of these models, referred to he...
Main Authors: | Jonathan A. Ward, Martín López-García |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2019-11-01
|
Series: | Applied Network Science |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1007/s41109-019-0206-4 |
Similar Items
Similar Items
-
Graph automorphisms for compression
by: Čibej Uroš, et al.
Published: (2020-12-01) -
Topics in graph automorphisms and reconstruction /
by: Lauri, Josef, 1955-, et al.
Published: (2003) -
The automorphism group of the Andrásfai graph
by: Seyed Morteza Mirafzal
Published: (2022-06-01) -
Automorphism group of certain power graphs of finite groups
by: Ali Reza Ashrafi, et al.
Published: (2017-04-01) -
On Automorphisms of a Distance-Regular Graph with Intersection Array {125,96,1;1,48,125}
by: V.V. Bitkina, et al.
Published: (2017-03-01)