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.

This repository contains FDP'18 presentations and R scripts.

Rust library for of graph ensembles

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

FLTR metric on Bernoulli random graphs

This project is an implementation of the Adaptive Power Method (APM). It simulates a random walk on an Erdős-Rényi random graph to compute the scaled culumant generating function (SCGF) and rate function of the mean degree a time additive observable.

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

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

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

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

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

Network analysis of Game of Thrones

Reproduction of networks and papers

Assignments for the course Complex networks: theory and applications

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

Random matrix theory and spectral graph algorithms