You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Description: An R interface to the Leiden algorithm, an iterative community detection algorithm on networks. The algorithm is designed to converge to a partition in which all subsets of all communities are locally optimally assigned, yielding communities guaranteed to be connected. The implementation proves to be fast, scales well, and can be run on graphs of millions of nodes (as long as they can fit in memory). The original implementation was constructed as a python interface "leidenalg" found here: <https://github.com/vtraag/leidenalg>. The algorithm was originally described in Traag, V.A., Waltman, L. & van Eck, N.J. "From Louvain to Leiden: guaranteeing well-connected communities". Sci Rep 9, 5233 (2019) <doi:10.1038/s41598-019-41695-z>.
Author: Peter Kharchenko [aut], Viktor Petukhov [aut], V.A. Traag [ctb], Gábor Csárdi [ctb], Tamás Nepusz [ctb], Minh Van Nguyen [ctb], Yichen Wang [aut], Evan Biederstedt [cre, aut]
37
+
Author: Peter Kharchenko [aut], Viktor Petukhov [aut], Yichen Wang [aut], V.A. Traag [ctb], Gábor Csárdi [ctb], Tamás Nepusz [ctb], Minh Van Nguyen [ctb], Evan Biederstedt [cre, aut]
Copy file name to clipboardExpand all lines: README.md
+7-2Lines changed: 7 additions & 2 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -70,19 +70,24 @@ brew install libxml2 glpk gmp
70
70
71
71
## Functions
72
72
73
-
*`leiden.community()`: Detect communities using Leiden algorithm, output as `fakeCommunities` class for downstream use.
73
+
*`find_partition()`: Finds the optimal partition using the Leiden algorithm.
74
+
75
+
*`find_partition_with_rep()`: Finds the optimal partition using the Leiden algorithm with replicate starts
76
+
77
+
*`leiden.community()`: Detects communities using Leiden algorithm, output as `fakeCommunities` class for downstream use.
74
78
75
79
*`rleiden.community()`: Recursive leiden communities, constructs an n-step recursive clustering, using leiden.community.detection. Returns a `fakeCommunities` object that has methods membership(), without dendrogram.
76
80
77
81
*`as.dendrogram()`: Returns pre-calculated dendrogram from `"fakeCommunities"` object
78
82
79
83
*`membership()`: Returns pre-calculated membership factor from `"fakeCommunities"` object
80
84
85
+
81
86
## Citation
82
87
If you find `leidenAlg` useful for your publication, please cite:
83
88
84
89
```
85
90
Peter Kharchenko, Viktor Petukhov, Yichen Wang, and Evan Biederstedt (2023).
86
91
leidenAlg: Implements the Leiden Algorithm via an R Interface. R
87
-
package version 1.1.1. https://github.com/kharchenkolab/leidenAlg
92
+
package version 1.1.2. https://github.com/kharchenkolab/leidenAlg
0 commit comments