Bow-tie architectures evolve when the goal is rank deficient | We studied goals of dimension D = 6—8 consisting of L = 4—6 matrices, tested 4—8 different goals for each dimension, and evolved networks towards each goal in 100—3000 repeated simulations, each starting from different random initial conditions . |
Bow-tie architectures evolve when the goal is rank deficient | We repeated the simulation 700 times for each goal starting from different random matrix initial conditions . |
Data analysis | Consequently, each run starts from different initial conditions and uses different mutational realizations. |
Results | Nevertheless, using the multiplicative properties of branching processes, we can calculate the probability of escape and the (conditional) average time to resistance for any given initial conditions of tumor size or metastases (see derivation details in 81 Text). |
Results | Similar results are obtained using different initial conditions , despite that resistance evolution is more likely (and sooner) to occur When the sensitive cell is initially placed in the sanctuary compartment than in the drug-containing compartment (cf. |
Results | This result is mainly due to the initial condition used: lesion 1 is much larger than lesion 0 that the influx of escaping cells to the sanctuary exceeds the number of cells in situ. |