Related papers: A scale-free network hidden in the collapsing poly…
We study the realizability of scale free-networks with a given degree sequence, showing that the fraction of realizable sequences undergoes two first-order transitions at the values 0 and 2 of the power-law exponent. We substantiate this…
The process of adsorption on a planar repulsive, "marginal" and attractive wall of long-flexible polymer chains with excluded volume interactions is investigated. The performed scaling analysis is based on formal analogy between the polymer…
Several studies on real complex networks from different fields as biology, economy, or sociology have shown that the degree of nodes (number of edges connected to each node) follows a scale-free power-law distribution like $P(k)\approx…
We present a simple mechanism for generating undirected scale-free networks using random walkers, where the network growth is determined by choosing parent vertices by sequential random walks. We show that this mechanism produces scale-free…
We investigate the existence and location of the surface phase known as the "Surface-Attached Globule" (SAG) conjectured previously to exist in lattice models of three-dimensional polymers when they are attached to a wall that has a short…
It is commonly believed that scale-free networks are robust to massive numbers of random node deletions. For example, Cohen et al. study scale-free networks including some which approximate the measured degree distribution of the Internet.…
Various real-life networks of current interest are simultaneously scale-free and modular. Here we study analytically the average distance in a class of deterministically growing scale-free modular networks. By virtue of the recursive…
Using a steady state process of node duplication and deletion we produce networks with 1/k scale-free degree distributions in the limit of vanishing connectance. This occurs even though there is no growth involved and inherent preferential…
A phase diagram for a surface-interacting long flexible polymer chain in a two-dimensional poor solvent where the possibility of collapse exists is determined using exact enumeration method. A model of a self-attracting self avoiding walk…
We consider a semiflexible polymer in $\mathbb Z^d$ which is a random interface model with a mixed gradient and Laplacian interaction. The strength of the two operators is governed by two parameters called lateral tension and bending…
Single partially confined collapsed polymers are studied in two dimensions. They are described by self-avoiding random walks with nearest-neighbour attractions below the $\Theta$-point, on the surface of an infinitely long cylinder. For the…
The critical incompatibility of polymers with different compositions scales inversely with their length. For instance, a mixture of A and B homopolymers of length $N$ segregates at $\chi_{AB}^{cr} = 2/N$. But what if the difference between…
Scale-free networks with topology-dependent interactions are studied. It is shown that the universality classes of critical behavior, which conventionally depend only on topology, can also be explored by tuning the interactions. A mapping,…
We investigate mechanisms of the typically observed recoverable prevalence in epidemic spreading. Assuming the time-independent connectivity correlations, we analyze the dynamics of spreading on linearly growing scale-free (SF) networks,…
We propose and study a model of scale-free growing networks that gives a degree distribution dominated by a power-law behavior with a model-dependent, hence tunable, exponent. The model represents a hybrid of the growing networks based on…
It was discovered a few years ago that many networks in the real world exhibit self-similarity. A lot of researches on the structures and processes on real and artificial fractal complex networks have been done, drawing an analogy to…
We propose a general geometric growth model for pseudofractal scale-free web, which is controlled by two tunable parameters. We derive exactly the main characteristics of the networks: degree distribution, second moment of degree…
We study Erd\"{o}s-R\'enyi random graphs with random weights associated with each link. We generate a new ``Supernode network'' by merging all nodes connected by links having weights below the percolation threshold (percolation clusters)…
We investigate a growing network model that combines preferential and uniform attachment with two distinct mechanisms of edge deletion. In addition to the usual uniform probability edge deletion, we introduce a novel node-based rule in…
Many complex systems, such as communication networks, display a surprising degree of robustness: while key components regularly malfunction, local failures rarely lead to the loss of the global information-carrying ability of the network.…