autoScale. py is a program that performs an automatic finite-size scaling analysis for given
sets of simulated data. It implements a quite general scaling assumption and optimizes an …

We perform numerical simulations to study the optimal path problem on disordered
hierarchical graphs with effective dimension d eff≈ 2.32. Therein, edge energies are drawn …

By means of numerical simulations, we investigate the geometric properties of loops on
hypercubic lattice graphs in dimensions d= 2 through 7, where edge weights are drawn from …

We investigate both analytically and numerically the ensemble of minimum-weight loops in
the negative-weight percolation model on random graphs with fixed connectivity and …

We study numerically the geometrical properties of minimally weighted paths that appear in
the minimally weighted path (MWP) model on two-dimensional lattices assuming a …

By means of numerical simulations we investigate the configurational properties of densely
and fully packed configurations of loops in the negative-weight percolation (NWP) model. In …

We consider the negative weight percolation (NWP) problem on hypercubic lattice graphs
with fully periodic boundary conditions in all relevant dimensions from d= 2 to the upper …

The main characteristics of biased greedy random walks (BGRWs) on two-dimensional
lattices with real-valued quenched disorder on the lattice edges are studied. Here the …

We consider the negative-weight percolation model on directed graphs. In particular, we
study the model on a two-dimensional, weighted, periodic, centered square lattice. Bond …

We consider the negative weight percolation (NWP) problem on hypercubic lattice graphs
with fully periodic boundary condi-tions in all relevant dimensions from d= 2 to the upper …