I am interested in estimating how large determinants of matrices tend to be 'on average' given the following model: suppose we form $n \times n$ matrices $M$ such that all of the entries of $M$ are integers, and the entries of the $i$th row of $M$ are bounded by some positive parameter $k_i$. Then by expressing the determinant as a polynomial in the entries, we see that $$\displaystyle |\det(M)| \leq n! (k_1 \cdots k_n).$$ However, this estimate seems to be too large for an estimate for the mean, as on average one would expect significant cancellation to make the determinant small. Thus to pose my question formally:

Consider the set of $n \times n$ matrices with integer entries such that the absolute value of each entry in the $i$th row is bounded by the parameter $k_i > 0$. Let $M(k_1, \cdots, k_n)$ denote this set of matrices. Then what is the average value of the absolute value of determinant of the elements in $M(k_1, \cdots, k_n)$? Let $\mu(k_1, \cdots, k_n)$ denote this average. Given $\epsilon > 0$, can one give an estimate to how many matrices $M$ in $M(k_1, \cdots, k_n)$ satisfy $$\displaystyle (1 - \epsilon)(\mu(k_1, \cdots, k_n)) \leq |\det(M)| \leq (1 + \epsilon)(\mu(k_1, \cdots, k_n))?$$ Thanks for any insight on the matter.