有限图上的边平均动力学:矩依赖性
Edge-averaging dynamics on finite graphs: moment dependence
AI总结:
研究有限连通图上边平均过程,分析初始意见的L^p范数约束下收敛时间的渐进行为,证明期望收敛时间与p相关,且在环图上紧致。
摘要:
我们研究有限连通图$G = (V, E)$上的边平均过程。初始时,顶点赋予独立同分布的实值意见$(f_0(v))_{v \in V}$。边根据速率1的独立泊松钟激活;当边激活时,其端点的意见被替换为平均值。令$f_t(v)$表示时间$t$时$v$处的意见。定义$\epsilon$-收敛时间$\tau_\epsilon$为最大值和最小值差不超过$\epsilon$的第一个时间。已知若初始意见$(f_0(v))_{v \in V}$在$L^\infty$有界,则$\mathbb{E}(\tau_\epsilon)$至多为$C_\epsilon \log^2 n$。我们假设相反,即$f_0(v)$的$L^p$范数对每个$v \in V$不超过1。对于固定的$\epsilon \in (0, 1]$,证明$\mathbb{E}(\tau_\epsilon) = \widetilde{O}(n^{\beta_p})$,其中$\beta_p := \max(3 - p, 2/p)$。此外,此幂律在环图上紧致。
英文摘要:
We study the edge-averaging process on a finite, connected graph $G = (V, E)$. Initially, the vertices in $V$ are endowed with i.i.d.\ real-valued opinions $(f_0(v))_{v \in V}$. Edges are activated according to i.i.d.\ Poisson clocks of rate $1$; when an edge is activated, the opinions at its endpoints are replaced by their average. Let $f_t(v)$ denote the opinion at $v$ at time $t$.Define the $ε$-convergence time $τ_ε$ as the first time when the maximum and the minimum of $f_t$ differ by at most $ε$. It is known that if the initial opinions $(f_0(v))_{v \in V}$ are bounded in $L^\infty$, then $\mathbb{E}(τ_ε)$ is at most $C_ε\log^2 n$ for $ε\in (0, 1]$. We assume instead that the $L^p$ norm of $f_0(v)$ is at most $1$ for every $v \in V$. For fixed $ε\in (0, 1]$, and show that $\mathbb{E}(τ_ε) = \widetilde{O}(n^{β_p})$ up to logarithmic terms, where $β_p := \max(3 - p, 2/p)$. Moreover, this power law is tight on cycle graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。