Directed Graphs Generation for Network Computing Simulations

Overview

• DGen randomly generates a digraph with a specific connectivity ratio.

function [P,per_t,fig]=DGen(L,per,name,show_graph,quiet,arg_opt1)

• Required parameters:
  • L: number of nodes
  • per: expected connectivity ratio
  • name: the type of digraph can only be random in the current version
  • show_graph: plot the digraph or not, true/false
  • quiet: silent mode or not, true/false
  • arg_opt1: reserved for future use
• Return values:
  • P: adjacency matrix of the generated digraph
  • per_t: the actual connectivity ratio
  • fig: the figure handle of the plotted digraph, exists only when show_graph=true
• Examples:
  • [P,per_t,fig]=DGen(10,0.5,'random',true,true);
• References:
  • [1] Angelia Nedić, Alex Olshevsky, and Wei Shi, Achieving Geometric Convergence for Distributed Optimization over Time-Varying Graphs, to appear in SIAM Journal on Optimization, 2017.
  • [2] W. Shi, Decentralized Optimization Algorithms and Convergence Analysis of Networked Multi-Agent Systems, PhD thesis, USTC, 2015.
• Please use the code under the GNU GPLv3
• Changelog:

Matlab code

• DGen_v1.0.zip