Fig. 9From: Modeling algorithmic bias: simplicial complexes and evolving network topologiesAverage number of iterations at convergence for the Adaptive Algorithmic Bias model on Simplicial Complexes. The average number of iterations at convergence for the Adaptive Algorithmic Bias model on Simplicial Complexes as a function of \(\gamma\) and \(p_r\) for a \(\epsilon =0.2\) and b \(\epsilon =0.3\) in a Erdős–Rényi graph and c, d in a scale-free Barabási–Albert graph. These values are averaged over 30 runsBack to article page