Key points are not available for this paper at this time.
Abstract Log-linear statistical models are used to characterize random graphs with general dependence structure and with Markov dependence. Sufficient statistics for Markov graphs are shown to be given by counts of various triangles and stars. In particular, we show under which assumptions the triad counts are sufficient statistics. We discuss inference methodology for some simple Markov graphs. Key Words: Log-linear network modelMarkov fieldGraph inference
Frank et al. (Mon,) studied this question.