974 research outputs found
Evolutionary Centrality and Maximal Cliques in Mobile Social Networks
This paper introduces an evolutionary approach to enhance the process of
finding central nodes in mobile networks. This can provide essential
information and important applications in mobile and social networks. This
evolutionary approach considers the dynamics of the network and takes into
consideration the central nodes from previous time slots. We also study the
applicability of maximal cliques algorithms in mobile social networks and how
it can be used to find the central nodes based on the discovered maximal
cliques. The experimental results are promising and show a significant
enhancement in finding the central nodes
Temporal interactions facilitate endemicity in the susceptible-infected-susceptible epidemic model
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
Probabilistic Approach to Structural Change Prediction in Evolving Social Networks
We propose a predictive model of structural
changes in elementary subgraphs of social network based on
Mixture of Markov Chains. The model is trained and verified
on a dataset from a large corporate social network analyzed
in short, one day-long time windows, and reveals distinctive
patterns of evolution of connections on the level of local
network topology. We argue that the network investigated in
such short timescales is highly dynamic and therefore immune
to classic methods of link prediction and structural analysis,
and show that in the case of complex networks, the dynamic
subgraph mining may lead to better prediction accuracy. The
experiments were carried out on the logs from the Wroclaw
University of Technology mail server
- …