One thing to notice is that every element in $\Delta_n$, for $n \geq 2$, is obtained by iterated composition of elements of $\Delta_2$ (these are parametrized by elements $t$ in the unit interval). In other words, the binary operations for this theory generate all the operations, and in a specific way: for a model or algebra $X$, letting $\theta$ be any element of $C(n)$, and denoting the operation associated with $\theta$ by $m_\theta: X^n \to X$, there exist elements $t_1, \ldots, t_{n-1} \in C(2)$ such that (associating to the right)

$$m_\theta(x_1, \ldots, x_n) = m_{t_1}(x_1, m_{t_2}(x_2, \ldots m_{t_{n-1}}(x_{n-1}, x_n)\ldots )) \qquad (1)$$
(Pause for a moment to consider the example of convex sets. Here $m_t(x, y) = tx + (1-t)y$.) For $\theta = (\theta_1, \ldots, \theta_n)$ in the interior of the simplex $\Delta_n$, the $t_i \in C(2)$ are uniquely determined by the formulas 

$$t_1 = \theta_1, \qquad t_i = \frac{\theta_i}{1 - \theta_1 - \ldots - \theta_{i-1}}$$ 
for $1 < i < n$. But regarding points $\theta$ on the boundary of $\Delta_n$: as soon as $t_i = 1$, the remaining parameters $t_{i+1}, t_{i+2}, \ldots, t_{n-1}$ are no longer uniquely determined; indeed, for any choice of those parameters past $t_i = 1$, equation (1) holds. Put differently, 

$$m_1(x, m_t(y, z)) = m_1(m_1(x, y), z) \qquad (2)$$ 
is an equation that holds universally in $\Delta$-algebras, and it follows that 

$$m_1(x, m_s(y, z)) = m_1(x, m_t(y, z))$$ 
is an identity that holds for all $s, t \in C(2)$. 

All of this holds in particular for operations $m_\theta$ that are derived from binary operations $m_t$ by iterated composition, sometimes associating to the left. In other words, we have equations 

$$m_s(m_t(x, y), z) = m_{st}(x, m_{\frac{s-st}{1-st}}(y, z)) \qquad (3)$$ 
(provided that $st \neq 1$) which play the role of associativity equations. This may look strange at first, but for the example of convex algebras, it's a simple calculation based on rearranging convex combinations: 

$$m_s(m_t(x, y), z) = s(tx + (1-t)y) + (1-s)z = stx + (1-st)\left(\frac{s-st}{1-st} y + \frac{1-s}{1-st} z\right).$$ 

> So, we may characterize $\Delta$-algebras as sets $X$ equipped with binary operations $m_t$, with $t$ ranging over $[0, 1]$, subject to the associativity conditions (2) and (3) above. 

(We could even use equations (2) and (3) to set up a rewrite system for derived iterated compositions of binary operations, as tracked by planar binary trees, where in each application of of these cases we rewrite the left side of the equation to the right side.) 

There are a number of subsidiary consequences of (3). For example, mirroring equations of type (2), we have the equation 

$$m_0(m_t(x, y), z) = m_0(x, m_0(y, z)). \qquad (4)$$ 
So $m_0$ are associative each in their own right, and equations (2) and (4) state their "absorption" properties, and there are some other mild curiosities like 

$$m_s(m_0(x, y), z) = m_0(x, m_s(y, z)), \qquad m_1(m_t(x, y), z) = m_t(x, m_1(y, z)).$$