Logo Lanfrica
  • Accueil
  • Atlas
  • Analyses
  • Documentation
  • Sign in

© 2026 Lanfrica. Tous droits réservés. Tous les droits d'auteur des ressources affichées sur le site Web Lanfrica appartiennent aux détenteurs de droits d'auteur d'origine, sauf indication contraire explicite.

MoshoodSO/NetworkScience-AIMS-Ghana-Cohort-2024

Domaine:

education
Créateur:
Mos
Hôte:
This repository presents a detailed analysis of the social interaction network within the AIMS Ghana Cohort 2024–2025. # Social Network Analysis (AIMS-GHANA Cohort 2024–2025) This repository presents a detailed analysis of the social interaction network within the **AIMS Ghana Cohort 2024–2025**. The goal is to explore how students interact socially and academically, identify influential individuals, discover communities, and uncover patterns that may influence collaboration, integration, and learning dynamics based on the data taken from their sitting arrangment at the cafeteria. --- ## 📁 Dataset Overview - **Filename:** `AIMSGHANANET25.csv` - **Description:** Contains social network data of students in the AIMS Ghana 2024–2025 cohort. - **Data Columns:** - `Name` – Student's first name (used as the node label) - `Country` – Country of origin - `Background` – Academic background (e.g., Mathematics, Computer Science, Statistics, etc) - `Friend1`, `Friend2`, `Friend3` – Names of three students most frequently sit with at the cafeteria during lunch break. Each student is represented as a **node**, and their three listed friends are connected to them as **edges**, forming a undirected social interaction graph. --- # Graphical visualization of interaction --- ## 🎯 Project Objectives The analysis is guided by the following key questions: 1. **Is the network connected?** - Investigate the existence of a giant component and isolated subgraphs. 2. **Who are the most influential people?** - Apply centrality measures (degree, eigenvector, betweenness, etc) to identify key players in the network. 3. **What is the degree distribution?** - Assess how socially connected the network is and understand the network's density. 4. **Are there communities?** - Use algorithms like Louvain to detect social or academic clusters. 5. **How far apart are people?** - Measure shortest paths and calculate average path lengths. 6. **How clustered is the network?** - Evaluate the clustering coefficient to reveal local groupings and triadic closures. 7. **Which connections are bridges?** - Identif …

Visit

github.com