本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2010
摘要
We investigate exponential families of 隨機圖 distributions as a framework for systematic quantification of structure in 網絡s. In this paper we restrict ourselves to undirected unlabeled graphs. For these graphs, the counts of subgraphs with no more than k links are a sufficient statistics for the exponential families of graphs with interactions between at most k links. In this framework we investigate the dependencies between several observables commonly used to quantify structure in 網絡s, such as the degree distribution, cluster and assortativity coefficients.
※ 此為已發表論文，全文需透過期刊付費取得