Slashburn: Graph compression and mining beyond caveman communities

Y Lim, U Kang, C Faloutsos - IEEE Transactions on Knowledge …, 2014 - ieeexplore.ieee.org
Given a real world graph, how should we lay-out its edges? How can we compress it? These
questions are closely related, and the typical approach so far is to find clique-like …

Epidemic processes over time-varying networks

PE Paré, CL Beck, A Nedić - IEEE Transactions on Control of …, 2017 - ieeexplore.ieee.org
The spread of viruses in biological networks, computer networks, and human contact
networks can have devastating effects; developing and analyzing mathematical models of …

On budgeted influence maximization in social networks

H Nguyen, R Zheng - IEEE Journal on Selected Areas in …, 2013 - ieeexplore.ieee.org
Given a fixed budget and an arbitrary cost for selecting each node, the budgeted influence
maximization (BIM) problem concerns selecting a set of seed nodes to disseminate some …

Epidemic spreading in modular time-varying networks

M Nadini, K Sun, E Ubaldi, M Starnini, A Rizzo… - Scientific reports, 2018 - nature.com
We investigate the effects of modular and temporal connectivity patterns on epidemic
spreading. To this end, we introduce and analytically characterise a model of time-varying …

Multi-competitive viruses over time-varying networks with mutations and human awareness

PE Paré, J Liu, CL Beck, A Nedić, T Başar - Automatica, 2021 - Elsevier
In this paper, we introduce a model for multiple competing viruses over networks, derived
using each state variable of the model as the infection percentage of a group or a …

Beyond'caveman communities': Hubs and spokes for graph compression and mining

U Kang, C Faloutsos - 2011 IEEE 11th international conference …, 2011 - ieeexplore.ieee.org
Given a real world graph, how should we lay-out its edges? How can we compress it? These
questions are closely related, and the typical approach so far is to find clique-like …

Interacting viruses in networks: can both survive?

A Beutel, BA Prakash, R Rosenfeld… - Proceedings of the 18th …, 2012 - dl.acm.org
Suppose we have two competing ideas/products/viruses, that propagate over a social or
other network. Suppose that they are strong/virulent enough, so that each, if left alone, could …

Epidemic threshold in continuous-time evolving networks

E Valdano, MR Fiorentin, C Poletto, V Colizza - Physical review letters, 2018 - APS
Current understanding of the critical outbreak condition on temporal networks relies on
approximations (time scale separation, discretization) that may bias the results. We propose …

Contact-based model for epidemic spreading on temporal networks

A Koher, HHK Lentz, JP Gleeson, P Hövel - Physical Review X, 2019 - APS
We present a contact-based model to study the spreading of epidemics by means of
extending the dynamic message-passing approach to temporal networks. The shift in …

Minimum budget for misinformation blocking in online social networks

CV Pham, QV Phu, HX Hoang, J Pei… - Journal of Combinatorial …, 2019 - Springer
Preventing misinformation spreading has recently become a critical topic due to an
explosive growth of online social networks. Instead of focusing on blocking misinformation …