-
Post questions here for one or more of our fundamentals readings:
Fortunato, Santo. 2010. “[Community Detection in Graphs](https://www.sciencedirect.com/science/article/pii/S0370157309002841).” Phy…
-
This page is sorely lacking a README with words in it.
The README should include:
1. A description of the project, and why it's useful. This would be a good place to include links to studies (eg…
-
1. Is it useful to do role detection (e.g. RolX, RoleSim) and niche centrality measures (NetworkX) to discover persons of interest?
2. Would alternate Community Detection (CDLib) algorithms be better…
-
We need to calculate and collect graph measures and indices in the next release. Proposals?
-
We should develop some helper functions for parallelization and then use it in several places.
There are several comments in the code indicating where we could parallelize things:
```
$ grep -r p…
-
**Describe the bug**
`power_centrality()` cannot handle weighted graphs and so returns different values for a weighted graph and for an equivalent graph with parallel edges.
`sna::bonpow()`, on…
-
Post questions here for one or more of our fundamentals readings:
Fortunato, Santo. 2010. “[Community Detection in Graphs.](https://www.sciencedirect.com/science/article/pii/S0370157309002841)” Phy…
-
After #69 ad #89, `dodgr` will be able to calculate centrality more efficiently than `igraph`, and it will be straightforward to adapt existing code to do so.
-
**Clustering**
To visualize the data we should do some clustering or down sampling. We could use some algorithms like K-means or t-sne(which is a machine learning algorithm for dimension reduction). …
-
Ernesto Estrada, the inventor of subgraph centrality, didn't provide a scaling method. However, he proposed the following in private correspondence:
```
G_norm = V * exp(L) / exp(l1) * V'
```
where …