Related papers: Scaling of disordered recursive networks
We find that the fractal scaling in a class of scale-free networks originates from the underlying tree structure called skeleton, a special type of spanning tree based on the edge betweenness centrality. The fractal skeleton has the…
We consider, computationally and experimentally, the scaling properties of force networks in the systems of circular particles exposed to compression in two spatial dimensions. The simulations consider polydisperse and monodisperse…
Starting from the working hypothesis that both physics and the corresponding mathematics have to be described by means of discrete concepts on the Planck-scale, one of the many problems one has to face in this enterprise is to find the…
It has recently been shown that networks possessing scale-free and fractal properties may exhibit a bifractal nature, in which local structures are described by two different fractal dimensions. In this study, we investigate random walks on…
There are various notions of dimension in fractal geometry to characterise (random and non-random) subsets of $\mathbb R^d$. In this expository text, we discuss their analogues for infinite subsets of $\mathbb Z^d$ and, more generally, for…
We study the fluctuation properties and return-time statistics on inhomogeneous scale-free networks using packets moving with two different dynamical rules; random diffusion and locally navigated diffusive motion with preferred edges.…
The models of $k$-core percolation and interdependent networks (IN) have been extensively studied in their respective fields. A recent study has revealed that they share several common critical exponents. However, several newly discovered…
Real networks are vulnerable to random failures and malicious attacks. However, when a node is harmed or damaged, it may remain partially functional, which helps to maintain the overall network structure and functionality. In this paper, we…
The dynamics of a nonequilibrium system can become complex because the system has many components (e.g., a human brain), because the system is strongly driven from equilibrium (e.g., large Reynolds-number flows), or because the system…
Many real networks are embedded in space, where in some of them the links length decay as a power law distribution with distance. Indications that such systems can be characterized by the concept of dimension were found recently. Here, we…
A new method called diffusion factorial moment (DFM) is used to obtain scaling features embedded in spectra of complex networks. For an Erdos-Renyi network with connecting probability $p_{ER} < \frac{1}{N}$, the scaling parameter is $\delta…
The fractal dimension of domain walls produced by changing the boundary conditions from periodic to anti-periodic in one spatial direction is studied using both the strong-disorder renormalization group and the greedy algorithm for the…
We derive a renormalization method to calculate the spectral dimension $\bar{d}$ of deterministic self-similar networks with arbitrary base units and branching constants. The generality of the method allows the affect of a multitude of…
We consider first and second order consensus algorithms in networks with stochastic disturbances. We quantify the deviation from consensus using the notion of network coherence, which can be expressed as an $H_2$ norm of the stochastic…
The spatial distribution of unvisited/persistent sites in $d=1$ $A+A\to\emptyset$ model is studied numerically. Over length scales smaller than a cut-off $\xi(t)\sim t^{z}$, the set of unvisited sites is found to be a fractal. The fractal…
Complexity measures are designed to capture complex behavior and quantify *how* complex, according to that measure, that particular behavior is. It can be expected that different complexity measures from possibly entirely different fields…
The organization in brain networks shows highly modular features with weak inter-modular interaction. The topology of the networks involves emergence of modules and sub-modules at different levels of constitution governed by fractal laws.…
For real world systems, nonuniform medium is ubiquitous. Therefore, we investigate the diffusion-limited-aggregation process on a two dimensional directed small-world network instead of regular lattice. The network structure is established…
Fractal scaling--a power-law behavior of the number of boxes needed to tile a given network with respect to the lateral size of the box--is studied. We introduce a new box-covering algorithm that is a modified version of the original…
The dynamics of swollen fractal networks (Rouse model) has been studied through computer simulations. The fluctuation-relaxation theorem was used instead of the usual Langevin approach to Brownian dynamics. We measured the equivalent of the…