Related papers: A scale-free network hidden in the collapsing poly…
The study of random graphs has become very popular for real-life network modeling such as social networks or financial networks. Inhomogeneous long-range percolation (or scale-free percolation) on the lattice $\mathbb Z^d$, $d\ge1$, is a…
This paper presents an analytical framework to model fault-tolerance in unstructured peer-to-peer overlays, represented as complex networks. We define a distributed protocol peers execute for managing the overlay and reacting to node…
Polymer's network is treated as an anisotropic fractal with fractional dimensionality D = 1 + \epsilon close to one. Percolation model on such a fractal is studied. Using the real space renormalization group approach of Migdal and Kadanoff…
Multiple scales coexist in complex networks. However, the small world property makes them strongly entangled. This turns the elucidation of length scales and symmetries a defiant challenge. Here, we define a geometric renormalization group…
Network decomposition is a central concept in the study of distributed graph algorithms. We present the first polylogarithmic-round deterministic distributed algorithm with small messages that constructs a strong-diameter network…
A directed polymer is allowed to branch, with configurations determined by global energy optimization and disorder. A finite size scaling analysis in 2D shows that, if disorder makes branching more and more favorable, a critical transition…
We investigate, using numerical simulations and analytical arguments, a simple one dimensional model for the swelling or the collapse of a closed polymer chain of size N, representing the dynamical evolution of a polymer in a \Theta-solvent…
According to recent experimental and numerical investigations if the characteristic size of a specimen is in the submicron size regime several new interesting phenomena emerge during the deformation of the samples. Since in such a systems…
We study theoretically the surface response of a semi-infinite viscoelastic polymer network using the two-fluid model. We focus on the overdamped limit and on the effect of the network's intrinsic length scales. We calculate the decay rate…
The jamming transition of particles with finite-range interactions is characterized by a variety of critical phenomena, including power law distributions of marginal contacts. We numerically study a recently proposed simple model of…
In this paper we describe the emergence of scale-free degree distributions from statistical mechanics principles. We define an energy associated to a degree sequence as the logarithm of the number of indistinguishable simple networks it is…
The one-loop polarization function of graphene has been calculated at zero temperature for arbitrary wavevector, frequency, chemical potential (doping), and band gap. The result is expressed in terms of elementary functions and is used to…
We study the critical behavior of Boolean variables on scale-free networks with competing interactions (Ising spin glasses). Our analytical results for the disorder-network-decay-exponent phase diagram are verified using Monte Carlo…
The statistical property of a growing scale-free network is studied based on an earlier model proposed by Krapivsky, Rodgers, and Redner [Phys. Rev. Lett. 86, 5401 (2001)], with the additional constraints of forbidden of self-connection and…
Synchronization problems in complex networks are very often studied by researchers due to its many applications to various fields such as neurobiology, e-commerce and completion of tasks. In particular, Scale Free networks with degree…
We study asymptotic properties of diffusion and other transport processes (including self-avoiding walks and electrical conduction) on large randomly branched polymers using renormalized dynamical field theory. We focus on the swollen phase…
Evolutionary game theory is employed to study topological conditions of scale-free networks for the evolution of cooperation. We show that Apollonian Networks (ANs) are perfect scale-free networks, on which cooperation can spread to all…
We study the ballistic conductivity of graphene bilayer in the presence of next-nearest neighbor hoppings between the layers. An undoped and unbiased system was found in Ref. [1] to show a nonuniversal (length-dependent) conductivity…
In this paper we study the impact of degree correlations in the subgraphs statistics of scale-free networks. In particular we consider loops: a simple case of network subgraphs which encode the redundancy of the paths passing through every…
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…