Globally optimal score-based learning of directed acyclic graphs in high-dimensions

Itfollows from (2) thatX Np(0, (eB,e )), where (eB,e ): = (I eB) Te (I eB) 1. (3) Wewillassumethat 0, andmoreoverthatrmin( ) rmax( ) 1, i.e. theeigenvaluesof are boundedawayfrom0and1. See (47) inthesupplement ( ;s), which conditionnumber ofsizeO(s).