Related papers: A scale-free network hidden in the collapsing poly…
We propose a model for growing networks based on a finite memory of the nodes. The model shows stylized features of real-world networks: power law distribution of degree, linear preferential attachment of new links and a negative…
We study spatial networks constructed by randomly placing nodes on a manifold and joining two nodes with an edge whenever their distance is less than a certain cutoff. We derive the general expression for the connectivity distribution of…
Barab\'asi-Albert's `Scale Free' model is the starting point for much of the accepted theory of the evolution of real world communication networks. Careful comparison of the theory with a wide range of real world networks, however,…
Loops are subgraphs responsible for the multiplicity of paths going from one to another generic node in a given network. In this paper we present an analytic approach for the evaluation of the average number of loops in random scale-free…
We present results of numerical self-consistent field (SCF) calculations for the equilibrium mechanical unfolding of a globule formed by a single flexible polymer chain collapsed in a poor solvent. In accordance with earlier scaling theory…
We study the growth of random networks under a constraint that the diameter, defined as the average shortest path length between all nodes, remains approximately constant. We show that if the graph maintains the form of its degree…
We analyze the correlation properties of the Erdos-Renyi random graph (RG) and the Barabasi-Albert scale-free network (SF) under the attack and repair strategy with detrended fluctuation analysis (DFA). The maximum degree k_max,…
The onset of synchronization in a system of random frequency oscillators coupled through a random network is investigated. Using a mean-field approximation, we characterize sample-to-sample fluctuations for networks of finite size, and…
We consider a growing network, whose growth algorithm is based on the preferential attachment typical for scale-free constructions, but where the long-range bonds are disadvantaged. Thus, the probability to get connected to a site at…
It is known that the critical probability for the percolation transition is not a sharp threshold, actually it is a region of non-zero width $\Delta p_c$ for systems of finite size. Here we present evidence that for complex networks $\Delta…
The equilibrium partitioning of linear polymer chains into flexible polymer networks is governed by intricate entropic constraints arising from configurational degrees of freedom of both chains and network, yet a quantitative understanding…
We study the interaction problem of a linear polymer chain, floating in fractal containers that belong to the three-dimensional Sierpinski gasket (3D SG) family of fractals, with a surface-adsorbed linear polymer chain. Each member of the…
The structure of flexible polymers endgrafted in cylindrical pores of diameter D is studied as a function of chain length N and grafting density \sigma, assuming good solvent conditions. A phenomenological scaling theory, describing the…
Unlike the well-studied models of growing networks, where the dominant dynamics consist of insertions of new nodes and connections, and rewiring of existing links, we study {\em ad hoc} networks, where one also has to contend with rapid and…
There is increasing evidence that dense networks occur in on-line social networks, recommendation networks and in the brain. In addition to being dense, these networks are often also scale-free, i.e. their degree distributions follow…
We revisit the phase diagram of the frustrated s=1/2 spin ladder with antiferromagnetic rung and diagonal couplings. In particular, we reexamine the evidence for the columnar dimer phase, which has been predicted from analytic treatment of…
Recently, Castellano and Pastor-Satorras [1] utilized the finite size scaling (FSS) theory to analyze simulation data for the contact process (CP) on scale-free networks (SFNs) and claimed that its absorbing critical behavior is not…
We propose a general model of unweighted and undirected networks having the scale-free property and fractal nature. Unlike the existing models of fractal scale-free networks (FSFNs), the present model can systematically and widely change…
The 3D folding of a mammalian gene can be studied by a polymer model, where the chromatin fibre is represented by a semiflexible polymer which interacts with multivalent proteins, representing complexes of DNA-binding transcription factors…
The size of a zero thickness (no excluded volume) polymer ring is shown to scale with chain length $N$ in the same way as the size of the excluded volume (self-avoiding) linear polymer, as $N^{\nu}$, where $\nu \approx 0.588$. The…