Solving a directed percolation inverse problem

Abstract

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.

References in corpus (5)

• Directed percolation criticality in turbulent liquid crystals
• Optimization hardness as transient chaos in an analog approach to constraint satisfaction
• Divide and concur: A general approach to constraint satisfaction
• From one-way streets to percolation on random mixed graphs
• Reconstructing cellular automata rules from observations at nonconsecutive times