We investigate the clustering coefficient in bipartite networks where cycles of size three are absent and therefore the standard definition of clustering coefficient cannot be used. Instead, we use another coefficient given by the fraction of cycles with size four, showing that both coefficients yield the same clustering properties. The new coefficient is computed for two networks of sexual contacts, one bipartite and another where no distinction between the nodes is made (monopartite). In both cases the clustering coefficient is similar. Furthermore, combining both clustering coefficients we deduce an expression for estimating cycles of larger size, which improves previous estimations and is suitable for either monopartite and multipartite networks, and discuss the applicability of such analytical estimations.

We study a simple model of information propagation in social networks, where two quantities are introduced: the spread factor, which measures the average maximal reachability of the neighbors of a given node that interchange information among each other, and the spreading time needed for the information to reach such a fraction of nodes. When the information refers to a particular node at which both quantities are measured, the model can be taken as a model for gossip propagation. In this context, we apply the model to real empirical networks of social acquaintances and compare the underlying spreading dynamics with different types of scale-free and small-world networks. We find that the number of friendship connections strongly influences the probability of being gossiped. Finally, we discuss how the spread factor is able to be applied to other situations.

We propose a model of mobile agents to construct social networks, based on a system of moving particles by keeping track of the collisions during their permanence in the system. We reproduce not only the degree distribution, clustering coefficient, and shortest path length of a large database of empirical friendship networks recently collected, but also some features related with their community structure. The model is completely characterized by the collision rate, and above a critical collision rate we find the emergence of a giant cluster in the universality class of two-dimensional percolation. Moreover, we propose possible schemes to reproduce other networks of particular social contacts, namely, sexual contacts.

This Letter reports on a new approach to properly analyze time series of dynamical systems which are spoilt by the simultaneous presence of dynamical noise and measurement noise. It is shown that even strong external measurement noise as well as dynamical noise which is an intrinsic part of the dynamical process can be quantified correctly, solely on the basis of measured time series and proper data analysis. Finally, real world data sets are presented pointing out the relevance of the new approach.

We study fully synchronized states in scale-free networks of chaotic logistic maps as a function of both dynamical and topological parameters. Three different network topologies are considered: (i) a random scale-free topology, (ii) a deterministic pseudofractal scale-free network, and (iii) an Apollonian network. For the random scale-free topology we find a coupling strength threshold beyond which full synchronization is attained. This threshold scales as $k^{-\mu }$, where $k$ is the outgoing connectivity and $\mu$ depends on the local nonlinearity. For deterministic scale-free networks coherence is observed only when the coupling strength is proportional to the neighbor connectivity. We show that the transition to coherence is of first order and study the role of the most connected nodes in the collective dynamics of oscillators in scale-free networks.