In this work, we examine the resilience of two complex network types (Erdos Renyi, and Power-Law/Scale-free) to potential delivered attacks and random errors.

Rust library for of graph ensembles

This repository contains FDP'18 presentations and R scripts.

A collection of basic CS Algorithms

Simulation of a social network formation influenced by geographical features and distance

The exercise of the the course of Dynamical Models in Network Theory @IMT School For Advanced Studies Lucca

Project DAA B25

FLTR metric on Bernoulli random graphs

Generate, color, and visualize random graphs using Python's NetworkX and Matplotlib. Includes compression and storage of graph data with .gz and pickle. Ideal for exploring graph coloring and greedy algorithms in graph theory.

Sample the G(n, m)-model of Erdős–Rényi random graphs.

Study, analysis and extraction of knowledge from the web and social networks.

Another graph library. Social networks, path-finding algorithms, graph generation, and more.

Альтернативный экзамен :: Реализация программы-калькулятора для вычисления характеристик случайных графов / Alternative exam :: Implementation of program for calculating characteristics of random graphs

🎓💻University of Tehran Complex Networks Course Projects - Spring 2024

Repository dedicated to the codes of my final essay about percolation in complex networks

Assignments for the course Complex networks: theory and applications

📊 Synthetic graph generation toolkit for graph research & benchmarking. Create massive random graphs, generate labels for semi-supervised learning, convert formats.

It consists in basic metrics and functions to describe networks. I use as an example two synthetic networks.

Reproduction of networks and papers

Monte Carlo simulation to estimate the connectivity probability of Erdős–Rényi random graphs G(n,p) G(n,p), with CLT confidence intervals and Hoeffding/Chernoff sample-size bounds.