论文标题
解决定向的渗透反问题
Solving a directed percolation inverse problem
论文作者
论文摘要
我们提出了二极管网络的定向渗透反问题：给定的信息，有关哪种节点允许电流从一个到另一个到另一个节点，是否可以找到与观察到的电流一致的二极管的配置？我们实施了一种分裂和共同的迭代投影方法来解决该问题，并证明了我们方法的至高无上的问题，而不是详尽的问题实例。我们发现，当某些但并非所有渗透数据都隐藏时，问题最困难，而重建最困难的网络通常是电流对添加或去除单个二极管最敏感的网络。
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.
