Dynamics of information diffusion and its applications on complex networks

ZK Zhang, C Liu, XX Zhan, X Lu, CX Zhang, YC Zhang - Physics Reports, 2016 - Elsevier
The ongoing rapid expansion of the Word Wide Web (WWW) greatly increases the
information of effective transmission from heterogeneous individuals to various systems …

Multi-topic misinformation blocking with budget constraint on online social networks

DV Pham, GL Nguyen, TN Nguyen, CV Pham… - IEEE …, 2020 - ieeexplore.ieee.org
Along with the development of Information Technology, Online Social Networks (OSN) are
constantly developing and have become popular media in the world. Besides …

Graph vulnerability and robustness: A survey

S Freitas, D Yang, S Kumar, H Tong… - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
The study of network robustness is a critical tool in the characterization and sense making of
complex interconnected systems such as infrastructure, communication and social networks …

Rise and fall patterns of information diffusion: model and implications

Y Matsubara, Y Sakurai, BA Prakash, L Li… - Proceedings of the 18th …, 2012 - dl.acm.org
The recent explosion in the adoption of search engines and new media such as blogs and
Twitter have facilitated faster propagation of news and rumors. How quickly does a piece of …

Gelling, and melting, large graphs by edge manipulation

H Tong, BA Prakash, T Eliassi-Rad… - Proceedings of the 21st …, 2012 - dl.acm.org
Controlling the dissemination of an entity (eg, meme, virus, etc) on a large graph is an
interesting problem in many disciplines. Examples include epidemiology, computer security …

Spotting culprits in epidemics: How many and which ones?

BA Prakash, J Vreeken… - 2012 IEEE 12th …, 2012 - ieeexplore.ieee.org
Given a snapshot of a large graph, in which an infection has been spreading for some time,
can we identify those nodes from which the infection started to spread? In other words, can …

It's who you know: graph mining using recursive structural features

K Henderson, B Gallagher, L Li, L Akoglu… - Proceedings of the 17th …, 2011 - dl.acm.org
Given a graph, how can we extract good features for the nodes? For example, given two
large graphs from the same domain, how can we use information in one to do classification …

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 …

Tracking a hand manipulating an object

H Hamer, K Schindler, E Koller-Meier… - 2009 IEEE 12th …, 2009 - ieeexplore.ieee.org
We present a method for tracking a hand while it is interacting with an object. This setting is
arguably the one where hand-tracking has most practical relevance, but poses significant …

Ranking outlier nodes in subspaces of attributed graphs

E Müller, PI Sánchez, Y Mülle… - 2013 IEEE 29th …, 2013 - ieeexplore.ieee.org
Outlier analysis is an important data mining task that aims to detect unexpected, rare, and
suspicious objects. Outlier ranking enables enhanced outlier exploration, which assists the …