Related papers: Renormalization group for evolving networks
Correlators describing the vulcanization transition are constructed and explored via a renormalization group approach. This approach is based on a minimal model that accounts for the thermal motion of constituents and the quenched random…
The stochastic addition of either vertices or connections in a network leads to the observation of the percolation transition, a structural change with the appearance of a connected component encompassing a finite fraction of the system.…
We study neural connectivity in cultures of rat hippocampal neurons. We measure the neurons' response to an electric stimulation for gradual lower connectivity, and characterize the size of the giant cluster in the network. The connectivity…
Given a connected network, it can be augmented by applying a growing strategy (e.g. random or scale-free rules) over the previously existing structure. Another approach for augmentation, recently introduced, involves incorporating a direct…
The critical phase of bond percolation on the random growing tree is examined. It is shown that the root cluster grows with the system size $N$ as $N^\psi$ and the mean number of clusters with size $s$ per node follows a power function $n_s…
In this work we investigate the spectra of Laplacian matrices that determine many dynamic properties of scale-free networks below and at the percolation threshold. We use a replica formalism to develop analytically, based on an integral…
The renormalization group method is a successive integration over the fluctuations which are ordered according to their length scale, a parameter in the external space. A different procedure is described, where the fluctuations are treated…
We study the ``renormalization group action'' induced by cycles of cosmic expansion and contraction, within the context of a family of stochastic dynamical laws for causal sets derived earlier. We find a line of fixed points corresponding…
Classical percolation theory underlies many processes of information transfer along the links of a network. In these standard situations, the requirement for two nodes to be able to communicate is the presence of at least one uninterrupted…
Renormalization group (RG) methods, which model the way in which the effective behavior of a system depends on the scale at which it is observed, are key to modern condensed-matter theory and particle physics. We compare the ideas behind…
We propose a maximally disassortative (MD) network model which realizes a maximally negative degree-degree correlation, and study its percolation transition to discuss the effect of a strong degree-degree correlation on the percolation…
Classical blockmodel is known as the simplest among models of networks with community structure. The model can be also seen as an extremely simply example of interconnected networks. For this reason, it is surprising that the percolation…
Co-evolutionary adaptive mechanisms are not only ubiquitous in nature, but also beneficial for the functioning of a variety of systems. We here consider an adaptive network of oscillators with a stochastic, fitness-based, rule of…
In the last decades, many authors have used the susceptible-infected-recovered model to study the impact of the disease spreading on the evolution of the infected individuals. However, few authors focused on the temporal unfolding of the…
We study the site-bond percolation on a hierarchical scale-free network, namely, the decorated (2,2)-flower, by using the renormalization group technique. The phase diagram essentially depends on the fraction of occupied sites.…
The quintessential property of neuronal systems is their intensive patterns of selective synaptic connections. The current work describes a physics-based approach to neuronal shape modeling and synthesis and its consideration for the…
We define a statistical ensemble of non-degenerate graphs, i.e. graphs without multiple- and self-connections between nodes. The node degree distribution is arbitrary, but the nodes are assumed to be uncorrelated. This completes our earlier…
Numerous correlated electron systems exhibit a strongly scale-dependent behavior. Upon lowering the energy scale, collective phenomena, bound states, and new effective degrees of freedom emerge. Typical examples include (i) competing…
We present an exact mathematical framework able to describe site-percolation transitions in real multiplex networks. Specifically, we consider the average percolation diagram valid over an infinite number of random configurations where…
We propose and analyze a stochastic model which explains, analytically, the cutoff behavior of real scale-free networks previously modeled computationally by Amaral et al. [Proc. Natl. Acad. Sci. U.S.A. 97, 11149 (2000)] and others. We…