A survey on subgraph counting: concepts, algorithms, and applications to network motifs and graphlets
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 …
network analysis methodologies, such as network motifs and graphlet-based metrics, which …
Improving graph neural network expressivity via subgraph isomorphism counting
While Graph Neural Networks (GNNs) have achieved remarkable results in a variety of
applications, recent studies exposed important shortcomings in their ability to capture the …
applications, recent studies exposed important shortcomings in their ability to capture the …
Higher-order organization of complex networks
Networks are a fundamental tool for understanding and modeling complex systems in
physics, biology, neuroscience, engineering, and social science. Many networks are known …
physics, biology, neuroscience, engineering, and social science. Many networks are known …
Martinize2 and vermouth: Unified framework for topology generation
PC Kroon, F Grünewald, J Barnoud… - arXiv preprint arXiv …, 2022 - arxiv.org
Ongoing advances in force field and computer hardware development enable the use of
molecular dynamics (MD) to simulate increasingly complex systems with the ultimate goal of …
molecular dynamics (MD) to simulate increasingly complex systems with the ultimate goal of …
Buggraph: Differentiating source-binary code similarity with graph triplet-loss network
Binary code similarity detection, which answers whether two pieces of binary code are
similar, has been used in a number of applications, such as vulnerability detection and …
similar, has been used in a number of applications, such as vulnerability detection and …
Political representation and effects of municipal mergers
We study the effects of municipal mergers using novel geocoded data on local public sector
jobs and local politicians' place of residence. We find that the mergers had no effects on …
jobs and local politicians' place of residence. We find that the mergers had no effects on …
Smurf-based anti-money laundering in time-evolving transaction networks
M Starnini, CE Tsourakakis, M Zamanipour… - Machine Learning and …, 2021 - Springer
Money laundering refers to the criminal attempt of concealing the origins of illegally obtained
money, usually by passing it through a complex sequence of seemingly legitimate financial …
money, usually by passing it through a complex sequence of seemingly legitimate financial …
Community detection by motif-aware label propagation
Community detection (or graph clustering) is crucial for unraveling the structural properties
of complex networks. As an important technique in community detection, label propagation …
of complex networks. As an important technique in community detection, label propagation …
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction
Subgraph matching is a fundamental problem in graph analysis. In recent years, many
subgraph matching algorithms have been proposed, making it pressing and challenging to …
subgraph matching algorithms have been proposed, making it pressing and challenging to …
Efficiently counting all orbits of graphlets of any order in a graph using autogenerated equations
I Melckenbeeck, P Audenaert, D Colle… - …, 2018 - academic.oup.com
Motivation Graphlets are a useful tool to determine a graph's small-scale structure. Finding
them is exponentially hard with respect to the number of nodes in each graphlet. Therefore …
them is exponentially hard with respect to the number of nodes in each graphlet. Therefore …