Network alignment and motif discovery in dynamic networks

P Cinaglia, M Cannataro - … Modeling Analysis in Health Informatics and …, 2022 - Springer
In the-omics era, bioinformatics technologies allowed the development of several
approaches useful to analyze biological systems. To provide a deep insight into a biological …

Motifs in temporal networks

A Paranjape, AR Benson, J Leskovec - … on web search and data mining, 2017 - dl.acm.org
Networks are a fundamental tool for modeling complex systems in a variety of domains
including social and communication networks as well as biology and neuroscience. The …

Motif discovery algorithms in static and temporal networks: A survey

A Jazayeri, CC Yang - Journal of Complex Networks, 2020 - academic.oup.com
Motifs are the fundamental components of complex systems. The topological structure of
networks representing complex systems and the frequency and distribution of motifs in these …

Persistent community search in temporal networks

RH Li, J Su, L Qin, JX Yu, Q Dai - 2018 IEEE 34th International …, 2018 - ieeexplore.ieee.org
Community search is a fundamental graph mining task. Unfortunately, most previous
community search studies focus mainly on identifying communities in a network without …

Linc: a motif counting algorithm for uncertain graphs

C Ma, R Cheng, LVS Lakshmanan… - Proceedings of the …, 2019 - dl.acm.org
In graph applications (eg, biological and social networks), various analytics tasks (eg,
clustering and community search) are carried out to extract insight from large and complex …

Sampling methods for counting temporal motifs

P Liu, AR Benson, M Charikar - … conference on web search and data …, 2019 - dl.acm.org
Pattern counting in graphs is fundamental to several network sci-ence tasks, and there is an
abundance of scalable methods for estimating counts of small patterns, often called motifs …

Discovering maximal motif cliques in large heterogeneous information networks

J Hu, R Cheng, KCC Chang, A Sankar… - 2019 IEEE 35th …, 2019 - ieeexplore.ieee.org
We study the discovery of cliques (or" complete" subgraphs) in heterogeneous information
networks (HINs). Existing clique-finding solutions often ignore the rich semantics of HINs …

In search of socio-technical congruence: A large-scale longitudinal study

W Mauerer, M Joblin, DA Tamburri… - IEEE Transactions …, 2021 - ieeexplore.ieee.org
We report on a large-scale empirical study investigating the relevance of socio-technical
congruence over key basic software quality metrics, namely, bugs and churn. In particular …

Temporal hypergraph motifs

G Lee, K Shin - Knowledge and Information Systems, 2023 - Springer
Group interactions arise in our daily lives (email communications, on-demand ride sharing,
and comment interactions on online communities, to name a few), and they together form …

Thyme+: Temporal hypergraph motifs and fast algorithms for exact counting

G Lee, K Shin - 2021 IEEE international conference on data …, 2021 - ieeexplore.ieee.org
Group interactions arise in our daily lives (email communications, on-demand ride sharing,
comment interactions on online communities, to name a few), and they together form …