8 research outputs found
Towards Scalable Network Delay Minimization
Reduction of end-to-end network delays is an optimization task with
applications in multiple domains. Low delays enable improved information flow
in social networks, quick spread of ideas in collaboration networks, low travel
times for vehicles on road networks and increased rate of packets in the case
of communication networks. Delay reduction can be achieved by both improving
the propagation capabilities of individual nodes and adding additional edges in
the network. One of the main challenges in such design problems is that the
effects of local changes are not independent, and as a consequence, there is a
combinatorial search-space of possible improvements. Thus, minimizing the
cumulative propagation delay requires novel scalable and data-driven
approaches.
In this paper, we consider the problem of network delay minimization via node
upgrades. Although the problem is NP-hard, we show that probabilistic
approximation for a restricted version can be obtained. We design scalable and
high-quality techniques for the general setting based on sampling and targeted
to different models of delay distribution. Our methods scale almost linearly
with the graph size and consistently outperform competitors in quality
RePBubLik: Reducing the Polarized Bubble Radius with Link Insertions
The topology of the hyperlink graph among pages expressing different opinions
may influence the exposure of readers to diverse content. Structural bias may
trap a reader in a polarized bubble with no access to other opinions. We model
readers' behavior as random walks. A node is in a polarized bubble if the
expected length of a random walk from it to a page of different opinion is
large. The structural bias of a graph is the sum of the radii of
highly-polarized bubbles. We study the problem of decreasing the structural
bias through edge insertions. Healing all nodes with high polarized bubble
radius is hard to approximate within a logarithmic factor, so we focus on
finding the best edges to insert to maximally reduce the structural bias.
We present RePBubLik, an algorithm that leverages a variant of the random walk
closeness centrality to select the edges to insert. RePBubLik obtains, under
mild conditions, a constant-factor approximation. It reduces the structural
bias faster than existing edge-recommendation methods, including some designed
to reduce the polarization of a graph
Reviving dormant ties in an online social network experiment
Social network users connect and interact with one another to fulfil different kinds of social and information needs. When interaction ceases between two users, we say that their tie becomes dormant. While there are different underlying rea-sons of dormant ties, it is important to find means to revive such ties so as to maintain vibrancy in the relationships. In this work, we thus focus on designing an online experiment to evaluate the effectiveness of personalized social messages to revive dormant ties. The experiment carefully selects users with dormant ties so that each user does not get mixed treat-ments and be affected by the responses of other users un-dergoing treatment. Our results show that personalized mes-sage content plays an important part in reviving dormant ties. Specifically, we find the message containing friend’s recent activity information is more effective than that containing inter-friend activity information. We observe that the quality of engagement of at least 50 % of the revived ties can effec-tively be restored to the level before the ties become dormant. We also observe that it is easier to revive dormant ties that involve users from the same country but not users with the same and different gender
Recommended from our members
Analysis, Modeling, and Control of Dynamic Processes in Networks
Dynamic network processes have surrounded people for millennia. Information spread through social networks, alliance formation in financial and organizational networks, heat diffusion through material networks, and distributed synchronization in robotic networks are just a few examples. Network processes are studies along three dimensions: analysis of network processes through the data produced by them; designing complex plausible, yet, tractable mathematical models for network processes; and designing control mechanisms that would guide network processes towards desirable evolution patterns. This thesis advances the frontier of knowledge about network processes along each of these three dimensions, emphasizing applications to social networks.The first part of the thesis is dedicated to the design of a method for model-driven analysis of a polar opinion formation process in social networks. The core of the method is a distance measure quantifying the likelihood of a social network's transitioning between different states with respect to a chosen opinion dynamics model characterizing expected evolution of the network's state. I describe how to design such a distance measure relying upon the classical transportation problem, compute it in linear time, and use it in applications.In the second part of the thesis, I focus on designing a model for polar opinion formation in social networks, and define a class of non-linear models that capture the dependence of the users' opinion formation behavior upon the opinions themselves. The obtained models are connected to socio-psychological theories, and their behavior is theoretically analyzed employing tools from non-smooth analysis and a generalization of LaSalle Invariance Principle.The third part of the thesis targets the problem of defense against social control. While the existing socio-psychological theories as well as influence maximization techniques expose the opinion formation process in social networks to external attacks, I propose an algorithm that nullifies the effect of such attacks by strategically recommending a small number of new edges to the network's users. The optimization problem underlying the algorithm is NP-hard, and I provide a pseudo-linear time heuristic---drawing upon the theory of Markov chains---that solves the problem approximately and performs well in experiments