There are 1 repository under random-graphs topic.
Fast generator for random graphs with prescribed degree sequence
Repository of the netin package to generate random scale-free graph generators proposed by members of the Network Inequality CSH group.
Implementation of Tarjan, Nuutila and Pearce algorithms for strongly connected components using C++ Boost Library.
R package for Generalised Hypergeometric Ensembles of Random Graphs (gHypEG)
Tensorflow implementation of "Exploring Randomly Wired Neural Networks for Image Recognition"
BigSMARTS Query Language and Polymer Substructure Search
Dynamic random expander graphs generator
Homework and exercises from course Network Dynamics and Learning - PoliTo
Various tasks related to graphs and networks theory
Raku package providing graph theory algorithms and parameterized- and random graphs.
[KDD 2022] Official Code Release for "Core-periphery Models for Hypergraphs"
Tools for researching relations between the TSP and proximity graphs
💻 Phase Transition for Random Graphs (A-FIB)
Random Graphs, Random Matrices, FK Dependent Categorical, Galton-Watson
Fitting and model checking a dynamic model for directed scale-free networks on a bitcoin network dataset.
Topological Data Analysis on a Brain Network
My python implementation of different Computational Methods and Applications.
This repository contains scripts for generating and analyzing different types of social networks using Python, NetworkX, and Matplotlib.
Various Network Science Projects (2021-2022)
Experimental Study of Phase Transition in Percolation Processes
This repository is adapt from the course materials for Honors Engineering Analysis at Northwestern University. The course is designed for Engineering first-year undergraduate students to learn about linear algebra and its applications.
Promoting cooperation by preventing exploitation: The role of network structure
Another graph library. Social networks, path-finding algorithms, graph generation, and more.
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.
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.
Thesis work
Repository for 'Hyper-graphical extensions of randomly grown neural networks'
Simple shiny widget to filter a D3 network by node groups interactively
This project is a homework assignment on probabilistic techniques and randomized algorithms. It involves problems related to random graphs, Ramsey theory, graph colorings, k-SAT, Markov chains, and random walks. The tasks require proving statements, finding probability distributions, and analyzing convergence properties in probabilistic models.