You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Simple projects to understand concepts from the Complex Network course at UOC: Structural Descriptors, Models of Complex Networks, Community Detection, Dynamics in CN (Epidemic simulation)
Альтернативный экзамен :: Реализация программы-калькулятора для вычисления характеристик случайных графов / Alternative exam :: Implementation of program for calculating characteristics of random graphs
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.
Реализация программы-калькулятора для вычисления характеристик случайных графов // Implementation of program for calculating characteristics of random graphs
Code to study the different parameters for random network models including degree distribution, clustering coeffecient and path length. Part of CSEN 354: Social Networks Analysis & Risks taught by Dr. Xiang Li at Santa Clara University.