8,908 research outputs found
The interplay of microscopic and mesoscopic structure in complex networks
Not all nodes in a network are created equal. Differences and similarities
exist at both individual node and group levels. Disentangling single node from
group properties is crucial for network modeling and structural inference.
Based on unbiased generative probabilistic exponential random graph models and
employing distributive message passing techniques, we present an efficient
algorithm that allows one to separate the contributions of individual nodes and
groups of nodes to the network structure. This leads to improved detection
accuracy of latent class structure in real world data sets compared to models
that focus on group structure alone. Furthermore, the inclusion of hitherto
neglected group specific effects in models used to assess the statistical
significance of small subgraph (motif) distributions in networks may be
sufficient to explain most of the observed statistics. We show the predictive
power of such generative models in forecasting putative gene-disease
associations in the Online Mendelian Inheritance in Man (OMIM) database. The
approach is suitable for both directed and undirected uni-partite as well as
for bipartite networks
On the Stability of Community Detection Algorithms on Longitudinal Citation Data
There are fundamental differences between citation networks and other classes
of graphs. In particular, given that citation networks are directed and
acyclic, methods developed primarily for use with undirected social network
data may face obstacles. This is particularly true for the dynamic development
of community structure in citation networks. Namely, it is neither clear when
it is appropriate to employ existing community detection approaches nor is it
clear how to choose among existing approaches. Using simulated data, we attempt
to clarify the conditions under which one should use existing methods and which
of these algorithms is appropriate in a given context. We hope this paper will
serve as both a useful guidepost and an encouragement to those interested in
the development of more targeted approaches for use with longitudinal citation
data.Comment: 17 pages, 7 figures, presenting at Applications of Social Network
Analysis 2009, ETH Zurich Edit, August 17, 2009: updated abstract, figures,
text clarification
Assortativity and leadership emergence from anti-preferential attachment in heterogeneous networks
Many real-world networks exhibit degree-assortativity, with nodes of similar
degree more likely to link to one another. Particularly in social networks, the
contribution to the total assortativity varies with degree, featuring a
distinctive peak slightly past the average degree. The way traditional models
imprint assortativity on top of pre-defined topologies is via degree-preserving
link permutations, which however destroy the particular graph's hierarchical
traits of clustering. Here, we propose the first generative model which creates
heterogeneous networks with scale-free-like properties and tunable realistic
assortativity. In our approach, two distinct populations of nodes are added to
an initial network seed: one (the followers) that abides by usual preferential
rules, and one (the potential leaders) connecting via anti-preferential
attachments, i.e. selecting lower degree nodes for their initial links. The
latter nodes come to develop a higher average degree, and convert eventually
into the final hubs. Examining the evolution of links in Facebook, we present
empirical validation for the connection between the initial anti-preferential
attachment and long term high degree. Thus, our work sheds new light on the
structure and evolution of social networks
- …