arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1904.04899cond-mat.stat-mechcs.ET
收藏

数字存储器计算机中的临界分支过程

Critical branching processes in digital memcomputing machines

Sean R. B. Bearden, Forrest C. Sheldon, Massimiliano Di Ventra

摘要:

记忆计算是一种利用时间非局部性(记忆)来求解组合优化问题的新型计算模式。它可以在实践中实现的非线性动力系统的点吸引子代表的解决方案的原始问题。先前已经表明,在解决方案搜索过程中,数字存储器计算机会经历雪崩(瞬子)的瞬态阶段,从而促进动态长程序。通过采用平均场的参数,我们预测的雪崩大小的分布遵循一个典型的临界分支过程与指数$τ= 3/2$的Borel分布。我们证实了这一分析,通过解决各种随机3-SAT实例的布尔可满足性问题。数值结果表明,幂律分布的指数$τ= 1.51 \pm 0.02$,在非常好的协议与平均场分析。这表明记忆计算机器会自我调整到一个临界状态,在这个临界状态下,雪崩的特征是分支过程,并且这种状态在它们的大部分进化过程中都持续存在。

英文摘要:

Memcomputing is a novel computing paradigm that employs time non-locality (memory) to solve combinatorial optimization problems. It can be realized in practice by means of non-linear dynamical systems whose point attractors represent the solutions of the original problem. It has been previously shown that during the solution search digital memcomputing machines go through a transient phase of avalanches (instantons) that promote dynamical long-range order. By employing mean-field arguments we predict that the distribution of the avalanche sizes follows a Borel distribution typical of critical branching processes with exponent $τ= 3/2$. We corroborate this analysis by solving various random 3-SAT instances of the Boolean satisfiability problem. The numerical results indicate a power-law distribution with exponent $τ= 1.51 \pm 0.02$, in very good agreement with the mean-field analysis. This indicates that memcomputing machines self-tune to a critical state in which avalanches are characterized by a branching process, and that this state persists across the majority of their evolution.

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

↑