Topology and correlations in structured scale-free networks

We study a recently introduced class of scale-free networks showing a high clustering coefficient and non-trivial connectivity correlations. We find that the connectivity probability distribution strongly depends on the fine details of the model. We solve exactly the case of low average connectivity, providing also exact expressions for the clustering and degree correlation functions. The model also exhibits a lack of small world properties in the whole parameters range. We discuss the physical properties of these networks in the light of the present detailed analysis.Comment: 10 pages, 9 figure

Model of correlated sequential adsorption of colloidal particles

We present results of a new model of sequential adsorption in which the adsorbing particles are correlated with the particles attached to the substrate. The strength of the correlations is measured by a tunable parameter $\sigma$. The model interpolates between free ballistic adsorption in the limit $\sigma\to\infty$ and a strongly correlated phase, appearing for $\sigma\to0$ and characterized by the emergence of highly ordered structures. The phenomenon is manifested through the analysis of several magnitudes, as the jamming limit and the particle-particle correlation function. The effect of correlations in one dimension manifests in the increased tendency to particle chaining in the substrate. In two dimensions the correlations induce a percolation transition, in which a spanning cluster of connected particles appears at a certain critical value $\sigma_c$. Our study could be applicable to more general situations in which the coupling between correlations and disorder is relevant, as for example, in the presence of strong interparticle interactions.Comment: 6 pages, 8 EPS figures. Phys. Rev. E (in press

Behaviors of susceptible-infected epidemics on scale-free networks with identical infectivity

In this article, we proposed a susceptible-infected model with identical infectivity, in which, at every time step, each node can only contact a constant number of neighbors. We implemented this model on scale-free networks, and found that the infected population grows in an exponential form with the time scale proportional to the spreading rate. Further more, by numerical simulation, we demonstrated that the targeted immunization of the present model is much less efficient than that of the standard susceptible-infected model. Finally, we investigated a fast spreading strategy when only local information is available. Different from the extensively studied path finding strategy, the strategy preferring small-degree nodes is more efficient than that preferring large-degree nodes. Our results indicate the existence of an essential relationship between network traffic and network epidemic on scale-free networks.Comment: 5 figures and 7 page

Walks on Apollonian networks

We carry out comparative studies of random walks on deterministic Apollonian networks (DANs) and random Apollonian networks (RANs). We perform computer simulations for the mean first passage time, the average return time, the mean-square displacement, and the network coverage for unrestricted random walk. The diffusions both on DANs and RANs are proved to be sublinear. The search efficiency for walks with various strategies and the influence of the topology of underlying networks on the dynamics of walks are discussed. Contrary to one's intuition, it is shown that the self-avoiding random walk, which has been verified as an optimal strategy for searching on scale-free and small-world networks, is not the best strategy for the DAN in the thermodynamic limit.Comment: 5 pages, 4 figure

Self-similarity, small-world, scale-free scaling, disassortativity, and robustness in hierarchical lattices

In this paper, firstly, we study analytically the topological features of a family of hierarchical lattices (HLs) from the view point of complex networks. We derive some basic properties of HLs controlled by a parameter $q$. Our results show that scale-free networks are not always small-world, and support the conjecture that self-similar scale-free networks are not assortative. Secondly, we define a deterministic family of graphs called small-world hierarchical lattices (SWHLs). Our construction preserves the structure of hierarchical lattices, while the small-world phenomenon arises. Finally, the dynamical processes of intentional attacks and collective synchronization are studied and the comparisons between HLs and Barab{\'asi}-Albert (BA) networks as well as SWHLs are shown. We show that degree distribution of scale-free networks does not suffice to characterize their synchronizability, and that networks with smaller average path length are not always easier to synchronize.Comment: 26 pages, 8 figure

Percolation Critical Exponents in Scale-Free Networks

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 critical exponents are different than the expected mean-field values of regular percolation in infinite dimensions. Networks with 2<a<3 possess only a percolative phase. Nevertheless, we show that in this case percolation critical exponents are well defined, near the limit of extreme dilution (where all sites are removed), and that also then the exponents bear a strong a-dependence. The regular mean-field values are recovered only for a>4.Comment: Latex, 4 page

Scaling in a Nonconservative Earthquake Model of Self-Organised Criticality

We numerically investigate the Olami-Feder-Christensen model for earthquakes in order to characterise its scaling behaviour. We show that ordinary finite size scaling in the model is violated due to global, system wide events. Nevertheless we find that subsystems of linear dimension small compared to the overall system size obey finite (subsystem) size scaling, with universal critical coefficients, for the earthquake events localised within the subsystem. We provide evidence, moreover, that large earthquakes responsible for breaking finite size scaling are initiated predominantly near the boundary.Comment: 6 pages, 6 figures, to be published in Phys. Rev. E; references sorted correctl

Evolution of the social network of scientific collaborations

The co-authorship network of scientists represents a prototype of complex evolving networks. By mapping the electronic database containing all relevant journals in mathematics and neuro-science for an eight-year period (1991-98), we infer the dynamic and the structural mechanisms that govern the evolution and topology of this complex system. First, empirical measurements allow us to uncover the topological measures that characterize the network at a given moment, as well as the time evolution of these quantities. The results indicate that the network is scale-free, and that the network evolution is governed by preferential attachment, affecting both internal and external links. However, in contrast with most model predictions the average degree increases in time, and the node separation decreases. Second, we propose a simple model that captures the network's time evolution. Third, numerical simulations are used to uncover the behavior of quantities that could not be predicted analytically.Comment: 14 pages, 15 figure

Quantum statistics in complex networks

In this work we discuss the symmetric construction of bosonic and fermionic networks and we present a case of a network showing a mixed quantum statistics. This model takes into account the different nature of nodes, described by a random parameter that we call energy, and includes rewiring of the links. The system described by the mixed statistics is an inhomogemeous system formed by two class of nodes. In fact there is a threshold energy $\epsilon_s$ such that nodes with lower energy $(\epsilon<\epsilon_s)$ increase their connectivity while nodes with higher energy $(\epsilon>\epsilon_s)$ decrease their connectivity in time.Comment: 5 pages, 2 figure

The Structure and Function of Frataxin

Frataxin, a highly conserved protein found in prokaryotes and eukaryotes, is required for efficient regulation of cellular iron homeostasis. Humans with a frataxin deficiency have the cardio- and neurodegenerative disorder Friedreich’s ataxia, commonly resulting from a GAA trinucleotide repeat expansion in the frataxin gene. While frataxin’s specific function remains a point of controversy, a general consensus is the protein assists in controlling cellular iron homeostasis by directly binding iron. This review focuses on the structural and biochemical aspects of iron binding by the frataxin orthologs and outlines molecular attributes that may help explain the protein’s role in different cellular pathways