A survey of social network analysis techniques and their applications to socially aware networking

S Tsugawa - IEICE transactions on communications, 2019 - search.ieice.org
Socially aware networking is an emerging research field that aims to improve the current
networking technologies and realize novel network services by applying social network …

Effective and efficient truss computation over large heterogeneous information networks

Y Yang, Y Fang, X Lin, W Zhang - 2020 IEEE 36th international …, 2020 - ieeexplore.ieee.org
Recently, the topic of truss computation has gained plenty of attention, where the k-truss of a
graph is the maximum subgraph in which each edge participates in at least (k-2) triangles …

Efficiently reinforcing social networks over user engagement and tie strength

F Zhang, Y Zhang, L Qin, W Zhang… - 2018 IEEE 34th …, 2018 - ieeexplore.ieee.org
User engagement and tie strength are fundamental and important components in social
networks. The model of k-truss not only captures actively engaged users, but also ensures …

Fast algorithm for k-truss discovery on public-private graphs

S Ebadian, X Huang - arxiv preprint arxiv:1906.00140, 2019 - arxiv.org
In public-private graphs, users share one public graph and have their own private graphs. A
private graph consists of personal private contacts that only can be visible to its owner, eg …

Index-based structural clustering on directed graphs

L Meng, L Yuan, Z Chen, X Lin… - 2022 IEEE 38th …, 2022 - ieeexplore.ieee.org
Structural clustering (SCAN) is one of the most popular graph clustering paradigms.
However, SCAN assumes that the input graph is undirected and can not cluster the directed …

Modelling a multiplex brain network by local transfer entropy

F Parente, A Colosimo - Scientific Reports, 2021 - nature.com
This paper deals with the information transfer mechanisms underlying causal relations
between brain regions under resting condition. fMRI images of a large set of healthy …

Maximal D-truss search in dynamic directed graphs

A Tian, A Zhou, Y Wang, L Chen - Proceedings of the VLDB Endowment, 2023 - dl.acm.org
Community search (CS) aims at personalized subgraph discovery which is the key to
understanding the organisation of many real-world networks. CS in undirected networks has …

Efficient probabilistic truss indexing on uncertain graphs

Z Sun, X Huang, J Xu, F Bonchi - Proceedings of the Web Conference …, 2021 - dl.acm.org
Networks in many real-world applications come with an inherent uncertainty in their
structure, due to eg, noisy measurements, inference and prediction models, or for privacy …

Motif-driven dense subgraph discovery in directed and labeled networks

AE Sarıyüce - Proceedings of the Web Conference 2021, 2021 - dl.acm.org
Dense regions in networks are an indicator of interesting and unusual information. However,
most existing methods only consider simple, undirected, unweighted networks. Complex …

Truss-based structural diversity search in large graphs

J Huang, X Huang, J Xu - IEEE Transactions on Knowledge …, 2020 - ieeexplore.ieee.org
Social decisions made by individuals are easily influenced by information from their social
neighborhoods. A key predictor of social contagion is the multiplicity of social contexts inside …