Fig. 1
From: Modeling algorithmic bias: simplicial complexes and evolving network topologies
A schematic illustration of the rewiring step under bounded confidence. In this example the confidence bound is \(\epsilon =0.2\). In a, we can see that the interacting pair (i, j) has an opinion distance further than the confidence bound. For this reason b node i tries to break the arc (i, j) and form a new arc (i, z) (with probability \(p_r\), with probability \(1-p_r\) nothing happens). Node z is chosen randomly between the remaining nodes in the network. In the case that \(|x_i - x_z| < \epsilon\) (c) the arc (i, j) is broken and the arc (i, z) is formed. Otherwise, if \(|x_i - x_z| \ge \epsilon\) (d), the rewiring fails, and the network structure remains the same