arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.14488cs.DM
收藏

随机图和复杂网络中的一阶模型检验

First-Order Model-Checking in Random Graphs and Complex Networks

Jan Dreier, Philipp Kuinke, Peter Rossmanith

摘要:

复杂网络无处不在。它们例如以生物网络、社交网络或计算机网络的形式出现,并且已经被广泛地研究。解决复杂网络问题的有效算法在当今社会中发挥着核心作用。数学元定理表明,许多问题可以有效地解决。由于逻辑是建模问题的有力工具,它已被用来获得非常一般的元定理。在这项工作中,我们认为所有的问题定义在一阶逻辑和分析的复杂网络的属性,使他们能够有效地解决。描述复杂网络的数学工具是随机图模型。我们定义了随机图模型的一个性质,称为$α$ -幂律有界性。粗略地说,一个随机图是$α$ -幂律有界的,如果它不允许强聚类,并且它的度序列是由指数至少为$α$的幂律分布所约束的(即度为$k$的顶点的分数大致为$O(k^{-α})$)。我们解决了一阶模型检验问题(参数化的公式的长度)在几乎线性FPT时间随机图模型满足这一性质与$α\ge 3$。这特别意味着,在这些随机图模型上,人们可以在几乎线性的预期时间内解决一阶逻辑中可表达的每个问题。这包括例如偏好连接图、Chung-Lu图、配置图和稀疏Erdens-Rényi图。我们的结果匹配已知的硬度结果和推广以前的易处理性结果在这个问题上。

英文摘要:

Complex networks are everywhere. They appear for example in the form of biological networks, social networks, or computer networks and have been studied extensively. Efficient algorithms to solve problems on complex networks play a central role in today's society. Algorithmic meta-theorems show that many problems can be solved efficiently. Since logic is a powerful tool to model problems, it has been used to obtain very general meta-theorems. In this work, we consider all problems definable in first-order logic and analyze which properties of complex networks allow them to be solved efficiently. The mathematical tool to describe complex networks are random graph models. We define a property of random graph models called $α$-power-law-boundedness. Roughly speaking, a random graph is $α$-power-law-bounded if it does not admit strong clustering and its degree sequence is bounded by a power-law distribution with exponent at least $α$ (i.e. the fraction of vertices with degree $k$ is roughly $O(k^{-α})$). We solve the first-order model-checking problem (parameterized by the length of the formula) in almost linear FPT time on random graph models satisfying this property with $α\ge 3$. This means in particular that one can solve every problem expressible in first-order logic in almost linear expected time on these random graph models. This includes for example preferential attachment graphs, Chung-Lu graphs, configuration graphs, and sparse Erdős-Rényi graphs. Our results match known hardness results and generalize previous tractability results on this topic.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑