arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1304.6420cs.SIcs.DMcs.DS
收藏

防止社交网络中的混乱变得更加困难

Preventing Unraveling in Social Networks Gets Harder

Rajesh Chitnis, Fedor V. Fomin, Petr A. Golovach

摘要:

经常观察到用户在社交网络中的行为受到其朋友的动作的影响。Bhawalkar等人的\cite{bhawalkar-icalp}为社交网络中的用户参与引入了一个正式的数学模型,其中每个人都获得与参与的朋友数量成比例的收益。给定阈值度$k$,该模型的平衡是最大子图,其最小度为$\geq k$。然而,度小于$k$的个体的退出可能导致迭代退出的级联效应,使得平衡子图的大小变得非常小。为了克服这一点,一些特殊的顶点称为“锚”:这些顶点不需要有很大的程度。Bhawalkar等人在\cite{bhawalkar-icalp}中考虑了\textsc{Anchored $k$-Core}问题:给定一个图$G$和整数$b, k$和$p$,存在一个顶点集$B\subseteq H\subseteq V(G)$使得$|B|\leq b, |H|\geq p$和每个顶点$v\in H\setminus B$的度至少为$k$是导出子图$G[H]$ .他们证明了该问题对于$k\geq 2$是NP-难的,并给出了一些不可逼近性和固定参数难解性的结果。在本文中,我们给这个问题的硬度改进的结果。特别是,我们表明,\textsc{Anchored $k$-Core}问题是W[1]-硬参数化的$p$,甚至$k=3$。这改进了Bhawalkar等人\cite{bhawalkar-icalp}的结果(他们显示了由$b$参数化的W[2]硬度),因为我们的参数总是比$p\geq b$大。然后,我们回答了Bhawalkar等人的问题。\cite{bhawalkar-icalp}表明,\textsc{Anchored $k$-Core}问题仍然是NP-困难的平面图的所有$k\geq 3$,即使图的最大程度是$k+2$。最后,我们证明了这个问题是FPT的平面图$b$参数的所有$k\geq 7$。

英文摘要:

The behavior of users in social networks is often observed to be affected by the actions of their friends. Bhawalkar et al. \cite{bhawalkar-icalp} introduced a formal mathematical model for user engagement in social networks where each individual derives a benefit proportional to the number of its friends which are engaged. Given a threshold degree $k$ the equilibrium for this model is a maximal subgraph whose minimum degree is $\geq k$. However the dropping out of individuals with degrees less than $k$ might lead to a cascading effect of iterated withdrawals such that the size of equilibrium subgraph becomes very small. To overcome this some special vertices called "anchors" are introduced: these vertices need not have large degree. Bhawalkar et al. \cite{bhawalkar-icalp} considered the \textsc{Anchored $k$-Core} problem: Given a graph $G$ and integers $b, k$ and $p$ do there exist a set of vertices $B\subseteq H\subseteq V(G)$ such that $|B|\leq b, |H|\geq p$ and every vertex $v\in H\setminus B$ has degree at least $k$ is the induced subgraph $G[H]$. They showed that the problem is NP-hard for $k\geq 2$ and gave some inapproximability and fixed-parameter intractability results. In this paper we give improved hardness results for this problem. In particular we show that the \textsc{Anchored $k$-Core} problem is W[1]-hard parameterized by $p$, even for $k=3$. This improves the result of Bhawalkar et al. \cite{bhawalkar-icalp} (who show W[2]-hardness parameterized by $b$) as our parameter is always bigger since $p\geq b$. Then we answer a question of Bhawalkar et al. \cite{bhawalkar-icalp} by showing that the \textsc{Anchored $k$-Core} problem remains NP-hard on planar graphs for all $k\geq 3$, even if the maximum degree of the graph is $k+2$. Finally we show that the problem is FPT on planar graphs parameterized by $b$ for all $k\geq 7$.

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

↑