Related papers: A scale-free network hidden in the collapsing poly…
We study the collapse of two-dimensional polymers, via an O($n$) model on the square lattice that allows for dilution, bending rigidity and short-range monomer attractions. This model contains two candidates for the theta point,…
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…
Scale-free networks (SFN) arise from simple growth processes, which can encourage efficient, centralized and fault tolerant communication (1). Recently its been shown that stable network hub structure is governed by a phase transition at…
We investigate the presence of triangles in a class of correlated random graphs in which hidden variables determine the pairwise connections between vertices. The class rules out self-loops and multiple edges and allows for negative degree…
Learning the network structure underlying data is an important problem in machine learning. This paper introduces a novel prior to study the inference of scale-free networks, which are widely used to model social and biological networks.…
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 study universal aspects of polymer conformations and transverse fluctuations for a single swollen chain characterized by a contour length $L$ and a persistence length $\ell_p$ in two dimensions (2D) and in three dimensions (3D) in the…
It is a mainstream idea that scale-free network would be fragile under the selective attacks. Internet is a typical scale-free network in the real world, but it never collapses under the selective attacks of computer viruses and hackers.…
Connectivity correlations play an important role in the structure of scale-free networks. While several empirical studies exist, there is no general theoretical analysis that can explain the largely varying behavior of real networks. Here,…
We investigate the internal structure of a polymer during collapse from an expanded coil to a compact globule. Collapse is more probable in local regions of high curvature, so a smoothing of the fractal polymer structure occurs that…
Extending previous results in the literature, random colored substitution networks and degree dimension are defined in this paper. The scale-freeness of these networks is proved by introducing a new definition for degree dimension that is…
We present simulation results for the contact process on regular, cubic networks that are composed of a one-dimensional lattice and a set of long edges with unbounded length. Networks with different sets of long edges are considered, that…
We study the tolerance to congestion failures in communication networks with scale-free topology. The traffic load carried by each damaged element in the network must be partly or totally redistributed among the remaining elements.…
We study the evolution of random graphs where edges are added one by one between pairs of weighted vertices so that resulting graphs are scale-free with the degree exponent $\gamma$. We use the branching process approach to obtain scaling…
Scale-free networks arise from power-law degree distributions. Due to the finite size of real-world networks, the power law inevitably has a cutoff at some maximum degree $\Delta$. We investigate the relative size of the giant component $S$…
We prove that the presence of a diagonal assortative degree correlation, even if small, has the effect of dramatically lowering the epidemic threshold of large scale-free networks. The correlation matrix considered is…
Collapse of the polymer chain upon the sharp decrease of solvent quality is studied. During collapse, any pair of polymer units appearing in a sufficiently close vicinity in space has the possibility with a certain probability to form an…
We consider a dense urban cellular network where the base stations (BSs) are stacked vertically as well as extending infinitely in the horizontal plane, resulting in a greater than two dimensional (2D) deployment. Using a dual-slope path…
We study fully synchronized states in scale-free networks of chaotic logistic maps as a function of both dynamical and topological parameters. Three different network topologies are considered: (i) random scale-free topology, (ii)…
Temporal gene expression data (Wen, et. al.) was analyzed using the recently introduced inverse modeling technique of Embedded Complex Logistic Maps (ECLM). Preliminary results indicate scale-free structure in the gene regulatory network…