https://github.com/hamidrezakmk/twice-ramanujan-sparsifiers

An implementation and report of the twice Ramanujan graph sparsifiers.
https://github.com/hamidrezakmk/twice-ramanujan-sparsifiers

expanders graphs ramanujan semi-definite-programming sparsification

Last synced: 23 days ago
JSON representation

An implementation and report of the twice Ramanujan graph sparsifiers.

• Host: GitHub
• URL: https://github.com/hamidrezakmk/twice-ramanujan-sparsifiers
• Owner: HamidrezaKmK
• License: mit
• Created: 2022-12-20T16:58:05.000Z (about 2 years ago)
• Default Branch: main
• Last Pushed: 2022-12-23T23:12:07.000Z (about 2 years ago)
• Last Synced: 2024-11-06T22:45:22.912Z (2 months ago)
• Topics: expanders, graphs, ramanujan, semi-definite-programming, sparsification
• Language: Jupyter Notebook
• Homepage: https://HamidrezaKmK.github.io/twice-ramanujan-sparsifiers/docs
• Size: 3.68 MB
• Stars: 3
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Twice Ramanujan Sparsifiers

Based on the paper [Twice-Ramanujan Sparsifiers](https://arxiv.org/abs/0808.0163) we have implemented a spectral sparsification algorithm that produces graphs with the number of edges being almost linear.

You can check out the full description of the algorithm on the [repository website](https://hamidrezakmk.github.io/twice-ramanujan-sparsifiers/docs/).

![Barbel sparsification example](docs/index_files/figure-html/fig-barbell-output-1.png)

## Setup

In a python (>=3.9) environment, run the following commands:

```bash

git clone https://github.com/HamidrezaKmK/twice-ramanujan-sparsifiers.git # clone the repository

cd src

pip install -r requirements.txt # install dependencies

```

## License

This project is licensed under the MIT License - see the [LICENSE](LICENSE) file for details