关于可分解随机图
On decomposable random graphs
摘要:
可分解图的马尔可夫更新步骤繁琐而复杂。而不是直接建模,这项工作介绍了一类树依赖的二分图,跨越可分解图的投影空间。这是通过维度扩展来实现的,该维度扩展使得图节点在给定潜在树的情况下是条件独立的。因此,马尔可夫更新步骤被显著简化。使用树依赖二分图的结构建模具有额外的好处。例如,某些在可分解形式中很难获得的性质现在很容易获得。此外,树依赖的二分图可以提取和建模额外的信息,子聚类动态,而目前已知的模型可分解图不。可分解图的性质也可以转移到扩展维上,例如吸引似然因子分解性质。由于使用二分表示,可以使用为随机图开发的工具。因此,随机树依赖二部图的框架,从而为随机可分解图,提出。
英文摘要:
Decomposable graphs are known for their tedious and complicated Markov update steps. Instead of modelling them directly, this work introduces a class of tree-dependent bipartite graphs that span the projective space of decomposable graphs. This is achieved through dimensionality expansion that causes the graph nodes to be conditionally independent given a latent tree. The Markov update steps are thus remarkably simplified. Structural modelling with tree-dependent bipartite graphs has additional benefits. For example, certain properties that are hardly attainable in the decomposable form are now easily accessible. Moreover, tree-dependent bipartite graphs can extract and model extra information related to sub-clustering dynamics, while currently known models for decomposable graphs do not. Properties of decomposable graphs are also transferable to the expanded dimension, such as the attractive likelihood factorization property. As a result of using the bipartite representation, tools developed for random graphs can be used. Hence, a framework for random tree-dependent bipartite graphs, thereupon for random decomposable graphs, is proposed.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。