Social Network Analysis and Visualization software application.

Implementation of Tarjan, Nuutila and Pearce algorithms for strongly connected components using C++ Boost Library.

💻 Phase Transition for Random Graphs (A-FIB)

Started as a numerical task to prove convergence of number of triangles in ER graph, this project grown to consist of various random graph models' implementations, such as Erdos-Renyi random graph, Generalized random graph, Configuration Model.

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

C++ library for analysis and simulations of networks

Experimental Study of Phase Transition in Percolation Processes

Random graphs help in analyzing complex networks. In a random graph, the quantities of nodes and arcs are random variables defined according to a given probabilistic model. In this project we will explore properties of undirected random graphs in the Erdos Renyl model.