Vito D. P. Servedio

Preferential attachment in the growth of social networks: The internet encyclopedia Wikipedia

We present an analysis of the statistical properties and growth of the free on-line encyclopedia Wikipedia. By describing topics by vertices and hyperlinks between them as edges, we can represent this encyclopedia as a directed graph. The topological properties of this graph are in close analogy with those of the World Wide Web, despite the very different growth mechanism. In particular, we measure a scale-invariant distribution of the in and out degree and we are able to reproduce these features by means of a simple statistical model. As a major consequence, Wikipedia growth can be described by local rules such as the preferential attachment mechanism, though users, who are responsible of its evolution, can act globally on the network.

Detecting communities in large networks

We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and link orientation. Since the method detects efficiently clustered nodes in large networks even when these are not sharply partitioned, it turns to be specially suitable for the analysis of social and information networks. We test the algorithm on a large-scale data-set from a psychological experiment of word association. In this case, it proves to be successful both in clustering words, and in uncovering mental association patterns.

The scale-free topology of market investments

We propose a network description of large market investments, where both stocks and shareholders are represented as vertices connected by weighted links corresponding to shareholdings. In this framework, the in-degree (kin) and the sum of incoming link weights (v) of an investor correspond to the number of assets held (portfolio diversification) and to the invested wealth (portfolio volume), respectively. An empirical analysis of three different real markets reveals that the distributions of both kin and v display power-law tails with exponents γ and α. Moreover, we find that kin scales as a power-law function of v with an exponent β. Remarkably, despite the values of α, β and γ differ across the three markets, they are always governed by the scaling relation β=(1-α)/(1-γ). We show that these empirical findings can be reproduced by a recent model relating the emergence of scale-free networks to an underlying Paretian distribution of ‘hidden’ vertex properties.

Vertex intrinsic fitness: How to produce arbitrary scale-free networks

We study a recent model of random networks based on the presence of an intrinsic character of the vertices called fitness. The vertex fitnesses are drawn from a given probability distribution density. The edges between pairs of vertices are drawn according to a linking probability function depending on the fitnesses of the two vertices involved. We study here different choices for the probability distribution densities and the linking functions. We find that, irrespective of the particular choices, the generation of scale-free networks is straightforward. We then derive the general conditions under which scale-free behavior appears. This model could then represent a possible explanation for the ubiquity and robustness of such structures.

EMERGENT COMMUNITY STRUCTURE IN SOCIAL TAGGING SYSTEMS

A distributed classification paradigm known as collaborative tagging has been widely adopted in new Web applications designed to manage and share online resources. Users of these applications organize resources (Web pages, digital photographs, academic papers) by associating with them freely chosen text labels, or tags. Here we leverage the social aspects of collaborative tagging and introduce a notion of resource distance based on the collective tagging activity of users. We collect data from a popular system and perform experiments showing that our definition of distance can be used to build a weighted network of resources with a detectable community structure. We show that this community structure clearly exposes the semantic relations among resources. The communities of resources that we observe are a genuinely emergent feature, resulting from the uncoordinated activity of a large number of users, and their detection paves the way for mapping emergent semantics in social tagging systems.

Awareness and Learning in Participatory Noise Sensing

The development of ICT infrastructures has facilitated the emergence of new paradigms for looking at society and the environment over the last few years. Participatory environmental sensing, i.e. directly involving citizens in environmental monitoring, is one example, which is hoped to encourage learning and enhance awareness of environmental issues. In this paper, an analysis of the behaviour of individuals involved in noise sensing is presented. Citizens have been involved in noise measuring activities through the WideNoise smartphone application. This application has been designed to record both objective (noise samples) and subjective (opinions, feelings) data. The application has been open to be used freely by anyone and has been widely employed worldwide. In addition, several test cases have been organised in European countries. Based on the information submitted by users, an analysis of emerging awareness and learning is performed. The data show that changes in the way the environment is perceived after repeated usage of the application do appear. Specifically, users learn how to recognise different noise levels they are exposed to. Additionally, the subjective data collected indicate an increased user involvement in time and a categorisation effect between pleasant and less pleasant environments.

Complex structures and semantics in free word association

We investigate the directed and weighted complex network of free word associations in which players write a word in response to another word given as input. We analyze in details two large datasets resulting from two very different experiments: On the one hand the massive multiplayer web-based Word Association Game known as Human Brain Cloud, and on the other hand the South Florida Free Association Norms experiment. In both cases, the networks of associations exhibit quite robust properties like the small world property, a slight assortativity and a strong asymmetry between in-degree and out-degree distributions. A particularly interesting result concerns the existence of a characteristic scale for the word association process, arguably related to specific conceptual contexts for each word. After mapping, the Human Brain Cloud network onto the WordNet semantics network, we point out the basic cognitive mechanisms underlying word associations when they are represented as paths in an underlying semantic network. We derive in particular an expression describing the growth of the HBC graph and we highlight the existence of a characteristic scale for the word association process.

Structural disorder and anomalous diffusion in random packing of spheres

Nowadays Nuclear Magnetic Resonance diffusion (dNMR) measurements of water molecules in heterogeneous systems have broad applications in material science, biophysics and medicine. Up to now, microstructural rearrangement in media has been experimentally investigated by studying the diffusion coefficient (D(t)) behavior in the tortuosity limit. However, this method is not able to describe structural disorder and transitions in complex systems. Here we show that, according to the continuous time random walk framework, the dNMR measurable parameter α, quantifying the anomalous regime of D(t), provides a quantitative characterization of structural disorder and structural transition in heterogeneous systems. To demonstrate this, we compare α measurements obtained in random packed monodisperse micro-spheres with Molecular Dynamics simulations of disordered porous media and 3D Monte Carlo simulation of particles diffusion in these kind of systems. Experimental results agree well with simulations that correlate the most used parameters and functions characterizing the disorder in porous media.

A Yule-Simon process with memory

The Yule-Simon model has been used as a tool to describe the growth of diverse systems, acquiring a paradigmatic character in many fields of research. Here we study a modified Yule-Simon model that takes into account the full history of the system by means of a hyperbolic memory kernel. We show how the memory kernel changes the properties of preferential attachment and provide an approximate analytical solution for the frequency distribution density as well as for the frequency-rank distribution.

Communities Detection in Large Networks

We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since the method detects efficiently clustered nodes in large networks even when these are not sharply partitioned, it turns to be specially suitable to the analysis of social and information networks. We test the algorithm on a large-scale data-set from a psychological experiment of word association. In this case, it proves to be successful both in clustering words, and in uncovering mental association patterns.