474 research outputs found
The physics of spreading processes in multilayer networks
The study of networks plays a crucial role in investigating the structure,
dynamics, and function of a wide variety of complex systems in myriad
disciplines. Despite the success of traditional network analysis, standard
networks provide a limited representation of complex systems, which often
include different types of relationships (i.e., "multiplexity") among their
constituent components and/or multiple interacting subsystems. Such structural
complexity has a significant effect on both dynamics and function. Throwing
away or aggregating available structural information can generate misleading
results and be a major obstacle towards attempts to understand complex systems.
The recent "multilayer" approach for modeling networked systems explicitly
allows the incorporation of multiplexity and other features of realistic
systems. On one hand, it allows one to couple different structural
relationships by encoding them in a convenient mathematical object. On the
other hand, it also allows one to couple different dynamical processes on top
of such interconnected structures. The resulting framework plays a crucial role
in helping achieve a thorough, accurate understanding of complex systems. The
study of multilayer networks has also revealed new physical phenomena that
remain hidden when using ordinary graphs, the traditional network
representation. Here we survey progress towards attaining a deeper
understanding of spreading processes on multilayer networks, and we highlight
some of the physical phenomena related to spreading processes that emerge from
multilayer structure.Comment: 25 pages, 4 figure
From which world is your graph?
Discovering statistical structure from links is a fundamental problem in the
analysis of social networks. Choosing a misspecified model, or equivalently, an
incorrect inference algorithm will result in an invalid analysis or even
falsely uncover patterns that are in fact artifacts of the model. This work
focuses on unifying two of the most widely used link-formation models: the
stochastic blockmodel (SBM) and the small world (or latent space) model (SWM).
Integrating techniques from kernel learning, spectral graph theory, and
nonlinear dimensionality reduction, we develop the first statistically sound
polynomial-time algorithm to discover latent patterns in sparse graphs for both
models. When the network comes from an SBM, the algorithm outputs a block
structure. When it is from an SWM, the algorithm outputs estimates of each
node's latent position.Comment: To appear in NIPS 201
Testing for high-dimensional geometry in random graphs
We study the problem of detecting the presence of an underlying
high-dimensional geometric structure in a random graph. Under the null
hypothesis, the observed graph is a realization of an Erd\H{o}s-R\'enyi random
graph . Under the alternative, the graph is generated from the
model, where each vertex corresponds to a latent independent random
vector uniformly distributed on the sphere , and two vertices
are connected if the corresponding latent vectors are close enough. In the
dense regime (i.e., is a constant), we propose a near-optimal and
computationally efficient testing procedure based on a new quantity which we
call signed triangles. The proof of the detection lower bound is based on a new
bound on the total variation distance between a Wishart matrix and an
appropriately normalized GOE matrix. In the sparse regime, we make a conjecture
for the optimal detection boundary. We conclude the paper with some preliminary
steps on the problem of estimating the dimension in .Comment: 28 pages; v2 contains minor change
Extraction of Multi-layered Social Networks from Activity Data
The data gathered in all kind of web-based systems, which enable users to
interact with each other, provides an opportunity to extract social networks
that consist of people and relationships between them. The emerging structures
are very complex due to the number and type of discovered connections. In
webbased systems, the characteristic element of each interaction between users
is that there is always an object that serves as a communication medium. This
can be e.g. an email sent from one user to another or post at the forum
authored by one user and commented by others. Based on these objects and
activities that users perform towards them, different kinds of relationships
can be identified and extracted. Additional challenge arises from the fact that
hierarchies can exist between objects, e.g. a forum consists of one or more
groups of topics, and each of them contains topics that finally include posts.
In this paper, we propose a new method for creation of multi-layered social
network based on the data about users activities towards different types of
objects between which the hierarchy exists. Due to the flattening,
preprocessing procedure new layers and new relationships in the multi-layered
social network can be identified and analysed.Comment: 20 pages, 15 figure
Algorithms, applications and systems towards interpretable pattern mining from multi-aspect data
How do humans move around in the urban space and how do they differ when the city undergoes terrorist attacks? How do users behave in Massive Open Online courses~(MOOCs) and how do they differ if some of them achieve certificates while some of them not? What areas in the court elite players, such as Stephen Curry, LeBron James, like to make their shots in the course of the game? How can we uncover the hidden habits that govern our online purchases? Are there unspoken agendas in how different states pass legislation of certain kinds? At the heart of these seemingly unconnected puzzles is this same mystery of multi-aspect mining, i.g., how can we mine and interpret the hidden pattern from a dataset that simultaneously reveals the associations, or changes of the associations, among various aspects of the data (e.g., a shot could be described with three aspects, player, time of the game, and area in the court)? Solving this problem could open gates to a deep understanding of underlying mechanisms for many real-world phenomena. While much of the research in multi-aspect mining contribute broad scope of innovations in the mining part, interpretation of patterns from the perspective of users (or domain experts) is often overlooked. Questions like what do they require for patterns, how good are the patterns, or how to read them, have barely been addressed. Without efficient and effective ways of involving users in the process of multi-aspect mining, the results are likely to lead to something difficult for them to comprehend.
This dissertation proposes the M^3 framework, which consists of multiplex pattern discovery, multifaceted pattern evaluation, and multipurpose pattern presentation, to tackle the challenges of multi-aspect pattern discovery. Based on this framework, we develop algorithms, applications, and analytic systems to enable interpretable pattern discovery from multi-aspect data. Following the concept of meaningful multiplex pattern discovery, we propose PairFac to close the gap between human information needs and naive mining optimization. We demonstrate its effectiveness in the context of impact discovery in the aftermath of urban disasters. We develop iDisc to target the crossing of multiplex pattern discovery with multifaceted pattern evaluation. iDisc meets the specific information need in understanding multi-level, contrastive behavior patterns. As an example, we use iDisc to predict student performance outcomes in Massive Open Online Courses given users' latent behaviors. FacIt is an interactive visual analytic system that sits at the intersection of all three components and enables for interpretable, fine-tunable, and scrutinizable pattern discovery from multi-aspect data. We demonstrate each work's significance and implications in its respective problem context. As a whole, this series of studies is an effort to instantiate the M^3 framework and push the field of multi-aspect mining towards a more human-centric process in real-world applications
Reconstruction of random geometric graphs: breaking the Ω(r) distortion barrier
Embedding graphs in a geographical or latent space, i.e. inferring locations for vertices in Euclidean space or on a smooth manifold or submanifold, is a common task in network analysis, statistical inference, and graph visualization. We consider the classic model of random geometric graphs where n points are scattered uniformly in a square of area n, and two points have an edge between them if and only if their Euclidean distance is less than r. The reconstruction problem then consists of inferring the vertex positions, up to the symmetries of the square, given only the adjacency matrix of the resulting graph. We give an algorithm that, if r = n α for any 0 < α < 1/2, with high probability reconstructs the vertex positions with a maximum error of O(n β ) where β = 1/2−(4/3)α, until α ≥ 3/8 where β = 0 and the error becomes O( √ log n). This improves over earlier results, which were unable to reconstruct with error less than r. Our method estimates Euclidean distances using a hybrid of graph distances and short-range estimates based on the number of common neighbors. We extend our results to the surface of the sphere in R 3 and to hypercubes in any constant fixed dimension.Josep Díaz: partially supported by PID-2020-112581GB-C21 (MOTION).
Cristopher Moore: partially supported by National Science Foundation grant IIS-1838251.Peer ReviewedPostprint (published version
A Tensor Approach to Learning Mixed Membership Community Models
Community detection is the task of detecting hidden communities from observed
interactions. Guaranteed community detection has so far been mostly limited to
models with non-overlapping communities such as the stochastic block model. In
this paper, we remove this restriction, and provide guaranteed community
detection for a family of probabilistic network models with overlapping
communities, termed as the mixed membership Dirichlet model, first introduced
by Airoldi et al. This model allows for nodes to have fractional memberships in
multiple communities and assumes that the community memberships are drawn from
a Dirichlet distribution. Moreover, it contains the stochastic block model as a
special case. We propose a unified approach to learning these models via a
tensor spectral decomposition method. Our estimator is based on low-order
moment tensor of the observed network, consisting of 3-star counts. Our
learning method is fast and is based on simple linear algebraic operations,
e.g. singular value decomposition and tensor power iterations. We provide
guaranteed recovery of community memberships and model parameters and present a
careful finite sample analysis of our learning method. As an important special
case, our results match the best known scaling requirements for the
(homogeneous) stochastic block model
Topical Alignment in Online Social Systems
Understanding the dynamics of social interactions is crucial to comprehend human behavior. The emergence of online social media has enabled access to data regarding people relationships at a large scale. Twitter, specifically, is an information oriented network, with users sharing and consuming information. In this work, we study whether users tend to be in contact with people interested in similar topics, i.e., if they are topically aligned. To do so, we propose an approach based on the use of hashtags to extract information topics from Twitter messages and model users' interests. Our results show that, on average, users are connected with other users similar to them. Furthermore, we show that topical alignment provides interesting information that can eventually allow inferring users' connectivity. Our work, besides providing a way to assess the topical similarity of users, quantifies topical alignment among individuals, contributing to a better understanding of how complex social systems are structured
- …