Symmetric Graph Properties Have Independent Edges
Information and Computation(2015)
摘要
In the study of random structures we often face a trade-off between realism and tractability, the latter typically enabled by independence assumptions. In this work we initiate an effort to bridge this gap by developing tools that allow us to work with independence without assuming it. Let G(n) be the set of all graphs on n vertices and let S be an arbitrary subset of G(n), e.g., the set of all graphs with m edges. The study of random networks can be seen as the study of properties that are true for most elements of S, i.e., that are true with high probability for a uniformly random element of S. With this in mind, we pursue the following question: What are general sufficient conditions for the uniform measure on a set of graphs S subset of G(n) to be well-approximable by a product measure on the set of all possible edges?
更多查看译文
关键词
Convex Hull, Random Graph, Product Measure, Giant Component, Uniform Measure
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络