# Solving a directed percolation inverse problem

arXiv: https://arxiv.org/abs/2201.12222 · HTML: https://mlsanity.com/paper/2201.12222/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 2 of its 26 references that are in the map.
- First posted on arXiv 28 Jan 2022.

## Builds on (most cited first, 2 of 2)

- [The Douglas-Rachford Algorithm for Convex and Nonconvex Feasibility Problems](https://mlsanity.com/paper/1904.09148/) (2019)
- [A high-performance analog Max-SAT solver and its application to Ramsey numbers](https://mlsanity.com/paper/1801.06620/) (2018)

## Abstract (arXiv)

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.