159 research outputs found

    Driving sandpiles to criticality and beyond

    Get PDF
    A popular theory of self-organized criticality relates driven dissipative systems to systems with conservation. This theory predicts that the stationary density of the abelian sandpile model equals the threshold density of the fixed-energy sandpile. We refute this prediction for a wide variety of underlying graphs, including the square grid. Driven dissipative sandpiles continue to evolve even after reaching criticality. This result casts doubt on the validity of using fixed-energy sandpiles to explore the critical behavior of the abelian sandpile model at stationarity.Comment: v4 adds referenc

    Hurst's Rescaled Range Statistical Analysis for Pseudorandom Number Generators used in Physical Simulations

    Full text link
    The rescaled range statistical analysis (R/S) is proposed as a new method to detect correlations in pseudorandom number generators used in Monte Carlo simulations. In an extensive test it is demonstrated that the RS analysis provides a very sensitive method to reveal hidden long run and short run correlations. Several widely used and also some recently proposed pseudorandom number generators are subjected to this test. In many generators correlations are detected and quantified.Comment: 12 pages, 12 figures, 6 tables. Replaces previous version to correct citation [19

    The dimension of loop-erased random walk in 3D

    Full text link
    We measure the fractal dimension of loop-erased random walk (LERW) in 3 dimensions, and estimate that it is 1.62400 +- 0.00005. LERW is closely related to the uniform spanning tree and the abelian sandpile model. We simulated LERW on both the cubic and face-centered cubic lattices; the corrections to scaling are slightly smaller for the face-centered cubic lattice.Comment: 4 pages, 4 figures. v2 has more data, minor additional change

    Periodic orbits of the ensemble of Sinai-Arnold cat maps and pseudorandom number generation

    Full text link
    We propose methods for constructing high-quality pseudorandom number generators (RNGs) based on an ensemble of hyperbolic automorphisms of the unit two-dimensional torus (Sinai-Arnold map or cat map) while keeping a part of the information hidden. The single cat map provides the random properties expected from a good RNG and is hence an appropriate building block for an RNG, although unnecessary correlations are always present in practice. We show that introducing hidden variables and introducing rotation in the RNG output, accompanied with the proper initialization, dramatically suppress these correlations. We analyze the mechanisms of the single-cat-map correlations analytically and show how to diminish them. We generalize the Percival-Vivaldi theory in the case of the ensemble of maps, find the period of the proposed RNG analytically, and also analyze its properties. We present efficient practical realizations for the RNGs and check our predictions numerically. We also test our RNGs using the known stringent batteries of statistical tests and find that the statistical properties of our best generators are not worse than those of other best modern generators.Comment: 18 pages, 3 figures, 9 table

    Algorithm for normal random numbers

    Full text link
    We propose a simple algorithm for generating normally distributed pseudo random numbers. The algorithm simulates N molecules that exchange energy among themselves following a simple stochastic rule. We prove that the system is ergodic, and that a Maxwell like distribution that may be used as a source of normally distributed random deviates follows when N tends to infinity. The algorithm passes various performance tests, including Monte Carlo simulation of a finite 2D Ising model using Wolff's algorithm. It only requires four simple lines of computer code, and is approximately ten times faster than the Box-Muller algorithm.Comment: 5 pages, 3 encapsulated Postscript Figures. Submitted to Phys.Rev.Letters. For related work, see http://pipe.unizar.es/~jf

    Fast Monte Carlo Simulation for Patient-specific CT/CBCT Imaging Dose Calculation

    Full text link
    Recently, X-ray imaging dose from computed tomography (CT) or cone beam CT (CBCT) scans has become a serious concern. Patient-specific imaging dose calculation has been proposed for the purpose of dose management. While Monte Carlo (MC) dose calculation can be quite accurate for this purpose, it suffers from low computational efficiency. In response to this problem, we have successfully developed a MC dose calculation package, gCTD, on GPU architecture under the NVIDIA CUDA platform for fast and accurate estimation of the x-ray imaging dose received by a patient during a CT or CBCT scan. Techniques have been developed particularly for the GPU architecture to achieve high computational efficiency. Dose calculations using CBCT scanning geometry in a homogeneous water phantom and a heterogeneous Zubal head phantom have shown good agreement between gCTD and EGSnrc, indicating the accuracy of our code. In terms of improved efficiency, it is found that gCTD attains a speed-up of ~400 times in the homogeneous water phantom and ~76.6 times in the Zubal phantom compared to EGSnrc. As for absolute computation time, imaging dose calculation for the Zubal phantom can be accomplished in ~17 sec with the average relative standard deviation of 0.4%. Though our gCTD code has been developed and tested in the context of CBCT scans, with simple modification of geometry it can be used for assessing imaging dose in CT scans as well.Comment: 18 pages, 7 figures, and 1 tabl

    Rate-Based Daily Arrival Process Models with Application to Call Centers

    Full text link

    Cluster Hybrid Monte Carlo Simulation Algorithms

    Full text link
    We show that addition of Metropolis single spin-flips to the Wolff cluster flipping Monte Carlo procedure leads to a dramatic {\bf increase} in performance for the spin-1/2 Ising model. We also show that adding Wolff cluster flipping to the Metropolis or heat bath algorithms in systems where just cluster flipping is not immediately obvious (such as the spin-3/2 Ising model) can substantially {\bf reduce} the statistical errors of the simulations. A further advantage of these methods is that systematic errors introduced by the use of imperfect random number generation may be largely healed by hybridizing single spin-flips with cluster flipping.Comment: 16 pages, 10 figure
    • …
    corecore