Related papers: Entrograms and coarse graining of dynamics on comp…
We interpret the subgraph centrality as the partition function of a network. The entropy, the internal energy and the Helmholtz free energy are defined for networks and molecular graphs on the basis of graph spectral theory. Various…
Finite stochastic Markov models play a major role for modelling biochemical pathways. Such models are a coarse-grained description of the underlying microscopic dynamics and can be considered mesoscopic. The level of coarse-graining is to a…
Molecular dynamics (MD) simulation is essential for various scientific domains but computationally expensive. Learning-based force fields have made significant progress in accelerating ab-initio MD simulation but are not fast enough for…
For optimal processing and design of entangled polymeric materials it is important to establish a rigorous link between the detailed molecular composition of the polymer and the viscoelastic properties of the macroscopic melt. We review…
We investigate nonequilibrium steady-state dynamics in both continuous- and discrete-state stochastic processes. Our analysis focuses on planar diffusion dynamics and their coarse-grained approximations by discrete-state Markov chains.…
Brute-force simulations for dynamics on very large networks are quite expensive. While phenomenological treatments may capture some macroscopic properties, they often ignore important microscopic details. Fortunately, one may be only…
In loop quantum gravity, partitioning graph introduces boundaries and entanglement between spin sub-networks, reflecting non-local degrees of freedom and correlation amongst spatial regions. This gives rise to the view of coarse-graining,…
Many complex systems exhibit interactions that depend not only on pairwise connections, but also group structures and memory effects. To capture such effects, we develop a unified tensor framework for modeling higher-order Markov chains…
We investigate a generalised version of the recently proposed ordinal partition time series to network transformation algorithm. Firstly we introduce a fixed time lag for the elements of each partition that is selected using techniques from…
We propose a coarse-grained model for polymer chains and polymer networks based on the meso-scale dynamics. The model takes the internal degrees of freedom of the constituent polymer chains into account using memory functions and colored…
There is increasing evidence to suggest functional connectivity networks are non-stationary. This has lead to the development of novel methodologies with which to accurately estimate time-varying functional connectivity networks. Many of…
A plethora of natural and industrial shear-driven granular flows exhibit particle-size segregation. Its occurrence is commonly attributed to two primary mechanisms: kinetic sieving and squeeze expulsion. While kinetic sieving is relatively…
The ability to control complex networks is of crucial importance across a wide range of applications in natural and engineering sciences. However, issues of both theoretical and numerical nature introduce fundamental limitations to…
We survey information-theoretic approaches to the reduction of Markov chains. Our survey is structured in two parts: The first part considers Markov chain coarse graining, which focuses on projecting the Markov chain to a process on a…
We propose generalizations of a number of standard network models, including the classic random graph, the configuration model, and the stochastic block model, to the case of time-varying networks. We assume that the presence and absence of…
Discrete models usually represent approximations to continuum physics. Cylindrical consistency provides a framework in which discretizations mirror exactly the continuum limit. Being a standard tool for the kinematics of loop quantum…
We propose a Markov chain simulation method to generate simple connected random graphs with a specified degree sequence and level of clustering. The networks generated by our algorithm are random in all other respects and can thus serve as…
Spin foams are models of quantum gravity and therefore quantum space time. A key open issue is to determine the possible continuum phases of these models. Progress on this issue has been prohibited by the complexity of the full…
From longitudinal biomedical studies to social networks, graphs have emerged as a powerful framework for describing evolving interactions between agents in complex systems. In such studies, after pre-processing, the data can be represented…
The focus of this article is on entropy and Markov processes. We study the properties of functionals which are invariant with respect to monotonic transformations and analyze two invariant "additivity" properties: (i) existence of a…