273 citations · 716 across the 8 of their papers we have counts for
9 papers
Niimpy: a toolbox for behavioral data analysis
A. Ikäheimonen, A. M. Triana, N. Luong +4
Behavioral studies using personal digital devices typically produce rich longitudinal datasets of mixed data types. These data provide information about the behavior of users of th…
Detection of timescales in evolving complex systems
Richard K. Darst, Clara Granell, Alex Arenas +3
Most complex systems are intrinsically dynamic in nature. The evolution of a dynamic complex system is typically represented as a sequence of snapshots, where each snapshot describ…
Benchmark model to assess community structure in evolving networks
Clara Granell, Richard K. Darst, Alex Arenas +2
Detecting the time evolution of the community structure of networks is crucial to identify major changes in the internal organization of many complex systems, which may undergo imp…
Triadic closure as a basic generating mechanism of communities in complex networks
Ginestra Bianconi, Richard K. Darst, Jacopo Iacovacci +1
Most of the complex social, technological and biological networks have a significant community structure. Therefore the community structure of complex networks has to be considered…
Community detection in networks: Structural communities versus ground truth
Darko Hric, Richard K. Darst, Santo Fortunato
Algorithms to find communities in networks rely just on structural information and search for cohesive subsets of nodes. On the other hand, most scholars implicitly or explicitly a…
Improving the performance of algorithms to find communities in networks
Richard K. Darst, Zohar Nussinov, Santo Fortunato
Many algorithms to detect communities in networks typically work without any information on the cluster structure to be found, as one has no a priori knowledge of it, in general. N…
Algorithm independent bounds on community detection problems and associated transitions in stochastic block model graphs
Richard K. Darst, David R. Reichman, Peter Ronhovde +1
We derive rigorous bounds for well-defined community structure in complex networks for a stochastic block model (SBM) benchmark. In particular, we analyze the effect of inter-commu…
An edge density definition of overlapping and weighted graph communities
Richard K. Darst David R. Reichman Peter Ronhovde, Zohar Nussinov
Community detection in networks refers to the process of seeking strongly internally connected groups of nodes which are weakly externally connected. In this work, we introduce and…
Dynamical Heterogeneity in Lattice Glass Models
Richard K. Darst, David R. Reichman, Giulio Biroli
In this paper we consider in detail the properties of dynamical heterogeneity in lattice glass models (LGMs). LGMs are lattice models whose dynamical rules are based on thermodynam…