相关论文: Renormalization group for evolving networks
We discuss three related models of scale-free networks with the same degree distribution but different correlation properties. Starting from the Barabasi-Albert construction based on growth and preferential attachment we discuss two other…
We present a detailed discussion of a novel dynamical renormalization group scheme: the Dynamically Driven Renormalization Group (DDRG). This is a general renormalization method developed for dynamical systems with non-equilibrium critical…
We study the critical behavior for percolation on inhomogeneous random networks on $n$ vertices, where the weights of the vertices follow a power-law distribution with exponent $\tau \in (2,3)$. Such networks, often referred to as…
We consider Bernoulli bond percolation on a large scale-free tree in the supercritical regime, meaning informally that there exists a giant cluster with high probability. We obtain a weak limit theorem for the sizes of the next largest…
Detecting and characterizing community structure plays a crucial role in the study of networked systems. However, there is still a lack of understanding of how community structure affects the systems' resilience and stability. Here, we…
Percolation theory can be used to describe the structural properties of complex networks using the generating function formulation. This mapping assumes that the network is locally tree-like and does not contain short-range loops between…
The spontaneous formation and subsequent growth, dissolution, merger and competition of social groups bears similarities to physical phase transitions in metastable finite systems. We examine three different scenarios, percolation, spinodal…
We compare phase transition and critical phenomena of bond percolation on Euclidean lattices, nonamenable graphs, and complex networks. On a Euclidean lattice, percolation shows a phase transition between the nonpercolating phase and…
We propose that the size of an operator evolved under holographic renormalization group flow shall grow linearly with the scale and interpret this behavior as a manifestation of the saturation of the chaos bound. To test this conjecture, we…
We describe the critical behavior of weak multiplex percolation, a generalization of percolation to multiplex or interdependent networks. A node can determine its active or inactive status simply by referencing neighboring nodes. This is…
Combinations of random and preferential growth for both on-growing and stationary networks are studied and a hierarchical topology is observed. Thus for real world scale-free networks which do not exhibit hierarchical features preferential…
We study numerically a model of nonequilibrium networks where nodes and links are added at each time step with aging of nodes and connectivity- and age-dependent attachment of links. By varying the effects of age in the attachment…
Complex networks from such different fields as biology, technology or sociology share similar organization principles. The possibility of a unique growth mechanism promises to uncover universal origins of collective behaviour. In…
In this letter, we proposed an ungrowing scale-free network model, wherein the total number of nodes is fixed and the evolution of network structure is driven by a rewiring process only. In spite of the idiographic form of $G$, by using a…
Methods for determining the percolation threshold usually study the behavior of network ensembles and are often restricted to a particular type of probabilistic node/link removal strategy. We propose a network-specific method to determine…
Recently increasing attention has been addressed to the fluctuations observed in percolation defined in single and multiplex networks. These fluctuations are extremely important to characterize the robustness of real finite networks but…
A new ''static'' renormalization group approach to stochastic models of fluctuating surfaces with spatially quenched noise is proposed in which only time-independent quantities are involved. As examples, quenched versions of the…
The renormalization group method is applied to the study of homogeneous and flat Friedmann-Robertson-Walker type Universes, filled with a causal bulk viscous cosmological fluid. The starting point of the study is the consideration of the…
We develop a method to obtain the large N renormalization group flows for matrix models of 2 dimensional gravity plus branched polymers. This method gives precise results for the critical points and exponents for one matrix models. We show…
Transport is an important function in many network systems and understanding its behavior on biological, social, and technological networks is crucial for a wide range of applications. However, it is a property that is not well-understood…