what could be the most efficient way to generate a mxn binary array matrix which is contrained to the sum per column is equal 0 or 1 ?
somethin like this
[[0,0,1,0,0],
[1,1,0,0,0],
[0,0,0,0,1]
[0,0,0,0,0]]
Run Code Online (Sandbox Code Playgroud)
m and n are going to be fixed, but n is larger than 500000 so iteration methods could take a long time until an appropied matrix is found.
我得到了原始样本数据及其模拟数据(不要问我是如何模拟的),我想检查直方图是否匹配.所以最好的方法是,qqplot但statsmodels库不允许不同大小的样本.