A survey on subgraph counting: concepts, algorithms, and applications to network motifs and graphlets

P Ribeiro, P Paredes, MEP Silva, D Aparicio… - ACM Computing …, 2021 - dl.acm.org
Computing subgraph frequencies is a fundamental task that lies at the core of several
network analysis methodologies, such as network motifs and graphlet-based metrics, which …

A prediction system of Sybil attack in social network using deep-regression model

M Al-Qurishi, M Alrubaian, SMM Rahman… - Future Generation …, 2018 - Elsevier
Sybil attacks have grown prevalent in Twitter and other social networks owing to the
increase in the number of users now found on these very popular platforms. Sybil accounts …

Intervening coupling diffusion of competitive information in online social networks

P Wan, X Wang, X Wang, L Wang… - IEEE Transactions on …, 2019 - ieeexplore.ieee.org
The vigorously rising of social media brings a new opportunity for information diffusion in
online social networks. However, the existing models of information diffusion only consider …

Approximately counting butterflies in large bipartite graph streams

R Li, P Wang, P Jia, X Zhang, J Zhao… - … on Knowledge and …, 2021 - ieeexplore.ieee.org
Bipartite graphs widely exist in real-world scenarios and model binary relations like host-
website, author-paper, and user-product. In bipartite graphs, a butterfly (ie, bi-clique) is the …

Fast Local Subgraph Counting

Q Li, JX Yu - Proceedings of the VLDB Endowment, 2024 - dl.acm.org
We study local subgraph counting queries, Q=(p, o), to count how many times a given k-
node pattern graph p appears around every node υ in a data graph G when the given center …

The role of motifs in understanding behavior in social and engineered networks

D Braines, D Felmlee, D Towsley, K Tu… - Next-Generation …, 2018 - spiedigitallibrary.org
Within networks one can identify motifs that are significant recurring patterns of interaction
between nodes. Here motifs are sub-graphs that occur more frequently than would be …

Mosar: Efficiently Characterizing Both Frequent and Rare Motifs in Large Graphs

W Guo, W Feng, Y Qi, P Wang, J Tao - Applied Sciences, 2022 - mdpi.com
Due to high computational costs, exploring motif statistics (such as motif frequencies) of a
large graph can be challenging. This is useful for understanding complex networks such as …

Network Traffic Statistics Method for Resource‐Constrained Industrial Project Group Scheduling under Big Data

Z Huo, W Zhu, P Pei - Wireless Communications and Mobile …, 2021 - Wiley Online Library
With the advent of the Internet era, the demand for network in various fields is growing, and
network applications are increasingly rich, which brings new challenges to network traffic …

Executing analytics and fusion workloads on transient computing resources in tactical environments

A Ali-Eldin, D Ganesan, H Kwon… - MILCOM 2018-2018 …, 2018 - ieeexplore.ieee.org
Transient computing is an emerging paradigm where the availability of resources is
uncertain, transient and varies over time. Transiency arises in many environments such as …