随机游动的局部访问
Local Access to Random Walks
摘要:
对于$n$顶点上的图$G$,在时间$t$上对随机游走的位置进行简单采样需要工作$Ω(t)$。我们期望支持$\text{position}(G,s,t)$查询的本地访问算法,其返回在时间$t$处从某个起始顶点$s$开始的随机游走的位置,其中返回的位置的联合分布接近于在$\ell_1$距离上的这种游走上的均匀分布$1/\text{poly}(n)$。我们首先给出了一个算法的本地访问无向正则图上的行走与$\widetilde{O}(\frac{1}{1-λ}\sqrt{n})$运行时每个查询,其中$λ$是第二大的特征值的绝对值。由于随机$d$ -正则图是具有高概率的扩展器,这给出了用于$G(n,d)$的$\widetilde{O}(\sqrt{n})$算法,该算法改进了用于少量查询的朴素方法。然后,我们证明了没有,该算法与次常数误差给定的探针访问随机$d$ -正则图可以有运行时间比$Ω(\sqrt{n}/\log(n))$每个查询的期望,获得一个几乎匹配的下界。我们还显示了一个$Ω(n^{1/4})$运行时每个查询的下限,即使有一个不经意的对手(即当查询序列是固定的提前)。然后,我们表明,家庭的图与其他群论结构,可以实现显着更好的结果。我们给本地访问行走小度阿贝尔凯莱图,包括循环和超立方体,与运行时$\text{polylog}(n)$每个查询。这还允许对$\text{polylog}$度扩展器上的行走进行有效的本地访问。我们将我们的结果扩展到使用张量积(给本地访问度$n^ε$图的任何$ε\in (0,1]$)和笛卡尔积构建的图形。
英文摘要:
For a graph $G$ on $n$ vertices, naively sampling the position of a random walk of at time $t$ requires work $Ω(t)$. We desire local access algorithms supporting $\text{position}(G,s,t)$ queries, which return the position of a random walk from some start vertex $s$ at time $t$, where the joint distribution of returned positions is $1/\text{poly}(n)$ close to the uniform distribution over such walks in $\ell_1$ distance. We first give an algorithm for local access to walks on undirected regular graphs with $\widetilde{O}(\frac{1}{1-λ}\sqrt{n})$ runtime per query, where $λ$ is the second-largest eigenvalue in absolute value. Since random $d$-regular graphs are expanders with high probability, this gives an $\widetilde{O}(\sqrt{n})$ algorithm for $G(n,d)$, which improves on the naive method for small numbers of queries. We then prove that no that algorithm with sub-constant error given probe access to random $d$-regular graphs can have runtime better than $Ω(\sqrt{n}/\log(n))$ per query in expectation, obtaining a nearly matching lower bound. We further show an $Ω(n^{1/4})$ runtime per query lower bound even with an oblivious adversary (i.e. when the query sequence is fixed in advance). We then show that for families of graphs with additional group theoretic structure, dramatically better results can be achieved. We give local access to walks on small-degree abelian Cayley graphs, including cycles and hypercubes, with runtime $\text{polylog}(n)$ per query. This also allows for efficient local access to walks on $\text{polylog}$ degree expanders. We extend our results to graphs constructed using the tensor product (giving local access to walks on degree $n^ε$ graphs for any $ε\in (0,1]$) and Cartesian product.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。