Dynamical real-space renormalization group calculations with a highly connected clustering scheme on disordered networks

Abstract

We have defined a type of clustering scheme preserving the connectivity of the nodes in a network, ignored by the conventional Migdal-Kadanoff bond moving process. In high dimensions, our clustering scheme performs better for correlation length and dynamical critical exponents than the conventional Migdal-Kadanoff bond moving scheme. In two and three dimensions we find the dynamical critical exponents for the kinetic Ising model to be z=2.13 and z=2.09 , respectively, at the pure Ising fixed point. These values are in very good agreement with recent Monte Carlo results. We investigate the phase diagram and the critical behavior of randomly bond diluted lattices in d=2 and 3 in the light of this transformation. We also provide exact correlation exponent and dynamical critical exponent values on hierarchical lattices with power-law and Poissonian degree distributions.