State Aggregations in Markov Chains and Block Models of Networks.

  title={State Aggregations in Markov Chains and Block Models of Networks.},
  author={Mauro Faccin and Michael T. Schaub and Jean-Charles Delvenne},
  journal={Physical review letters},
  volume={127 7},
We consider state-aggregation schemes for Markov chains from an information-theoretic perspective. Specifically, we consider aggregating the states of a Markov chain such that the mutual information of the aggregated states separated by T time steps is maximized. We show that for T=1 this recovers the maximum-likelihood estimator of the degree-corrected stochastic block model as a particular case, which enables us to explain certain features of the likelihood landscape of this generative… 

Figures from this paper

Information-Theoretic Reduction of Markov Chains

  • B. Geiger
  • Mathematics, Computer Science
  • 2022
Information-theoretic approaches to the reduction of Markov chains are surveyed and the concept of lumpability, the phenomenon when a coarse graining yields a reduced Markov model is discussed.

Measuring dynamical systems on directed hypergraphs.

  • M. Faccin
  • Computer Science, Mathematics
    Physical review. E
  • 2022
This paper analyzes the interplay between the structure of a directed hypergraph and a linear dynamical system, a random walk, defined on it, and measures the Dynamical system associated to it.

Dynamical systems on directed hyper-graphs

  • M. Faccin
  • Mathematics, Computer Science
  • 2022
This work analyzes the interplay between the structure of a directed hyper-graph and a dynamical system evolving on it and connects the dynamicalSystem on the h to a corresponding random walk on an effective graph.

Relative, local and global dimension in complex networks

Dimension is a fundamental property of objects and the space in which they are embedded. Yet ideal notions of dimension, as in Euclidean spaces, do not always translate to physical spaces, which can



Encoding dynamics for multiscale community detection: Markov time sweeping for the map equation.

It is shown here that the original map coding scheme, which is both block-averaged and one-step, neglects the internal structure of the communities and introduces an upper scale, the "field-of-view" limit, in the communities it can detect, which can lead to undesirable overpartitioning when communities are far from clique-like.

Entrograms and coarse graining of dynamics on complex networks

The entrogram is used to investigate how specific macro-scale connection patterns in the state-space transition graph of the original dynamics result in desirable properties of coarse grained descriptions, and provides a fresh perspective on the interplay between structure and dynamics in networks.

Networks from Flows - From Dynamics to Topology

Analysing complex networks of prototypical flows and from time series data of the equatorial Pacific, it is found that the analytical model reproduces the most salient features of these networks and thus provides a general foundation of climate networks.

Modelling sequences and temporal networks with dynamic community structures

A data-driven method that determines relevant timescales for the dynamics and uses it to identify communities is presented and a nonparametric Bayesian inference framework is developed that identifies the simplest such model that can explain temporal interaction data.

Memory in network flows and its effects on spreading dynamics and community detection.

It is suggested that accounting for higher-order memory in network flows can help to better understand how real systems are organized and function.

Correlation Networks from Flows. The Case of Forced and Time-Dependent Advection-Diffusion Dynamics

This work proposes a theoretical approach for verifying relations between the correlation matrix and the climate network measures and reveals that correlation networks are not sensitive to steady sources and sinks and the profound impact of the signal decay rate on the network topology.

Multiscale dynamical embeddings of complex networks

A time-dependent dynamical similarity measure between nodes is proposed, which quantifies the effect a node-input has on the network and induces an embedding that can be employed for several analysis tasks.

Inferring hidden Markov models from noisy time sequences: a method to alleviate degeneracy in molecular dynamics

We present a new method for inferring hidden Markov models from noisy time sequences without the necessity of assuming a model architecture, thus allowing for the detection of degenerate states. This

Maps of random walks on complex networks reveal community structure

An information theoretic approach is introduced that reveals community structure in weighted and directed networks of large-scale biological and social systems and reveals a directional pattern of citation from the applied fields to the basic sciences.

Stochastic blockmodels and community structure in networks

  • B. KarrerM. Newman
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2011
This work demonstrates how the generalization of blockmodels to incorporate this missing element leads to an improved objective function for community detection in complex networks and proposes a heuristic algorithm forcommunity detection using this objective function or its non-degree-corrected counterpart.