Social networks have drawn a lot of attention in the past few years, and the analysis of their dynamics represents a pressing scientific challenge. The research efforts in this area strive to understand the driving forces behind the evolution of social networks and their articulations within social dynamics, e.g., opinion dynamics, the epidemic or innovation diffusion, the teams formation and so on ([14, 29, 27, 7, 32, 18, 35, 11, 34]). In other words, it is known that individuals are influenced (e.g. concerning their opinion) through their social network, it is also known that individuals take into account others’ attributes when deciding to evolve their social network, but yet qualitatively not much is known concerning the dynamical patterns that are produced by such an interplay.
Curiously enough, everybody agrees on the stance that social networks are dynamic, e.g. individuals join, participate, attract, compete, cooperate, disappear, and affect the shape and strength of the network and its relationships. Yet, the current instruments (definitions, models, metrics) are mainly drawn for static networks and generally fail to capture the evolution of phenomena and their dynamical properties – temporal dimension – focusing instead on structural  or statistical aspects  of the systems. As stated in , the central problem in this area is the definition of mathematical models able to capture and to reproduce properties observed on the real networks.
The increasing availability of real datasets (e.g. e-mails logs, online forums, or meta-data on scientific publishing), as well as development of smartphones, vehicular networks, and satellite networks have recently fostered research on dynamic networks and caused the appearance of new dedicated concepts. In particular, early works around transportation and delay-tolerant networks (those networks characterized by an absence of instant end-to-end connectivity) have led to the concept of journey  - also called schedule-conforming path , time-respecting path [20, 24], or temporal path [12, 39]. Journeys can be seen as a particular kind of path whose edges do not necessarily follow one another instantly, but instead induces waiting times at intermediate nodes.
A direct consequence of considering journeys instead of paths is that all the concepts usually built on top of paths can in turn take a temporal meaning. This includes the concept of temporal distance  - also called reachability time , information latency , or temporal proximity  -, which accounts for the minimal speed of information propagation between two nodes, and the concept of temporal connectivity  based on the existence of journeys. On the social network side, recent studies focused on measuring the temporal distance between individuals based on e-mail datasets [25, 26] or inter-meeting times . Very recently, temporal betweenness and temporal closeness were also considered in a social network context in . All these temporal indicators complete the set of atemporal indicators usually considered in social network analysis, such as (the usual versions of) distance and diameter, density, clustering coefficient, or modularity, to name a few. It is important to keep in mind that these indicators, whether temporal or atemporal, essentially accounts for network properties at a reasonably short time-scale (fine-grain dynamics). They do not reflect how these properties evolve over longer periods of time (coarse-grain dynamics).
In this paper, we propose a general approach to look at the evolution of both atemporal and temporal indicators. Looking at the evolution of atemporal indicators can be done by representing the evolution of the network as a sequence of static graphs, each of which represents the aggregated interactions over a given time-window. Atemporal indicators can then be normally measured on these graphs and their evolution studied over time. The case of temporal indicators is more complex because the corresponding evaluation cannot be done on static graphs. The proposed solution is therefore to look at the evolution of temporal indicators through a sequence of shorter time-varying graphs, which are temporal subgraphs of the original time-varying graph, covering successive time-windows. We discuss several examples of indicators, both temporal and atemporal, some of which are new. The evolution of some atemporal indicators is accompanied with recent experimental results from , based on online data on scientific networking consisting of dated co-authoring and citation records. We first present the time-varying graph (TVG) formalism from , which we use to express all temporal concepts and evolution properties in a concise and elegant way. We then discuss the two suggested approaches to study the evolution of atemporal and temporal indicators, respectively.
2 Dynamic Networks as Time-Varying Graphs
This section presents the time-varying graph formalism (TVG) recently introduced in . This formalism is semantically equivalent to other graph formalisms, like that of evolving graphs , but suggests in comparison an interaction-centric point of view. This point of view was also present in the time-labelling function of , but only for punctual contacts and latencies. The TVG formalism allows us a concise and elegant formulation of temporal concepts and properties.
2.1 The TVG Formalism
Consider a set of entities (or nodes), a set of relations between these entities (edges), and an alphabet accounting for any property such a relation could have (labels); that is, . The definition of is domain-specific, and therefore left open –a label could represent for instance a particular type of relation in a social network, a type of carrier in a transportation networks, or a communication medium in communication networks. For generality, is assumed to possibly contain multi-valued elements (e.g. satellite link; bandwidth of 4 MHz; encryption available;… ). The set enables multiple relations between a given pair of entities, as long as these relations have different properties, that is, for any , .
The relations between entities are assumed to take place over a time span called the lifetime of the system. The temporal domain is generally assumed to be for discrete-time systems or for continuous-time systems. We denote by time-varying graph the structure , where , called presence function, indicates whether a given edge is present at a given time, and , called latency function, indicates the time it takes to cross a given edge if starting at a given date.
Such a formalism can arguably describe a multitude of different scenarios, including:
Transportation networks - e.g. aviation, where nodes are the cities, directed edges are regular flights, whose departure dates are given by punctual presences, and flight duration by non-nil latencies.
Communication networks - e.g. wireless mobile networks, where an edge is present whenever its two endpoints are within range, the latency corresponding here to the time to propagate a message.
Complex systems, among which social networks - e.g. scientific networks, where the nodes are scientists, and the edges (possibly both directed and undirected) account for example for citations or collaborations.
These examples illustrate the spectrum of models over which the TVG formalism can stretch. As observed, some contexts are intrisically simpler than others and call for restrictions (e.g. directed vs. undirected edges, single vs. multiple edges, punctual vs. lasting relations). Further restrictions may apply. For example the latency function could be decided constant over time, over the edges, over both, or simply ignored. In fact, a vast majority of work in social networks does not require such information (e.g., the propagation time of an email is of little interest to the understanding of a community behavior). Since the scope of this paper is social network analysis, we will deliberately omit the latency function and consider TVGs described as .
2.2 Journeys and related Temporal Concepts
A crucial concept in time-varying graphs is that of journey which is the temporal extension of the notion of path, and forms the basis of most recently introduced temporal concepts. A sequence of couples , such that is a walk in , is a journey in if and only if , and . We denote by , and , the starting date and the last date of a journey , respectively. Journeys can be thought of as paths over time from a source to a destination and therefore have both a topological and a temporal length. The topological length of is the number of couples in (i.e., the number of hops); its temporal length is its end-to-end duration: .
Let us denote by the set of all possible journeys in a time-varying graph , and by those journeys starting at node and ending at node . In a time-varying graph, there are three natural distinct measures of distance, and thus three different types of “minimal” journeys.
The shortest distance from a node to a node at time is simply .
The foremost distance from to at time is .
The fastest distance from to at time is defined as .
A journey with is said to be shortest at time if ; foremost at time if ; and fastest at time if .
Whether in the contexts of social networks or communication networks, a number of higher concepts have been recently defined on top of these. They include new meanings of connectivity and connected components , temporal eccentricity and temporal diameter , or temporal betweenness and temporal closeness , among others. As discussed in the introduction, these concepts allow for novel insights on the way nodes interact at a small time-scale (fine-grained dynamics), but do not reflect the way the network evolves at over longer periods of time (coarse-grain dynamics).
3 Capturing the Evolution
In this section we introduce a framework to study the behavior of network parameters (or indicators) during the lifetime of a time-varying graph. Two types of indicators are described: atemporal and temporal ones. Atemporal parameters are defined on static networks and their evolution over time can be observed by measuring them over sequences of static graphs, where each graph of the sequence corresponds to the aggregation of interactions that occur in a given interval of time (we call them footprints of a TVG). Temporal indicators, on the other hand, are only defined on time-varying graphs, taking into account their temporal nature. The evolution of such indicators requires to consider a sequence of (non-aggregated) time-varying graphs, each of which corresponds to a temporal subgraph of the original one for the considered interval.
3.1 Evolution of Atemporal Indicators
3.1.1 Methodological approach
TVGs as a sequence of footprints.
Given a TVG , one can define the footprint of this graph from to as the static graph such that . In other words, the footprint aggregates interactions over a given time window into static graphs. Let the lifetime of the time-varying graph be partitioned in consecutive sub-intervals ; where each can be noted . We call sequence of footprints of according to the sequence SF. Considering this sequence with a sufficient size of the intervals allows to overcome the strong fluctuations of fine-grain interactions, and focus instead on more general trends of evolution. Note that the same approach could be considered with a sequence of intervals that are overlapping (i.e., a sliding time-window) instead of disjoint ones. Another axis of variation can be considered whether or not the set of nodes in each is also varying, e.g. being restricted to nodes that have at least one adjacent edge in (which is the case in the experimental results shown below).
Looking at atemporal parameters.
Since every graph in is static, any classical network parameter (degree, neighborhood, density, diameter, modularity, etc.) can be directly measured on it. When observing the evolution of a parameter over SF, one can achieve different levels of granularity by varying the size of the footprint intervals. Depending on the parameter and on the application, different choices of granularity are more appropriate to capture a meaningful behavior. At one extreme, each interval could correspond to the smallest time unit (in discrete-time systems), or to the time between any two consecutive modification of the graph. In these cases every footprint corresponds to an instant snapshot of the network, and the whole sequence becomes equivalent to the evolving graph model . At the other side of the spectrum, i.e. taking , the sequence would consist of a single footprint aggregating all interactions over the network lifetime.
3.1.2 Indicators and Discussions
We now discuss the definitions and peculiarities of a set of atemporal parameters, some of which are illustrated upon recent experimentations results (from ) on the hep-th (High Energy Physics Theory) portion of the arXiv website. The dataset consists of a collection of papers and their related citations over the period from January 1992 to May 2003. For each paper the set of authors, the dates of on-line deposit, and the references to other papers are provided. There are 352 807 citations within the total amount of 29 555 papers written by 59 439 authors. From the dataset we extract the network of the most proficient authors - i.e., the authors of papers which received more than 150 citations. In all the example charts, a one-year time window is used.
Evolution of the Density.
One important and widely used indicator aimed at measuring the network structure is the density, which measures how close it is to a complete graph. The density of a graph is defined as:
The evolution of the density could be observed by looking at its trend over the sequence of footprints . The trend of this value reflects the network’s topology formation during time from a global perspective. It could be useful in many cases, such as in the study of transportation networks, e.g. to see how the equipment (number of roads, railways, flights connections…) increases over time. Figure 1 provides another example showing a trend of un-densification observed in the above-mentioned scientific publishing network.
This counter-intuitive trend can be explained by an increasing number of authors. (Recall that these experimentations considered that the set of nodes in the footprint sequence was varying among the s, based on the existence of adjacent edges in the considered footprints.)
Evolution of the Clustering Coefficient.
The clustering coefficient is used in social network analysis to characterize architectural aspects. Several studies (e.g., [19, 40]) suggest that in general nodes tend to create tightly compact groups characterized by a relatively high density of ties. Roughly speaking, the clustering coefficient of a node indicates how close to a clique its neighborhood is. It is formally defined in  as
The average clustering coefficient of a graph can then be defined as the average over all nodes:
As for the density, the evolution of these properties could be observed through measuring it on the footprints of SF. An increasing or decreasing trend of clustering coefficient would typically capture the formation or dismemberment of social communities at a global scale. An example is provided on Figure 2
, still with the same dataset, which shows that the connectivity first tends to be sparse, then after a phase transition around 1999, the nodes start to cluster into denser sub-communities.
Evolution of the Modularity.
Modularity measures how the structure of a given network is modular, i.e., how it can be decomposed into subparts. It also quantifies the quality of a given network division into modules or communities. Networks with high values of modularity are characterized by dense intra-module connections and sparse inter-module connections.
The modularity of a pair of nodes and is defined as
The most common use of modularity is the detection of community structures (e.g. ). Such an indicator, if observed over time, can provide very interesting hints for the analysis of complex dynamic networks, in particular for the evolution of their structures and groups formation. It could also enable to see whether communities tend to specialize and/or homogenize. Figure 3 shows the evolution of the average modularity over the sequence of footprints of our scientific networking example.
In a similar way as for the clustering coefficient, the evolution of modularity exhibits a phase transition around 1999 that separates a monotone trend from a decreasing one. This means that nodes first tends to form separate groups, which at some point start to interconnect with each other into a smaller number of larger groups (formation of communities). Modularity and clustering coefficient are clearly related. It was shown for example in  that networks with the largest possible average clustering coefficient are found to have a modular structure, and at the same time, to have the smallest possible average distance between nodes.
Evolution of the Degree Power Law.
Real world networks are “scale-free”, in the sense that their node degree distributions follow a power-law that is not affected by the size of the network. Such a power law indicates that the fraction of nodes that have degree decreases as , where is a parameter that varies among different types of networks; its value is generally in the interval .
The evolution of the power law over time could reflect for example the arrival or departure of hubs - nodes that interconnect several groups. Figure 4 shows the evolution of the power law exponent over the sequence of footprints of our dataset. As our example deals with the network of most proficient authors, i.e. a subset of the dataset, the values in Fig 4 are slightly different from the traditional reference values. In particular, the graphic shows how closely the degree distribution of a graph follows a power-law scale at each time interval. The higher the values, the more unequal is the distribution of connections within the nodes of the network.
Notice that the curve in Figure 4 provides additional details about the interaction pattern evolution of the network. As the evolution of the clustering coefficient shows an increase of the clustered structure of the network, and the modularity indicates that such an increase is characterized by the connection among separated groups, the decrease of the degree power law shows that the interconnection process is driven by nodes with low degree acting as hubs within groups.
Evolution of the Conductance.
Social networks are intensively studied not only with respect to their structure, but also regarding the interactions occurring on top of them. For instance, several studies focused on information diffusion within groups based on a process of social influence (influential networks ). Such a process was intensively studied under the name of viral marketing (see for instance ) to predict the propagation time of a message over a network. It was recently shown in  that the conductance
- a measure that characterizes the time of convergence of a random walk toward its uniform distribution - plays an important role in “push-pull” based dissemination strategies. The conductance of a graph is defined as the minimum conductance over all the possible cutsin this graph (a cut is a partition of the nodes into two disjoint subsets). The conductance of a cut is defined as
The evolution of conductance might reveal how the links of a network are organizing according to the distance between nodes, and indirectly reflect a process of self-optimization (or deterioration) of the network efficiency.
3.2 Evolution of Temporal Indicators
3.2.1 Methodological approach
Most temporal concepts – including all those mentioned at the end of Section 2.2 – are based on replacing the notion of path by that of journey. As a result, they can be declined into three versions depending on the type of distance considered (i.e., shortest, foremost, fastest). Since journeys are paths over time, the evolution of parameters based on journeys cannot be studied using a sequence of aggregated static graphs. For example, there might be a path between and in all footprints, and yet possibly no journey between them depending on the precise chronology of interaction. To analyze the evolution of such parameters, we need to use a more powerful tool: a sequence of time-varying graphs.
TVGs as a sequence of (shorter) TVGs.
Subgraphs of a time-varying graph can be defined in a classical manner, by restricting the set of vertices or edges of . More interesting is the possibility to define a temporal subgraph by restricting the lifetime of , leading to the graph such that
In the same way as for the sequence of footprints SF, we can now look at the evolution of a TVG through a sequence of shorter TVGs ST, in which the intervals are either disjoint or overlapping.
3.2.2 Indicators and Discussions
Evolution of the (temporal) Distance.
The basic concept of this class of indicators is that of distance. In particular, there are three different types of distances - shortest, fastest, and foremost - that are respectively noted , , and . As discussed in the introduction, these concepts of distance are central in various contexts and were recently subject to several studies. Algorithms to compute optimal journeys according to the three types of distances are available in . (Distributed analogues of these algorithms were recently proposed in  and .) Computing the distance gives an idea of how reachable the nodes are from each other, and thereby constitutes a general bound on dissemination speed.
A concept symmetric to the one of temporal distance is that of temporal view, introduced in  in the context of social network analysis. The temporal view (or simply view) that a node has of another node at time , denoted , is defined as the latest (i.e., largest) at which a message received by time at could have been emitted at ; that is, in the TVG formalism,
This concept could, as that of distance, be declined into three versions (the above one is symmetric to the foremost distance). Studying the evolution of temporal distances or views over a sequence of temporal subgraphs reflects how close in time, or in hops, the nodes tends to become. It serves as a basis to most of the indicators discussed below.
Evolution of the (temporal) Diameter and Eccentricity.
The three journey-based versions of eccentricity and diameter were first discussed in a communication network context . The eccentricity of a node in a TVG can be defined in terms of shortest journeys as
where can be substituted by or to obtain the foremost eccentricity , or the fastest eccentricity , respectively. The eccentricity of a node directly reflects its reachability capacity, and therefore the impact it can have on the network. Such a parameter could have a particular significance in some field of research, e.g. in epidemics, the existence of nodes with a high temporal eccentricity could be associated with the possibility for a virus to survive long-enough to reinfect people. Three versions of the diameter naturally follow based on those of eccentricities: , , and . The foremost version of the temporal diameter was specifically studied in  from a stochastic point of view by Chaintreau et al., but to the best of our knowledge, the evolution
of the temporal diameter or eccentricities have never been considered yet. Looking at them could reveal complex social parameters, e.g., considering the evolution of standard deviations among node eccentricities could reflect how a network tends to createfairness or inequalities among its participants.
Evolution of the (temporal) Centrality.
One of the most important properties of social networks’ structures is the so-called notion of power. As a shared definition of power is still object of debate, the design of metrics able to characterize its causes and consequences is a pressing challenge. In particular the social network approach emphasizes the concept of power as inherently relational, i.e., determined by the network topology. Hence, the focus must be put on the relative positions of nodes. In order to characterize such a property the concept of centrality has emerged. The simplest centrality metric, namely the degree centrality, measures the number of edges that connect a node to other nodes in a network. Over the years many more complex centrality metrics have been proposed and studied, including Katz status score , -centrality , betweenness centrality , and several others based on random walk [30, 37], the most famous of which is the eigenvector centrality used by Google’s PageRank algorithm . The temporal adaptation of these concepts is meaningful, and Kleinberg et al. have shown in  that nodes that are topologically more central are not necessarily central from a temporal point of view, whence the concept of temporal centrality. Studying the evolution of these over time could in turn shed light on how “powerful” nodes tends to emerge in a network. Betweenness and closeness are two well-known measures of centralities.
Temporal betweenness. The betweenness of a node in a static graph measures the occurrences of that node within the shortest paths of other nodes . A temporal version of the betweeness based on foremost journeys was considered in recent work by Tang et al. . The definition can be generally formulated as
where is the number of shortest journeys between and in the time varying graph , and is the number of shortest journeys, among them, that pass through . We can analogously define the temporal betweeness in terms of foremost or fastest distance, by substituting with or .
Temporal closeness. In a static context, the closeness measures the mean of the shortest paths between a node and all the other reachable nodes . It can be formally defined as
and again, possibly declined to a shortest, foremost (), or fastest () versions. As one will certainly notice, this parameter is highly related to that of temporal eccentricity, and yet, both have appeared in very different fields of research. This illustrates again how general both the temporal concepts and the formal tools can be.
-  D. Barmpoutis and R.M Murray. Networks with the smallest average distance and the largest average clustering. Arxiv preprint arXiv.org:1007.4031, 2010.
-  K.A. Berman. Vulnerability of scheduled networks and a generalization of Menger’s theorem. Networks, 28(3):125–134, 1996.
-  S. Bhadra and A. Ferreira. Complexity of connected components in evolving graphs and the computation of multicast trees in dynamic networks. In Proc. Intl. Conf. on Ad Hoc, Mobile and Wireless Networks (AdHoc-Now), 259–270, 2003.
-  V. Blondel, J-L. Guillaume, R. Lambiotte, and E. Lefebvre. Fast unfolding of communities in large networks. Journal of Statistical Mechanics, 2008(1):100–108, 2008.
-  P. Bonacich and P. Lloyd. Eigenvector-like measures of centrality for asymmetric relations. Social Networks, 23(3):191–201, 2001.
-  B. Bui-Xuan, A. Ferreira, and A. Jarry. Computing shortest, fastest, and foremost journeys in dynamic networks. Intl. J. of Foundations of Comp. Science, 14(2):267–285, 2003.
-  C.T Butts and K.M. Carley. Structural change and homeostasis in organizations: A decision-theoretic approach. Journal of Mathematical Sociology, 31(4):295–321, 2007.
-  A. Casteigts, P. Flocchini, B. Mans, and N. Santoro. Deterministic computations in time-varying graphs: Broadcasting under unstructured mobility. In Proc. 5th IFIP Conference on Theoretical Computer Science (TCS), 111–124, 2010.
-  A. Casteigts, P. Flocchini, B. Mans, and N. Santoro. Measuring temporal lags in delay-tolerant networks. In Proc. 25th IEEE Intl. Parallel & Distributed Processing Symposium (IPDPS), 1–10, 2011.
-  A. Casteigts, P. Flocchini, W. Quattrociocchi, and N. Santoro. Time-varying graphs and dynamic networks. Arxiv preprint arXiv:1012.0009, 2010.
-  C. Castellano, S. Fortunato, and V. Loreto. Statistical physics of social dynamics. Arxiv preprint arXiv:0710.3256v1, 2007.
-  A. Chaintreau, A. Mtibaa, A. Massoulie, and A. Diot. The diameter of opportunistic mobile networks. Communications Surveys & Tutorials, 10(3):74–88, 2008.
F. Chierichetti, S. Lattanzi, and A. Panconesi.
Almost tight bounds for rumour spreading with conductance.
Proc. 42nd ACM Symp. on Theory of Computing(STOC) 399–408, 2010.
-  G. Deffuant, D. Neau, F. Amblard, and G. Weisbuch. Mixing beliefs among interacting agents. Advances in Complex Systems, 3:87–98, 2001.
-  P. Domingos and M. Richardson. Mining the network value of customers. In Proc. of 7th ACM Int. Conf. on Knowledge Discovery and Data Mining (KDD) 57–66, 2001.
-  A. Ferreira. Building a reference combinatorial model for MANETs. IEEE Network, 18(5):24–29, 2004.
-  L.C. Freeman. Centrality in social networks: Conceptual clarification. Social Networks, 1:215– 239, 1979.
-  R. Guimera, B. Uzzi, J. Spiro, and L.A. Amaral. Team assembly mechanisms determine collaboration network structure and team performance. Science, 308(5722):697–702, 2005.
-  P.W. Holland and S. Leinhardt. Transitivity in structural models of small groups. Comparative Group Studies, 2:107–124, 1998.
-  P. Holme. Network reachability of real-world contact sequences. Phys. Rev. E, 71(4), 2005.
-  E. Katz and P. Lazarsfeld. Personal Influence: The Part Played by People in the Flow of Mass Communications. Transaction Publishers, October 2005.
-  L. Katz. A new status derived from sociometric analysis. Psychometrika, 18:39–43, 1953.
-  D. Kempe and J. Kleinberg. Protocols and impossibility results for gossip-based communication mechanisms. In Proc. 43rd Symp. on Found. Computer Science (FOCS) 471–480, 2002.
-  D. Kempe, J. Kleinberg, and A. Kumar. Connectivity and inference problems for temporal networks. In Proc. 32nd ACM Symp. on Theory of Computing (STOC) 504–513, 2000.
-  G. Kossinets, J. Kleinberg, and D. Watts. The structure of information pathways in a social communication network. In Proc. 14th ACM Intl. Conf. on Knowledge Discovery and Data Mining (KDD), 435–443, 2008.
-  V. Kostakos. Temporal graphs. Physica A: Statistical Mechanics and its Applications, 388(6):1007–1023, 2009.
-  M. Lelarge. Diffusion of innovations on random networks: Understanding the chasm. In Proc. 4th Int. Workshop on Internet and Network Economics (WINE) 178–185, 2008.
J. Leskovec, D. Chakrabarti, J. M. Kleinberg, C. Faloutsos, and Z. Ghahramani.
Kronecker graphs: An approach to modeling networks.
J. of Machine Learning Res., 11:985–1042, 2010.
-  C. Moore and M.E.J. Newman. Epidemics and percolation in small-world networks. Phys. Rev. E, 61:5678–5682, 2000.
-  J.D. Noh and H. Rieger. Stability of shortest paths in complex networks with random edge weights. Phys. Rev. E, 66:066–127, 2002.
-  L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical Report 1999-66, Stanford InfoLab, November 1999.
-  W.W. Powell, D.R. White, and K.W. Koput. Network dynamics and field evolution: The growth of interorganizational collaboration in the life sciences. American Journal of Sociology, 110(4):1132–1205, 2005.
-  W. Quattrociocchi and F. Amblard. Selection in scientific networks. Arxiv preprint arXiv.org:1012.4396, Dec 2010.
-  W. Quattrociocchi, R. Conte, and E. Lodi. Simulating opinion dynamics in heterogeneous communication systems. In Proc. 7th European Conf. on Complex Systems (ECCS) 70–85, 2010.
-  W. Quattrociocchi, M. Paolucci, and R. Conte. On the effects of informational cheating on social evaluations: image and reputation through gossip. International Journal of Knowledge and Learning, 5(5/6):457–471, 2009.
-  T.A.B. Snijders. The statistical evaluation of social network dynamics. Sociological Methodology, 31(1):361–395, 2001.
-  Z. Stephenson. Rethinking Centrality: Methods and Applications. Social Networks, 11:1–37, 1989.
-  J. Tang, M. Musolesi, C. Mascolo, V. Latora, and V. Nicosia. Analysing information flows and key mediators through temporal centrality metrics. In Proc. 3rd Workshop on Social Network Systems, 1–6, 2010.
-  J. Tang, S. Scellato, M. Musolesi, C. Mascolo, and V. Latora. Small-world behavior in time-varying graphs. Phys. Rev. E, 81(5), 2010.
-  D.J. Watts. Small Worlds: The Dynamics of Networks Between Order and Randomness. Princeton University Press, 1999.