图上序贯指派问题的相变
Phase transition in a sequential assignment problem on graphs
摘要:
我们在有限图$G = (V, E)$上研究下面的博弈。在开始时,每个边被分配一个整数$n_e \ge 0$、$n = \sum_{e \in E} n_e$。在圆形$t$中,$1 \le t \le n$,选择均匀随机顶点$v \in V$,并且由玩家选择与$v$关联的边$f$之一。分配给$f$的值然后减去$1$。如果达到配置$(0, \dots, 0)$,则玩家获胜;换句话说,边缘值永远不会变为负值。我们的主要结果是,有一个相变:作为$n \to \infty$,玩家获胜的概率接近一个常数$c_G > 0$时,$(n_e/n : e \in E)$收敛到一个点在内部的某一凸集$\mathcal{R}_G$,和去$0$指数时,$(n_e/n : e \in E)$是有界远离$\mathcal{R}_G$。我们还得到了在近临界区域,即当$(n_e/n : e \in E)$位于接近$\partial \mathcal{R}_G$ .我们在论证中提供了定量的误差界。
英文摘要:
We study the following game on a finite graph $G = (V, E)$. At the start, each edge is assigned an integer $n_e \ge 0$, $n = \sum_{e \in E} n_e$. In round $t$, $1 \le t \le n$, a uniformly random vertex $v \in V$ is chosen and one of the edges $f$ incident with $v$ is selected by the player. The value assigned to $f$ is then decreased by $1$. The player wins, if the configuration $(0, \dots, 0)$ is reached; in other words, the edge values never go negative. Our main result is that there is a phase transition: as $n \to \infty$, the probability that the player wins approaches a constant $c_G > 0$ when $(n_e/n : e \in E)$ converges to a point in the interior of a certain convex set $\mathcal{R}_G$, and goes to $0$ exponentially when $(n_e/n : e \in E)$ is bounded away from $\mathcal{R}_G$. We also obtain upper bounds in the near-critical region, that is when $(n_e/n : e \in E)$ lies close to $\partial \mathcal{R}_G$. We supply quantitative error bounds in our arguments.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。