scientific article; zbMATH DE number 3088537
From MaRDI portal
Publication:5827372
zbMath0055.36901MaRDI QIDQ5827372
J. M. Hammersley, K. W. Morton
Publication date: 1954
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Critical two-point functions and the lace expansion for spread-out high-dimensional percolation and related models. ⋮ Spatial mixing and the connective constant: optimal bounds ⋮ Sequential Monte Carlo sampling in hidden Markov models of nonlinear dynamical systems ⋮ Monte Carlo Approximation of Bayes Factors via Mixing With Surrogate Distributions ⋮ Unnamed Item ⋮ Allgemeiner Bericht über Monte-Carlo-Methoden ⋮ Lattice star and acyclic branched polymer vertex exponents in 3d ⋮ Self-avoiding walks and trees in spread-out lattices ⋮ A Survey of Sequential Monte Carlo Methods for Economics and Finance ⋮ Mixed site-bond percolation in Archimedean \((3,12^2)\) lattices ⋮ Generalized disconnection exponents ⋮ Importance sampling imputation algorithms in quantile regression with their application in CGSS data ⋮ Connective constants and height functions for Cayley graphs ⋮ Self-avoiding walks and amenability ⋮ Fast Randomized Iteration: Diffusion Monte Carlo through the Lens of Numerical Linear Algebra ⋮ Estimating random effects in a finite Markov chain with absorbing states: Application to cognitive data ⋮ The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. ⋮ Weighted self-avoiding walks ⋮ A technique for the estimation of percolation thresholds in lattice systems: application to a problem of granular flow through an orifice ⋮ Location of the adsorption transition for lattice polymers ⋮ Ensemble preconditioning for Markov chain Monte Carlo simulation ⋮ Three theorems in discrete random geometry ⋮ A short history of Markov chain Monte Carlo: Subjective recollections from incomplete data ⋮ Without-replacement sampling for particle methods on finite state spaces ⋮ Unnamed Item ⋮ Polygons pulled from an adsorbing surface ⋮ Stochastic Filtering Methods in Electronic Trading ⋮ Shifted critical threshold in the loop \(O(n)\) model at arbitrarily small \(n\) ⋮ Self-avoiding walks and polymer adsorption: low temperature behaviour ⋮ Strongly correlated random interacting processes. Abstracts from the workshop held January 28 -- February 3, 2018 ⋮ Self-Avoiding Walks and Connective Constants ⋮ Efficient rare-event simulation for the maximum of heavy-tailed random walks ⋮ The entropic pressure of a lattice polygon ⋮ The entropic pressure of lattice knots ⋮ New scaling laws for self-avoiding walks: bridges and worms ⋮ Editorial: rare-event simulation for queues ⋮ The Hammersley-Welsh bound for self-avoiding walk revisited ⋮ Decay of correlations in nearest-neighbor self-avoiding walk, percolation, lattice trees and animals ⋮ Counting elements and geodesics in Thompson's group \(F\). ⋮ New lower bounds on the self-avoiding-walk connective constant ⋮ Cubic graphs and the golden mean ⋮ Self-avoiding walk on nonunimodular transitive graphs ⋮ Controlling procedural modeling programs with stochastically-ordered sequential Monte Carlo ⋮ Locality of connective constants ⋮ The jigsaw puzzle of sequence phenotype inference: piecing together Shannon entropy, importance sampling, and empirical Bayes ⋮ Harry Kesten's work in probability theory ⋮ A Modified Monte-Carlo Quadrature. II ⋮ Scaling limit of ballistic self-avoiding walk interacting with spatial random permutations ⋮ Percolation in quantum computation and ⋮ A statistical approach to estimate state variables in flow-accelerated corrosion problems ⋮ Random copolymers ⋮ Adsorption of lattice polymers with quenched topologies ⋮ A pattern theorem for lattice clusters ⋮ A note on mean-field behavior for self-avoiding walk on branching planes. ⋮ On the existence of critical exponents for self-avoiding walks ⋮ Self-avoiding walks
