Matrix representation of evolving networks
K. Malarz, K. Kulakowski
Abstract
We present the distance matrix evolution for different types of networks: exponential, scale-free and classical random ones. Statistical properties of these matrices are discussed as well as topological features of the networks. Numerical data on the degree and distance distributions are compared with theoretical predictions.
Create a lesson
Related papers
Real-Space renormalization for the drawups and drawdowns of stochastic trajectories: universality classes for diffusion processes and random walks via the scale function
Cecile Monthus
Stochastic synthesis and degradation of arbitrary diffusive processes
Denis Boyer, Gabriel Mercado-Vásquez
Critical amplitudes of the Baxter-Wu model from MCPA and Wolff simulations: free-exponent and fixed-exponent fits
Vyacheslav Mozolenko, Ian Pile, Lev Shchur
Capillary Coarsening Drives Re-entrant Statistical Transitions in Early Coffee-Ring Growth
Arundas Chandradasan, Dileep Mampallil
Maximum entropy explanation for the ubiquity of power-law mechanical responses
Sverre Holm
Thermodynamic Bethe Ansatz for the Toda chain from inverse scattering transform
Alberto Brollo