Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with social-network-analysis
Search options not deleted
user 109496
Social network data consists of a collection of "nodes" (which can be any sort of entity - e.g. people, corporations) and "links" (which can be any sort of relationship - e.g. friend, sharing a board member).
2
votes
Reduce size of a network graph for bipartite projection
I think the problem is not with the data size, but with the presence of large degree nodes (the degree of a node is its number of neighbours).
Indeed all neighbours of a node in the bipartite graph ar …
- 131
0
votes
Scalable way to calculate betweenness centrality for a graph in spark
Sorry, I do not think you can compute the exact betweenness centrality of nodes in a graph this size, as its complexity is $O(n\cdot m)$ where $n$ is the number of nodes, $m$ the number of links.
The …
- 131