Pedro G. Lind

Cycles and clustering in bipartite networks

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.

System of mobile agents to model social networks.

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.

Spreading gossip in social networks

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.

Coherence in scale-free networks of chaotic maps

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.

Air quality prediction using optimal neural networks with stochastic variables

We apply recent methods in stochastic data analysis for discovering a set of few stochastic variables that represent the relevant information on a multivariate stochastic system, used as input for artificial neural network models for air quality forecast. We show that using these derived variables as input variables for training the neural networks it is possible to significantly reduce the amount of input variables necessary for the neural network model, without considerably changing the predictive power of the model. The reduced set of variables including these derived variables is therefore proposed as an optimal variable set for training neural network models in forecasting geophysical and weather properties. Finally, we briefly discuss other possible applications of such optimized neural network models.

New approaches to model and study social networks

We describe and develop three recent novelties in network research which are particularly useful for studying social systems. The first one concerns the discovery of some basic dynamical laws that enable the emergence of the fundamental features observed in social networks, namely the nontrivial clustering properties, the existence of positive degree correlations and the subdivision into communities. To reproduce all these features, we describe a simple model of mobile colliding agents, whose collisions define the connections between the agents which are the nodes in the underlying network, and develop some analytical considerations. The second point addresses the particular feature of clustering and its relationship with global network measures, namely with the distribution of the size of cycles in the network. Since in social bipartite networks it is not possible to measure the clustering from standard procedures, we propose an alternative clustering coefficient that can be used to extract an improved normalized cycle distribution in any network. Finally, the third point addresses dynamical processes occurring on networks, namely when studying the propagation of information in them. In particular, we focus on the particular features of gossip propagation which impose some restrictions in the propagation rules. To this end we introduce a quantity, the spread factor, which measures the average maximal fraction of nearest neighbours which get in contact with the gossip, and find the striking result that there is an optimal non-trivial number of friends for which the spread factor is minimized, decreasing the danger of being gossiped about.

Reconstruction of Complex Dynamical Systems Affected by Strong Measurement Noise

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.

Networks based on collisions among mobile agents

We investigate in detail a recent model of colliding mobile agents [Phys. Rev. Lett. 96, 088702], used as an alternative approach to construct evolving networks of interactions formed by the collisions governed by suitable dynamical rules. The system of mobile agents evolves towards a quasi-stationary state which is, apart small fluctuations, well characterized by the de nsity of the system and the residence time of the agents. The residence time defines a collision rate and by varying the collision ra te, the system percolates at a critical value, with the emergence of a giant cluster whose critical exponents are the ones of t wodimensional percolation. Further, the degree and clusteri ng coefficient distributions and the average path length sho w that the network associated with such a system presents non-trivial features which, depending on the collision rule, enables one not only to recover the main properties of standard networks, such as exponential, random and scale-free networks, but also to obtain other topological structures. Namely, we show a specific example where the obtained structure has topological fe atures which characterize accurately the structure and evolution of social networks in different contexts, ranging from networks of acquaintances to networks of sexual contacts.

Model of mobile agents for sexual interactions networks

Abstract.We present a novel model to simulate real social networks of complex interactions, based in a system of colliding particles (agents). The network is build by keeping track of the collisions and evolves in time with correlations which emerge due to the mobility of the agents. Therefore, statistical features are a consequence only of local collisions among its individual agents. Agent dynamics is realized by an event-driven algorithm of collisions where energy is gained as opposed to physical systems which have dissipation. The model reproduces empirical data from networks of sexual interactions, not previously obtained with other approaches.

Deposition of general ellipsoidal particles.

We present a systematic overview of granular deposits composed of ellipsoidal particles with different particle shapes and size polydispersities. We study the density and anisotropy of such deposits as functions of small to moderate size polydispersity and two shape parameters that fully describe the shape of a general ellipsoid. Our results show that, while shape influences significantly the macroscopic properties of the deposits, polydispersity in the studied range plays apparently a secondary role. The density attains a maximum for a particular family of nonsymmetrical ellipsoids, larger than the density observed for prolate or oblate ellipsoids. As for anisotropy measures, the contact forces are increasingly preferred along the vertical direction as the shape of the particles deviates from a sphere. The deposits are constructed by means of a molecular dynamics method, where the contact forces are efficiently and accurately computed. The main results are discussed in the light of applications for porous media models and sedimentation processes.