There are 2 repositories under betweenness-centrality topic.
Social network analysis code examples for PyCon 2019 talk
Graphs and passing networks in football.
k Betweenness Centrality algorithm for Spark using GraphX
OpenGraph is an open-source graph processing benchmarking suite written in pure C/OpenMP.
OpenGraph is an open-source graph processing benchmarking suite written in pure C/OpenMP. Integrated with Sniper simulator.
NetworkX clone in JavaScript
Parallelizing Graph Betweenness Centrality with CUDA
Graph Processing Framework that supports || OpenMP || CAPI
Test the efficiency of Betweenness Centrality improved structure entropy, by exposing China's High-speed railway network to specfic attacks and random attacks.
Energy Grid Optimization and Analysis (EGOA)
A tool for browse and analyze Docker Registries
Demo on applying the concept of network analysis on a network of connected railway stations, attempting to identify the important stations (nodes) in this network. Web scraping techniques using rvest package is also briefly discussed upon.
Analysis of London street gang network
Code to calculate network measures for multi-regional input-output (MRIO) tables
Exploratory Social Network Analysis using NetworkX. Predicting Review Rating using features derived from Network Properties.
Program performs social network analysis on more than 200 Twitter users.
Some algorithms I'm implementing for some work.
Analysis of the traffic flow in the cities of Bristol and Cincinnati, considering data gathered by Uber Movement.
Given an instance of set of nodes in a social network graph, the aim is to find the influencing important users and to predict the likelihood of a future association between two nodes, knowing that there is no association between the nodes in the current state of the graph.
Serial and parallel implementations of computing the betweenness centrality for large sparse graphs using C++ and CUDA
Parallel implemenation of Brandes algorithm computing betweenness centrality
We will get data about movies in between 1995 and 2004 from IMBD and we will perform a complete SNA
This project utilizes various metrics to analyze a graph network based on data of ENZYMES_g295
Data and code to Estévez & Takács (2022) 'Brokering or sitting between two chairs? A group perspective on workplace gossip'. Frontiers in Psychology, 13: 815383.
This project was created for Graph-Based Analysis for Big Data in Social Networks class at College of Staten Island (CUNY) in December 2020.
Analysis of European Union Mail dataset to compute degree centrality, betweenness, interaction and visualization using the R-shiny app.
Network analysis using NetworkX library
Learning From Networks (LFN) project repository. "Learning From Networks" is a course of the master degree in "Computer Engineering" at the University of Padua, Italy.
The goal of this project is to implement the Brandes algorithm for calculating betweenness centrality in a graph. The Brandes algorithm is a well-known algorithm for efficiently computing betweenness centrality in large, complex networks.
Find pivot universities in collaboration network
Sequential and parallel implementation of different Centrality Measures.
Basic Matlab scripts for social network analysis.