Depinning of a discrete elastic string from a random array of weak pinning points with finite dimensions (Q2380403)

The author develops a theory to compute the applied force required to drag an elastic string over a disordered planar distribution of weak pinning points with finite dimensions. In comparison to numerical simulations, the theoretical predictions are found accurate provided that the critical configuration remains close from a quasi-straight line. The strongest pinning is shown to correspond to a pinning on the denser lattice rows in which the size of the vacant site clusters is bounded in average. The maximum vacant site clusters correspond to the weakest defects in the denser row from which the critical depinning proceeds. The mean size of the critical vacant site clusters is determined through an expression involving only lattice dimensions and the overall planar obstacle density. Some numerical simulations demonstrate the accuracy of the theory for an obstacle density ranging from 1 to 50 percent and for different geometries.