Related papers: Scale-free download network for publications
Probability distributions having power-law tails are observed in a broad range of social, economic, and biological systems. We describe here a potentially useful common framework. We derive distribution functions $\{p_k\}$ for situations in…
We study the cross-correlations in stock price changes between the S&P 500 companies by introducing a weighted random graph, where all vertices (companies) are fully connected, and each edge is weighted. The weight assigned to each edge is…
Recently there have been a tremendous interest in models of networks with a power-law distribution of degree -- so called "scale-free networks." It has been observed that such networks, normally, have extremely short path-lengths, scaling…
Topological properties of "scale-free" networks are investigated by determining their spectral dimensions $d_S$, which reflect a diffusion process in the corresponding graphs. Data bases for citation networks and metabolic networks together…
Despite their diverse origin, networks of large real-world systems reveal a number of common properties including small-world phenomena, scale-free degree distributions and modularity. Recently, network self-similarity as a natural outcome…
It has been well-known that many real networks are scale-free (SF) but extremely vulnerable against attacks. We investigate the robustness of connectivity and the lengths of the shortest loops in randomized SF networks with realistic…
We give an intuitive though general explanation of the finite-size effect in scale-free networks in terms of the degree distribution of the starting network. This result clarifies the relevance of the starting network in the final degree…
We study a random walk problem on the hierarchical network which is a scale-free network grown deterministically. The random walk problem is mapped onto a dynamical Ising spin chain system in one dimension with a nonlocal spin update rule,…
For the first time ever, we analyze a unique public procurement database, which includes information about a number of bidders for a contract, a final price, an identification of a winner and an identification of a contracting authority for…
In this work we analyze scale-free networks with different power law spectra $N(k) \sim k^{-\gamma}$ under a boolean dynamic, where the boolean rule that each node obeys is a function of its connectivity $k$. This is done by using only two…
We propose a simple random process inducing various types of random graphs and the scale free random graphs among others. The model is of a threshold nature and differs from the preferential attachment approach discussed in the literature…
The power-law distribution is ubiquitous and its mechanism seems to be various. We find a general mechanism for the distribution. The distribution of a geometrically growing system can be approximated by a log - completely squared chi…
In this letter, we investigate the detailed epidemic spreading process in scale-free networks with links' weights that denote familiarity between two individuals and find that spreading velocity reaches a peak quickly then decays in a…
Many networks are characterized by highly heterogeneous distributions of links, which are called scale-free networks and the degree distributions follow $p(k)\sim ck^{-\alpha}$. We study the robustness of scale-free networks to random…
We model certain features of human language complexity by means of advanced concepts borrowed from statistical mechanics. Using a time series approach, the diffusion entropy method (DE), we compute the complexity of an Italian corpus of…
Power-law distributions with various exponents are studied. We first introduce a simple and generic model that reproduces Zipf's law. We can regard this model both as the time evolution of the population of cities and that of the asset…
We investigate Bak-Sneppen coevolution models on scale-free networks with various degree exponents $\gamma$ including random networks. For $\gamma >3$, the critical fitness value $f_c$ approaches to a nonzero finite value in the limit $N…
The hidden variable formalism (based on the assumption of some intrinsic node parameters) turned out to be a remarkably efficient and powerful approach in describing and analyzing the topology of complex networks. Owing to one of its most…
We investigate transitions of portals users between different subpages. A weighted network of portals subpages is reconstructed where edge weights are numbers of corresponding transitions. Distributions of link weights and node strengths…
We study the load distribution in weighted networks by measuring the effective number of optimal paths passing through a given vertex. The optimal path, along which the total cost is minimum, crucially depend on the cost distribution…