197,184 research outputs found
Quantifying Social Network Dynamics
The dynamic character of most social networks requires to model evolution of
networks in order to enable complex analysis of theirs dynamics. The following
paper focuses on the definition of differences between network snapshots by
means of Graph Differential Tuple. These differences enable to calculate the
diverse distance measures as well as to investigate the speed of changes. Four
separate measures are suggested in the paper with experimental study on real
social network data.Comment: In proceedings of the 4th International Conference on Computational
Aspects of Social Networks, CASoN 201
The Dynamics of Multi-Modal Networks
The widespread study of networks in diverse domains, including social, technological, and scientific settings, has increased the interest in statistical and machine learning techniques for network analysis. Many of these networks are complex, involving more than one kind of entity, and multiple relationship types, both changing over time. While there have been many network analysis methods proposed for problems such as network evolution, community detection, information diffusion and opinion leader identification, the majority of these methods assume a single entity type, a single edge type and often no temporal dynamics. One of the main shortcomings of these traditional techniques is their inadequacy for capturing higher-order dependencies often present in real, complex networks.
To address these shortcomings, I focus on analysis and inference in dynamic, multi-modal, multi-relational networks, containing multiple entity types (such as people, social groups, organizations, locations, etc.), and different relationship types (such as friendship, membership, affiliation, etc.). An example from social network theory is a network describing users, organizations and interest groups, where users have different types of ties among each other, such as friendship, family ties, etc., as well as affiliation and membership links with organizations and interest groups. By considering the complex structure of these networks rather than limiting the analysis to a single entity or relationship type, I show how we can build richer predictive models that provide better understanding of the network dynamics, and thus result in better quality predictions.
In the first part of my dissertation, I address the problems of network evolution and clustering. For network evolution, I describe methods for modeling the interactions between different modalities, and propose a co-evolution model for social and affiliation networks. I then move to the problem of network clustering, where I propose a novel algorithm for clustering multi-modal, multi-relational data. The second part of my dissertation focuses on the temporal dynamics of interactions in complex networks, from both user-level and network-level perspectives. For the user-centric approach, I analyze the dynamics of user relationships with other entity types, proposing a measure of the "loyalty" a user shows for a given group or topic, based on her temporal interaction pattern. I then move to macroscopic-level approaches for analyzing the dynamic processes that occur on a network scale. I propose a new differential adaptive diffusion model for incorporating diversity and trust in the process of information diffusion on multi-modal, multi-relational networks. I also discuss the implications of the proposed diffusion model on designing new strategies for viral marketing and influential detection. I validate all the proposed methods on several real-world networks from multiple domains
NetEvo: A computational framework for the evolution of dynamical complex networks
NetEvo is a computational framework designed to help understand the evolution
of dynamical complex networks. It provides flexible tools for the simulation of
dynamical processes on networks and methods for the evolution of underlying
topological structures. The concept of a supervisor is used to bring together
both these aspects in a coherent way. It is the job of the supervisor to rewire
the network topology and alter model parameters such that a user specified
performance measure is minimised. This performance measure can make use of
current topological information and simulated dynamical output from the system.
Such an abstraction provides a suitable basis in which to study many
outstanding questions related to complex system design and evolution
Classical Setting and Effective Dynamics for Spinfoam Cosmology
We explore how to extract effective dynamics from loop quantum gravity and
spinfoams truncated to a finite fixed graph, with the hope of modeling
symmetry-reduced gravitational systems. We particularize our study to the
2-vertex graph with N links. We describe the canonical data using the recent
formulation of the phase space in terms of spinors, and implement a
symmetry-reduction to the homogeneous and isotropic sector. From the canonical
point of view, we construct a consistent Hamiltonian for the model and discuss
its relation with Friedmann-Robertson-Walker cosmologies. Then, we analyze the
dynamics from the spinfoam approach. We compute exactly the transition
amplitude between initial and final coherent spin networks states with support
on the 2-vertex graph, for the choice of the simplest two-complex (with a
single space-time vertex). The transition amplitude verifies an exact
differential equation that agrees with the Hamiltonian constructed previously.
Thus, in our simple setting we clarify the link between the canonical and the
covariant formalisms.Comment: 38 pages, v2: Link with discretized loop quantum gravity made
explicit and emphasize
Dynamic Exploration of Networks: from general principles to the traceroute process
Dynamical processes taking place on real networks define on them evolving
subnetworks whose topology is not necessarily the same of the underlying one.
We investigate the problem of determining the emerging degree distribution,
focusing on a class of tree-like processes, such as those used to explore the
Internet's topology. A general theory based on mean-field arguments is
proposed, both for single-source and multiple-source cases, and applied to the
specific example of the traceroute exploration of networks. Our results provide
a qualitative improvement in the understanding of dynamical sampling and of the
interplay between dynamics and topology in large networks like the Internet.Comment: 13 pages, 6 figure
Boolean network model predicts cell cycle sequence of fission yeast
A Boolean network model of the cell-cycle regulatory network of fission yeast
(Schizosaccharomyces Pombe) is constructed solely on the basis of the known
biochemical interaction topology. Simulating the model in the computer,
faithfully reproduces the known sequence of regulatory activity patterns along
the cell cycle of the living cell. Contrary to existing differential equation
models, no parameters enter the model except the structure of the regulatory
circuitry. The dynamical properties of the model indicate that the biological
dynamical sequence is robustly implemented in the regulatory network, with the
biological stationary state G1 corresponding to the dominant attractor in state
space, and with the biological regulatory sequence being a strongly attractive
trajectory. Comparing the fission yeast cell-cycle model to a similar model of
the corresponding network in S. cerevisiae, a remarkable difference in
circuitry, as well as dynamics is observed. While the latter operates in a
strongly damped mode, driven by external excitation, the S. pombe network
represents an auto-excited system with external damping.Comment: 10 pages, 3 figure
Detecting the Influence of Spreading in Social Networks with Excitable Sensor Networks
Detecting spreading outbreaks in social networks with sensors is of great
significance in applications. Inspired by the formation mechanism of human's
physical sensations to external stimuli, we propose a new method to detect the
influence of spreading by constructing excitable sensor networks. Exploiting
the amplifying effect of excitable sensor networks, our method can better
detect small-scale spreading processes. At the same time, it can also
distinguish large-scale diffusion instances due to the self-inhibition effect
of excitable elements. Through simulations of diverse spreading dynamics on
typical real-world social networks (facebook, coauthor and email social
networks), we find that the excitable senor networks are capable of detecting
and ranking spreading processes in a much wider range of influence than other
commonly used sensor placement methods, such as random, targeted, acquaintance
and distance strategies. In addition, we validate the efficacy of our method
with diffusion data from a real-world online social system, Twitter. We find
that our method can detect more spreading topics in practice. Our approach
provides a new direction in spreading detection and should be useful for
designing effective detection methods
- …