arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2201.12222cond-mat.dis-nncs.LGnlin.AO
收藏

求解一个有向渗流反问题

Solving a directed percolation inverse problem

Cornell University(康奈尔大学)

Sean Deyo

摘要:

我们提出了一个有向渗流反问题的二极管网络:给定的信息,哪些对节点允许电流从一个渗透到另一个,可以找到一个配置的二极管与所观察到的电流一致?我们实现了一个划分和并发迭代投影方法来解决这个问题,并证明了我们的方法的至高无上的非平凡的问题的情况下,一个详尽的方法。我们发现,当一些但不是所有的渗流数据被隐藏时,这个问题是最困难的,并且最难重建的网络通常是那些电流对添加或移除单个二极管最敏感的网络。

英文摘要:

We present a directed percolation inverse problem for diode networks: Given information about which pairs of nodes allow current to percolate from one to the other, can one find a configuration of diodes consistent with the observed currents? We implement a divide-and-concur iterative projection method for solving the problem and demonstrate the supremacy of our method over an exhaustive approach for nontrivial instances of the problem. We find that the problem is most difficult when some but not all of the percolation data are hidden, and that the most difficult networks to reconstruct generally are those for which the currents are most sensitive to the addition or removal of a single diode.

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

↑