Many real-world networks, including social networks and computer networks for example, are temporal networks. This means that the vertices and edges change over time. However, most approaches for modeling and analyzing temporal networks do not explicitly discuss the underlying notion of time. In this paper, we therefore introduce a generalized notion of discrete time for modeling temporal networks. Our approach also allows for considering nondeterministic time and incomplete data, two issues that are often found when analyzing datasets extracted from online social networks, for example. In order to demonstrate the consequences of our generalized notion of time, we also discuss the implications for the computation of (shortest) temporal paths in temporal networks. In addition, we implemented an R-package that provides programming support for all concepts discussed in this paper. The R-package is publicly available for download.

The clustering coefficient is typically used as a measure of the prevalence of node clusters in a network. Various definitions for this measure have been proposed for the cases of networks having weighted edges which may or not be directed. However, these techniques consistently assume that only a subset of all possible edges is present in the network, whereas there are weighted networks of interest in which all possible edges are present, that is, complete weighted networks. For this situation, the concept of clustering is redefined, and computational techniques are presented for computing an associated clustering coefficient for complete weighted undirected or directed networks. The performance of this new definition is compared with that of current clustering definitions when extended to complete weighted networks.

In this paper we explore the potential of the pairwise-type modelling approach to beextended to weighted networks where nodal degree and weights are not independent. As abaseline or null model for weighted networks, we consider undirected, heterogenousnetworks where edge weights are randomly distributed. We show that the pairwise modelsuccessfully captures the extra complexity of the network, but does this at the cost oflimited analytical tractability due the high number of equations. To circumvent thisproblem, we employ the edge-based modelling approach to derive models corresponding to twodifferent cases, namely for degree-dependent and randomly distributed weights. Thesemodels are more amenable to compute important epidemic descriptors, such as early growthrate and final epidemic size, and produce similarly excellent agreement with simulation.Using a branching process approach we compute the basic reproductive ratio for both modelsand discuss the implication of random and correlated weight distributions on this as wellas on the time evolution and final outcome of epidemics. Finally, we illustrate that thetwo seemingly different modelling approaches, pairwise and edge-based, operate on similarassumptions and it is possible to formally link the two.