An open API service indexing awesome lists of open source software.

https://github.com/haaziq386/motifscale

MotifGraphLab is a Python framework for generating large graphs from 4‑node motifs. It computes scalable metrics (diameter, clustering, path length, triangles) with exact and approximate methods.
https://github.com/haaziq386/motifscale

clustering-coefficient complex-networks data-science diameter-estimation graph-analysis graph-generation graph-theory motifs network-science networkx python research-tool scalability simulation

Last synced: about 2 months ago
JSON representation

MotifGraphLab is a Python framework for generating large graphs from 4‑node motifs. It computes scalable metrics (diameter, clustering, path length, triangles) with exact and approximate methods.

Awesome Lists containing this project

README

          

# Motif Graph Generator — Quick Start

Course Project: CSL-519 Social Network Analysis
Instructor: Prof. Pradumn K. Pandey

Small README to run the Python script that generates motif-based graphs and reports metrics.

## Requirements

* Python 3.8+ recommended
* Install dependencies:

```bash
pip install networkx numpy scipy tqdm matplotlib
```

## Run

From the directory containing `BTech_22114055_Haaziq.py`:

```bash
python BTech_22114055_Haaziq.py
```

The script will:

* Generate graphs for sizes defined in the `sizes` list in the `if __name__ == "__main__"` block.
* Print aligned results (edges, diameter, path length, triangles, clustering, motif proportions).

## Quick edits

Open the script and edit the following in the `__main__` block:

* `sizes` — list of node counts to run.
* `edges_for_size` — target number of edges per size.
* `motif_fracs` — desired motif proportions (must map to `MOTIF_ORDER`).
* `runs_map` — number of runs to average per size (use `1` for very large sizes).

## Notes

* Large runs (50k, 100k) may take significant memory/time. Use `runs_map` to reduce repetitions.