In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …

In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …

Community discovery is one of the most studied problems in network science. In recent
years, many works have focused on discovering communities in temporal networks, thus …

Many algorithms have been proposed in the last 10 years for the discovery of dynamic
communities. However, these methods are seldom compared between themselves. In this …

Generating large synthetic attributed graphs with node labels is an important task to support
various experimental studies for graph analytic methods. Existing graph generators fail to …

We propose acMark, a scalable and general generator for attributed graphs with cluster
labels, which has the following advantages:(i) users can flexibly control the separability of …

We propose a network model that includes some critical events. These critical events
correspond to drastic changes in the structure. Here, the correlation dimension is found to be …

In the last few years, the study of temporal networks has progressed markedly. The evolution
of clusters of nodes (or communities) is one of the major focus of these studies. However, the …

A graph consists of objects, called nodes, that are connected by edges. These connections
may have a certain strength or a direction. Graphs can be used in a lot of contexts where …

Understanding the evolution of communities and the factors that contribute to their
development, stability and disappearance over time is a fundamental problem in the study of …