Comparing features of the Erdos-Renyi graph with a Real-world graph (MT) with the same number of nodes!
-
Updated
Dec 19, 2022 - Jupyter Notebook
Comparing features of the Erdos-Renyi graph with a Real-world graph (MT) with the same number of nodes!
Реализация программы-калькулятора для вычисления характеристик случайных графов // Implementation of program for calculating characteristics of random graphs
Simulation of various complex networks.
Modified gap statistic (gap-com) for regularization selection of sparse networks. This method is aimed for complex network estimation.
Contains GCN training and a module that generates Erdos Reyni Graphs for training.
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.
The code and results for finding anchor nodes in different networks which reduce the APL of the network.
Review of different models for generating graphs.
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)
Sample the G(n, m)-model of Erdős–Rényi random graphs.
Альтернативный экзамен :: Реализация программы-калькулятора для вычисления характеристик случайных графов / Alternative exam :: Implementation of program for calculating characteristics of random graphs
Add a description, image, and links to the erdos-reyni-graphs topic page so that developers can more easily learn about it.
To associate your repository with the erdos-reyni-graphs topic, visit your repo's landing page and select "manage topics."