Scale free network using B-A algorithm

Version 1.0.0.0 (1.51 KB) by Tapan
Generates a scale free directed adjacency matrix using the BA algorithm
1.5K Downloads
Updated 28 Jan 2015

View License

Use as:
A = BAgraph_dir(N,m0,m);
Where, N = number of nodes in the network, m0 is the size of seed network and m is the average degree of seed network; use mo=m or m<m0. For example,
A = BAgraph_dir(300,10,10);
The resulting adjacency matrix contains a 1 in row i, column j if i connects to j. A has a power-law in-degree distribution. Please be patient as the algorithm may take ~2-3 minutes to generate an adjacency matrix for N=300.

Cite As

Tapan (2024). Scale free network using B-A algorithm (https://www.mathworks.com/matlabcentral/fileexchange/49356-scale-free-network-using-b-a-algorithm), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2013b
Compatible with any release
Platform Compatibility
Windows macOS Linux
Categories
Find more on Graph and Network Algorithms in Help Center and MATLAB Answers
Acknowledgements

Inspired: Exact controllability of complex networks

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Version Published Release Notes
1.0.0.0