31,523 research outputs found

    Quantification and Comparison of Degree Distributions in Complex Networks

    Full text link
    The degree distribution is an important characteristic of complex networks. In many applications, quantification of degree distribution in the form of a fixed-length feature vector is a necessary step. On the other hand, we often need to compare the degree distribution of two given networks and extract the amount of similarity between the two distributions. In this paper, we propose a novel method for quantification of the degree distributions in complex networks. Based on this quantification method,a new distance function is also proposed for degree distributions, which captures the differences in the overall structure of the two given distributions. The proposed method is able to effectively compare networks even with different scales, and outperforms the state of the art methods considerably, with respect to the accuracy of the distance function

    Temporal interactions facilitate endemicity in the susceptible-infected-susceptible epidemic model

    Get PDF
    Data of physical contacts and face-to-face communications suggest temporally varying networks as the media on which infections take place among humans and animals. Epidemic processes on temporal networks are complicated by complexity of both network structure and temporal dimensions. Theoretical approaches are much needed for identifying key factors that affect dynamics of epidemics. In particular, what factors make some temporal networks stronger media of infection than other temporal networks is under debate. We develop a theory to understand the susceptible-infected-susceptible epidemic model on arbitrary temporal networks, where each contact is used for a finite duration. We show that temporality of networks lessens the epidemic threshold such that infections persist more easily in temporal networks than in their static counterparts. We further show that the Lie commutator bracket of the adjacency matrices at different times is a key determinant of the epidemic threshold in temporal networks. The effect of temporality on the epidemic threshold, which depends on a data set, is approximately predicted by the magnitude of a commutator norm.Comment: 8 figures, 1 tabl

    Evolution of Directed Triangle Motifs in the Google+ OSN

    Get PDF
    Motifs are a fundamental building block and distinguishing feature of networks. While characteristic motif distribution have been found in many networks, very little is known today about the evolution of network motifs. This paper studies the most important motifs in social networks, triangles, and how directed triangle motifs change over time. Our chosen subject is one of the largest Online Social Networks, Google+. Google+ has two distinguishing features that make it particularly interesting: (1) it is a directed network, which yields a rich set of triangle motifs, and (2) it is a young and fast evolving network, whose role in the OSN space is still not fully understood. For the purpose of this study, we crawled the network over a time period of six weeks, collecting several snapshots. We find that some triangle types display significant dynamics, e.g., for some specific initial types, up to 20% of the instances evolve to other types. Due to the fast growth of the OSN in the observed time period, many new triangles emerge. We also observe that many triangles evolve into less-connected motifs (with less edges), suggesting that growth also comes with pruning. We complement the topological study by also considering publicly available user profile data (mostly geographic locations). The corresponding results shed some light on the semantics of the triangle motifs. Indeed, we find that users in more symmetric triangle motifs live closer together, indicating more personal relationships. In contrast, asymmetric links in motifs often point to faraway users with a high in-degree (celebrities)

    Finite Strain Homogenization Using a Reduced Basis and Efficient Sampling

    Full text link
    The computational homogenization of hyperelastic solids in the geometrically nonlinear context has yet to be treated with sufficient efficiency in order to allow for real-world applications in true multiscale settings. This problem is addressed by a problem-specific surrogate model founded on a reduced basis approximation of the deformation gradient on the microscale. The setup phase is based upon a snapshot POD on deformation gradient fluctuations, in contrast to the widespread displacement-based approach. In order to reduce the computational offline costs, the space of relevant macroscopic stretch tensors is sampled efficiently by employing the Hencky strain. Numerical results show speed-up factors in the order of 5-100 and significantly improved robustness while retaining good accuracy. An open-source demonstrator tool with 50 lines of code emphasizes the simplicity and efficiency of the method.Comment: 28 page
    • …
    corecore