An equation-free approach to coarse-graining the dynamics of networks
From MaRDI portal
Publication:482712
DOI10.3934/jcd.2014.1.111zbMath1317.68257arXiv1202.5618OpenAlexW2963321670MaRDI QIDQ482712
Balász Ráth, Katherine A. Bold, Karthikeyan Rajendran, Ioannis G. Kevrekidis
Publication date: 6 January 2015
Published in: Journal of Computational Dynamics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1202.5618
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Applications to the sciences (65Z05) Dynamical systems involving maps of trees and graphs (37E25)
Related Items
Coarse-Graining and Simplification of the Dynamics Seen in Bursting Neurons ⋮ A toolbox of equation-free functions in Matlab/Octave for efficient system level simulation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on weak convergence of random step processes
- Generation of networks with prescribed degree-dependent clustering
- Synchronization of coupled oscillators on small-world networks
- The dynamics of chimera states in heterogeneous Kuramoto networks
- Limits of dense graph sequences
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- From molecular dynamics to coarse self-similar solutions: a simple example using equation-free computation
- Connected components in random graphs with given expected degree sequences
- Heterogeneous animal group models and their group-level alignment dynamics: an equation-free approach
- Complex networks: structure and dynamics
- An equation-free approach to analyzing heterogeneous cell population dynamics
- Diffusion maps, spectral clustering and reaction coordinates of dynamical systems
- Equation-free, coarse-grained multiscale computation: enabling microscopic simulators to perform system-level analysis
- A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
- Statistical mechanics of complex networks
- Emergence of Scaling in Random Networks
- A remark on the existence of finite graphs
- Very large graphs
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- Some problems in the enumeration of labelled graphs
- The Structure and Function of Complex Networks
- Random graph models of social networks
- Dynamical Processes on Complex Networks
- Collective dynamics of ‘small-world’ networks
