474 research outputs found
Information Horizons in Networks
We investigate and quantify the interplay between topology and ability to
send specific signals in complex networks. We find that in a majority of
investigated real-world networks the ability to communicate is favored by the
network topology on small distances, but disfavored at larger distances. We
further discuss how the ability to locate specific nodes can be improved if
information associated to the overall traffic in the network is available.Comment: Submitted top PR
The diplomat's dilemma: Maximal power for minimal effort in social networks
Closeness is a global measure of centrality in networks, and a proxy for how
influential actors are in social networks. In most network models, and many
empirical networks, closeness is strongly correlated with degree. However, in
social networks there is a cost of maintaining social ties. This leads to a
situation (that can occur in the professional social networks of executives,
lobbyists, diplomats and so on) where agents have the conflicting objectives of
aiming for centrality while simultaneously keeping the degree low. We
investigate this situation in an adaptive network-evolution model where agents
optimize their positions in the network following individual strategies, and
using only local information. The strategies are also optimized, based on the
success of the agent and its neighbors. We measure and describe the time
evolution of the network and the agents' strategies.Comment: Submitted to Adaptive Networks: Theory, Models and Applications, to
be published from Springe
A customisable pipeline for continuously harvesting socially-minded Twitter users
On social media platforms and Twitter in particular, specific classes of
users such as influencers have been given satisfactory operational definitions
in terms of network and content metrics.
Others, for instance online activists, are not less important but their
characterisation still requires experimenting.
We make the hypothesis that such interesting users can be found within
temporally and spatially localised contexts, i.e., small but topical fragments
of the network containing interactions about social events or campaigns with a
significant footprint on Twitter.
To explore this hypothesis, we have designed a continuous user profile
discovery pipeline that produces an ever-growing dataset of user profiles by
harvesting and analysing contexts from the Twitter stream.
The profiles dataset includes key network and content-based users metrics,
enabling experimentation with user-defined score functions that characterise
specific classes of online users.
The paper describes the design and implementation of the pipeline and its
empirical evaluation on a case study consisting of healthcare-related campaigns
in the UK, showing how it supports the operational definitions of online
activism, by comparing three experimental ranking functions. The code is
publicly available.Comment: Procs. ICWE 2019, June 2019, Kore
Distributed Graph Clustering using Modularity and Map Equation
We study large-scale, distributed graph clustering. Given an undirected
graph, our objective is to partition the nodes into disjoint sets called
clusters. A cluster should contain many internal edges while being sparsely
connected to other clusters. In the context of a social network, a cluster
could be a group of friends. Modularity and map equation are established
formalizations of this internally-dense-externally-sparse principle. We present
two versions of a simple distributed algorithm to optimize both measures. They
are based on Thrill, a distributed big data processing framework that
implements an extended MapReduce model. The algorithms for the two measures,
DSLM-Mod and DSLM-Map, differ only slightly. Adapting them for similar quality
measures is straight-forward. We conduct an extensive experimental study on
real-world graphs and on synthetic benchmark graphs with up to 68 billion
edges. Our algorithms are fast while detecting clusterings similar to those
detected by other sequential, parallel and distributed clustering algorithms.
Compared to the distributed GossipMap algorithm, DSLM-Map needs less memory, is
up to an order of magnitude faster and achieves better quality.Comment: 14 pages, 3 figures; v3: Camera ready for Euro-Par 2018, more
details, more results; v2: extended experiments to include comparison with
competing algorithms, shortened for submission to Euro-Par 201
The evolution of interdisciplinarity in physics research
Science, being a social enterprise, is subject to fragmentation into groups
that focus on specialized areas or topics. Often new advances occur through
cross-fertilization of ideas between sub-fields that otherwise have little
overlap as they study dissimilar phenomena using different techniques. Thus to
explore the nature and dynamics of scientific progress one needs to consider
the large-scale organization and interactions between different subject areas.
Here, we study the relationships between the sub-fields of Physics using the
Physics and Astronomy Classification Scheme (PACS) codes employed for
self-categorization of articles published over the past 25 years (1985-2009).
We observe a clear trend towards increasing interactions between the different
sub-fields. The network of sub-fields also exhibits core-periphery
organization, the nucleus being dominated by Condensed Matter and General
Physics. However, over time Interdisciplinary Physics is steadily increasing
its share in the network core, reflecting a shift in the overall trend of
Physics research.Comment: Published version, 10 pages, 8 figures + Supplementary Informatio
Community Structure Characterization
This entry discusses the problem of describing some communities identified in
a complex network of interest, in a way allowing to interpret them. We suppose
the community structure has already been detected through one of the many
methods proposed in the literature. The question is then to know how to extract
valuable information from this first result, in order to allow human
interpretation. This requires subsequent processing, which we describe in the
rest of this entry
Obtaining Communities with a Fitness Growth Process
The study of community structure has been a hot topic of research over the
last years. But, while successfully applied in several areas, the concept lacks
of a general and precise notion. Facts like the hierarchical structure and
heterogeneity of complex networks make it difficult to unify the idea of
community and its evaluation. The global functional known as modularity is
probably the most used technique in this area. Nevertheless, its limits have
been deeply studied. Local techniques as the ones by Lancichinetti et al. and
Palla et al. arose as an answer to the resolution limit and degeneracies that
modularity has.
Here we start from the algorithm by Lancichinetti et al. and propose a unique
growth process for a fitness function that, while being local, finds a
community partition that covers the whole network, updating the scale parameter
dynamically. We test the quality of our results by using a set of benchmarks of
heterogeneous graphs. We discuss alternative measures for evaluating the
community structure and, in the light of them, infer possible explanations for
the better performance of local methods compared to global ones in these cases
From Relational Data to Graphs: Inferring Significant Links using Generalized Hypergeometric Ensembles
The inference of network topologies from relational data is an important
problem in data analysis. Exemplary applications include the reconstruction of
social ties from data on human interactions, the inference of gene
co-expression networks from DNA microarray data, or the learning of semantic
relationships based on co-occurrences of words in documents. Solving these
problems requires techniques to infer significant links in noisy relational
data. In this short paper, we propose a new statistical modeling framework to
address this challenge. It builds on generalized hypergeometric ensembles, a
class of generative stochastic models that give rise to analytically tractable
probability spaces of directed, multi-edge graphs. We show how this framework
can be used to assess the significance of links in noisy relational data. We
illustrate our method in two data sets capturing spatio-temporal proximity
relations between actors in a social system. The results show that our
analytical framework provides a new approach to infer significant links from
relational data, with interesting perspectives for the mining of data on social
systems.Comment: 10 pages, 8 figures, accepted at SocInfo201
Router-level community structure of the Internet Autonomous Systems
The Internet is composed of routing devices connected between them and
organized into independent administrative entities: the Autonomous Systems. The
existence of different types of Autonomous Systems (like large connectivity
providers, Internet Service Providers or universities) together with
geographical and economical constraints, turns the Internet into a complex
modular and hierarchical network. This organization is reflected in many
properties of the Internet topology, like its high degree of clustering and its
robustness.
In this work, we study the modular structure of the Internet router-level
graph in order to assess to what extent the Autonomous Systems satisfy some of
the known notions of community structure. We show that the modular structure of
the Internet is much richer than what can be captured by the current community
detection methods, which are severely affected by resolution limits and by the
heterogeneity of the Autonomous Systems. Here we overcome this issue by using a
multiresolution detection algorithm combined with a small sample of nodes. We
also discuss recent work on community structure in the light of our results
- …