Percolation probability

Acknowledgements- Department of Electrical Communication Engineering (ECE) and Computational Data Sciences (CDS) and the Center for Networked Intelligence (CNI), Indian Institute of Science (IISc), Bengaluru, India.

Site percolation on \(\mathbb{Z}^2\)

The below plot is obtained by finding the largest cluster of open sites on a \(501 \times 501\) square grid.

Click on the 🏠 button below if plot is not visible. Open in new tab to read off values.

If using this data, please consider citing this paper.. You can download the JSON file here.

Continuum percolation on \(\mathbb{R}^2\)

The below plot was obtained by finding the fraction of nodes in the largest connected component in a random geometric graph of intensity \(\lambda\) deployed over a \(251 \times 251\) area and where two nodes that are within unit distance are connected to each other.

Click on the 🏠 button below if plot is not visible. Open in new tab to read off values.

If using this data, please consider citing this paper.. You can download the JSON file here.

References

2023

  1. An analysis of probabilistic forwarding of coded packets on random geometric graphs
    B. R. Vinay Kumar, Navin Kashyap, and D. Yogeshwaran
    Performance Evaluation, May 2023

2021

  1. Probabilistic Forwarding of Coded Packets on Networks
    B. R. Vinay Kumar, and Navin Kashyap
    IEEE/ACM Transactions on Networking, May 2021