Related papers: Renormalization group analysis of the small-world …
Perturbative renormalization group theory is developed as a unified tool for global asymptotic analysis. With numerous examples, we illustrate its application to ordinary differential equation problems involving multiple scales, boundary…
We investigate the quantum phase transition in the transverse-field Ising model on the Sierpi\'nski gasket using finite-size scaling (FSS) and numerical renormalization group (NRG). Since next generations of the fractal lattice contain…
We consider the random-field O($N$) spin model with long-range exchange interactions which decay with distance $r$ between spins as $r^{-d-\sigma}$ and/or random fields which correlate with distance $r$ as $r^{-d+\rho}$, and reexamine the…
A perturbative renormalization group method is used to obtain steady-state density profiles of a particle non-conserving asymmetric simple exclusion process. This method allows us to obtain a globally valid solution for the density profile…
Watts and Strogatz [Nature 393, 440 (1998)] have recently introduced a model for disordered networks and reported that, even for very small values of the disorder $p$ in the links, the network behaves as a small-world. Here, we test the…
The phase transitions of random-field q-state Potts models in d=3 dimensions are studied by renormalization-group theory by exact solution of a hierarchical lattice and, equivalently, approximate Migdal-Kadanoff solutions of a cubic…
In this study we introduce and analyze the statistical structural properties of a model of growing networks which may be relevant to social networks. At each step a new node is added which selects 'k' possible partners from the existing…
The small-world network model is a simple model of the structure of social networks, which simultaneously possesses characteristics of both regular lattices and random graphs. The model consists of a one-dimensional lattice with a low…
The phase diagram of QCD at finite temperature and density and the existence of a critical point are currently very actively researched topics. Although tremendous progress has been made, in the case of two light quark flavors even the…
We analyze in some detail a recently proposed transfer matrix mean field approximation which yields the exact critical point for several two dimensional nearest neighbor Ising models. For the square lattice model we show explicitly that…
Complex networks have been studied extensively due to their relevance to many real systems as diverse as the World-Wide-Web (WWW), the Internet, energy landscapes, biological and social networks…
A network is said to have the properties of a small world if a suitably defined average distance between any two nodes is proportional to the logarithm of the number of nodes, $N$. In this paper, we present a novel derivation of the…
We investigate the onset of the discontinuous percolation transition in small-world hyperbolic networks by studying the systems-size scaling of the typical largest cluster approaching the transition, $p\nearrow p_{c}$. To this end, we…
Complex networks has been a hot topic of research over the past several years over crossing many disciplines, starting from mathematics and computer science and ending by the social and biological sciences. Random graphs were studied to…
We formally introduce a class of models inspired by renormalization group (RG) theory, built on additive hierarchical expansions analogous to those appearing in functional ANOVA and mixed-effects models. Like ReLU convolutional neural…
We study how the finite-sized n-component model A with periodic boundary conditions relaxes near its bulk critical point from an initial nonequilibrium state with short-range correlations. Particular attention is paid to the universal…
The degree distribution, referred to as the delta-sequence of a network is studied. Using the non-normalized Lorenz curve, we apply a generalized form of the classical majorization partial order. Next, we introduce a new class of small…
We apply a variant of the explosive percolation procedure to large real-world networks, and show with finite-size scaling that the university class, ordinary or explosive, of the resulting percolation transition depends on the structural…
We propose the $K$-selective percolation process as a model for the iterative removals of nodes with the specific intermediate degree in complex networks. In the model, a random node with degree $K$ is deactivated one by one until no more…
Scale free dynamics are observed in a variety of physical and biological systems. These include neural activity in which evidence for scale freeness has been reported using a range of imaging modalities. Here, we derive the ways in which…