Related papers: A scale-free network hidden in the collapsing poly…
An extended polymer collapses to form a globule when subjected to a quench below the collapse transition temperature. The process begins with the formation of clusters of monomers or ``pearls''. The nascent clusters merge, resulting in…
A linear copolymer made of two reciprocally attracting N-monomer blocks collapses to a compact phase through a novel transition, whose exponents are determined with extensive MC simulations in two and three dimensions. In the former case,…
We investigate the phase diagram of disordered copolymers at the interface between two selective solvents, and in particular its weak-coupling behavior, encoded in the slope $m_c$ of the critical line at the origin. In mathematical terms,…
Many complex systems--from social and communication networks to biological networks and the Internet--are thought to exhibit scale-free structure. However, prevailing explanations rely on the constant addition of new nodes, an assumption…
Several fundamental properties of real complex networks, such as the small-world effect, the scale-free degree distribution, and recently discovered topological fractal structure, have presented the possibility of a unique growth mechanism…
It is generally accepted that scale-free networks is prone to epidemic spreading allowing the onset of large epidemics whatever the spreading rate of the infection. In the paper, we show that disease propagation may be suppressed in…
We demonstrate that the self-similarity of some scale-free networks with respect to a simple degree-thresholding renormalization scheme finds a natural interpretation in the assumption that network nodes exist in hidden metric spaces.…
Here, we propose a class of scale-free networks $G(t;m)$ with some intriguing properties, which can not be simultaneously held by all the theoretical models with power-law degree distribution in the existing literature, including (i)…
Many real life networks present an average path length logarithmic with the number of nodes and a degree distribution which follows a power law. Often these networks have also a modular and self-similar structure and, in some cases -…
In complex systems, responses to small perturbations are too diverse to predict how much they would be definitely, and then such diverse responses can be predicted in a probabilistic way. Here we study such a problem in scale-free networks,…
We study scale-free networks constructed via a cooperative Achlioptas growth process. Links between nodes are introduced in the network in order to produce a scale-free graph with given exponent lambda for the degree distribution, but the…
We present a family of scale-free network model consisting of cliques, which is established by a simple recursive algorithm. We investigate the networks both analytically and numerically. The obtained analytical solutions show that the…
We study the contact process on a class of evolving scale-free networks, where each node updates its connections at independent random times. We give a rigorous mathematical proof that there is a transition between a phase where for all…
We study the behavior of scale-free networks, having connectivity distribution P(k) k^-a, close to the percolation threshold. We show that for networks with 3<a<4, known to undergo a transition at a finite threshold of dilution, the…
We consider polymers in which M randomly selected pairs of monomers are restricted to be in contact. Analytical arguments and numerical simulations show that an ideal (Gaussian) chain of N monomers remains expanded as long as M<<N; its mean…
Using a simple model with link removals as well as link additions, we show that an evolving network is scale free with a degree exponent in the range of (2, 4]. We then establish a relation between the network evolution and a set of…
We prove the fractal crumpled structure of collapsed unknotted polymer ring. In this state the polymer chain forms a system of densely packed folds, mutually separated in all scales. The proof is based on the numerical and analytical…
We study the structural constraint of random scale-free networks that determines possible combinations of the degree exponent $\gamma$ and the upper cutoff $k_c$ in the thermodynamic limit. We employ the framework of graphicality…
Critical phenomena on scale-free networks with a degree distribution $p_k \sim k^{-\lambda}$ exhibit rich finite-size effects due to its structural heterogeneity. We systematically study the finite-size scaling of percolation and identify…
We provide a simple proof that graphs in a general class of self-similar networks have zero percolation threshold. The considered self-similar networks include random scale-free graphs with given expected node degrees and zero clustering,…