Sentence examples for simulated matrices from inspiring English sources

Ulrich and Gotelli (2007 [71]) systematically explored the relationship using simulated matrices with varying degrees of nestedness, checkerboarding, and randomness.

In order to test the performance of our program, we applied the program to both real data and simulated matrices.

The sequences of simulated matrices for the hybrid, B. rapa and B. napus were stored, allowing the same sequences to be used in the elasticity calculations below.

The results after 10,000 simulation runs show that on average 6.87 mutual triads have been observed in the simulated matrices.

For each of the 100 simulated matrices, we obtained the best tree over 10 independent runs using RAxML v7.2.6 [ 101] and calculated the difference in likelihood of this tree to that of the collapsed tree (used to simulate the sequences) using baseml (PAML v4.4).

We also generated three simulated matrices of different sizes but containing the same number of nonzero elements to test the impact of matrix size on the performance of the program (Table S3).

Figure 8 shows the norm of the vector difference between the 10 elements of the principal diagonal of the simulated matrix and those of the estimated matrix for and.

The bottom part of Figure 2 displays the log-likelihood curves (up to some constants) with respect to K for the same values of c, obtained on a given simulated matrix.

We used the Krzanowski subspace comparison statistic (Krzanowski 1979; Blows et al. 2004), which is the sum of the eigenvalues of the matrix S = G k ^ T G k G k T G k ^, where G k ^ is the subspace spanned by the eigenvectors with the k largest eigenvalues of the posterior mean of G, and G k is the corresponding subspace of the true (simulated) matrix.

If we simulate matrices with imposed variations in payoff values we can calculate the frequency of cases which do not meet the conditions for Prisoners Dilemma.

To test the significance of such a finding Snijders has proposed a procedure that simulates matrices of equal size conditioning the distribution of in- and outgoing ties of each node (Snijders 1991).