Blind demixing in a single random graph. fig:singlegraph shows the results of demixing with a single diffusing graph of varying \(\text{N}\)  and \(\text{L}=3\) . Random graphs are drawn according to the Erdős-Rényi model [1]} with edge probability \(0.1\) . Four settings with different values of \(\text{R}\)  and \(\text{S}\)  are presented. As expected, the performance worsens for larger values of \(\text{R}\)  and \(\text{S}\) . Interestingly, demixing for \((\text{R}\!=\!3, \text{S}\!=\!6)\)  is less successful than for \((\text{R}\!=\!2, \text{S}\!=\!9)\) . Since the number of signal coefficients to estimate in these two settings is the same (\(\text{R}\text{S}\) ), this suggests that the recovery is more sensitive to \(\text{R}\) .
