We study the distribution of diameters of Erdős-Rényi random graphs with average connectivity . The diameter is the maximum among all the shortest distances between pairs of nodes in a graph and an important quantity for all dynamic processes taking place on graphs. Here we study the distribution numerically for various values of , in the nonpercolating and percolating regimes. Using large-deviation techniques, we are able to reach small probabilities like which allow us to obtain the distribution over basically the full range of the support, for graphs up to nodes. For values , our results are in good agreement with analytical results, proving the reliability of our numerical approach. For the distribution is more complex and no complete analytical results are available. For this parameter range, exhibits an inflection point, which we found to be related to a structural change of the graphs. For all values of , we determined the finite-size rate function and were able to extrapolate numerically to , indicating that the large-deviation principle holds.
We study the convex hull of the set of points visited by a two-dimensional random walker of discrete time steps. Two natural observables that characterize the convex hull in two dimensions are its perimeter and area . While the mean perimeter and the mean area have been studied before, analytically and numerically, and exact results are known for large (Brownian motion limit), little is known about the full distributions and . In this paper we provide numerical results for these distributions. We use a sophisticated large-deviation approach that allows us to study the distributions over a larger range of the support, where the probabilities and are as small as . We analyze (open) random walks as well as (closed) Brownian bridges on the two-dimensional discrete grid as well as in the two-dimensional plane. The resulting distributions exhibit, for large , a universal scaling behavior (independent of the details of the jump distributions) as a function of and , respectively. We are also able to obtain the rate function, describing rare events at the tails of these distributions, via a numerical extrapolation scheme and find a linear and square dependence as a function of the rescaled perimeter and the rescaled area, respectively.
The one-point distribution of the height for the continuum Kardar-Parisi-Zhang equation is determined numerically using the mapping to the directed polymer in a random potential at high temperature. Using an importance sampling approach, the distribution is obtained over a large range of values, down to a probability density as small as in the tails. The short-time behavior is investigated and compared with recent analytical predictions for the large-deviation forms of the probability of rare fluctuations, showing a spectacular agreement with the analytical expressions. The flat and stationary initial conditions are studied in the full space, together with the droplet initial condition in the half-space.
Atypically large fluctuations in macroscopic nonequilibrium systems continue to attract interest. Their probability can often be determined by the optimal fluctuation method (OFM). The OFM brings about a conditional variational problem, the solution of which describes the “optimal path” of the system which dominates the contribution of different stochastic paths to the desired statistics. The OFM proved efficient in evaluating the probabilities of rare events in a host of systems. However, theoretically predicted optimal paths were observed in stochastic simulations only in diffusive lattice gases, where the predicted optimal density patterns are either stationary, or travel with constant speed. Here we focus on the one-point height distribution of the paradigmatic Kardar-Parisi-Zhang interface. Here the optimal paths, corresponding to the distribution tails at short times, are intrinsically nonstationary and can be predicted analytically. Using the mapping to the directed polymer in a random potential at high temperature, we obtain “snapshots” of the optimal paths in Monte Carlo simulations which probe the tails with an importance sampling algorithm. For each tail we observe a very narrow “tube” of height profiles around a single optimal path which agrees with the analytical prediction. The agreement holds even at long times, supporting earlier assertions of the validity of the OFM in the tails well beyond the weak-noise limit.