Evolution of scale-free and lattice networks
-
Updated
Oct 11, 2024 - MATLAB
Evolution of scale-free and lattice networks
MatLab implementation for Heshen-Kopelman cluster finding algorithm. The idea is having an efficient algorithm able to search for clusters in a NxN matrix and being able to find percolation thresholds plus some more interesting infos.
Repository for the Software and Computing for Applied Physics Exam
Parameter estimation of seeding and contamination rates on a triangular lattice using the method of simulated moments (MSM).
Add a description, image, and links to the percolation topic page so that developers can more easily learn about it.
To associate your repository with the percolation topic, visit your repo's landing page and select "manage topics."