activity
20112025
most citedExact enumeration of self-avoiding walks

79 citations · 165 across the 9 of their papers we have counts for

collaborators

9 papers

physics.flu-dyn2025★ 4 cited

Python-JAX-based Fast Stokesian Dynamics

Kim William Torre, Raoul D. Schram, Joost de Graaf

Stokesian Dynamics (SD) is a powerful computational framework for simulating the motion of particles in a viscous Newtonian fluid under Stokes-flow conditions. Traditional SD imple…

physics.soc-ph2021★ 8 cited

Hidden dependence of spreading vulnerability on topological complexity

Mark M. Dekker, Raoul D. Schram, Jiamin Ou +1

Many dynamical phenomena in complex systems concern spreading that plays out on top of networks with changing architecture over time -- commonly known as temporal networks. A compl…

cond-mat.soft2019★ 29 cited

Local loop opening in untangled ring polymer melts: A detailed "Feynman test" of models for the large scale structure

Raoul D. Schram, Angelo Rosa, Ralf Everaers

The conformational statistics of ring polymers in melts or dense solutions is strongly affected by their quenched microscopic topological state. The effect is particularly strong f…

cond-mat.stat-mech2017★ 17 cited

Exact enumeration of self-avoiding walks on BCC and FCC lattices

Raoul D. Schram, Gerard T. Barkema, Rob H. Bisseling +1

Self-avoiding walks on the body-centered-cubic (BCC) and face-centered-cubic (FCC) lattices are enumerated up to lengths 28 and 24, respectively, using the length-doubling method.…

cond-mat.stat-mech2013★ 1 cited

Universality of the triplet contact process with diffusion

Raoul D. Schram, Gerard T. Barkema

The one-dimensional triplet contact process with diffusion (TCPD) model has been studied using fast multispin GPU Monte Carlo simulations. In particular, the particle density ρand…

physics.comp-ph2013★ 5 cited

Reaction-diffusion model Monte Carlo simulations on the GPU

R. D. Schram

We created an efficient algorithm suitable for graphics processing units (GPUs) to perform Monte Carlo simulations of a subset of reaction-diffusion models. The algorithm uses tech…

cond-mat.stat-mech2012★ 13 cited

SAWdoubler: a program for counting self-avoiding walks

Raoul D. Schram, Gerard T. Barkema, Rob H. Bisseling

This article presents SAWdoubler, a package for counting the total number Z(N) of self-avoiding walks (SAWs) on a regular lattice by the length-doubling method, of which the basic…

cond-mat.stat-mech2012★ 9 cited

Critical exponents of the pair contact process with diffusion

R. D. Schram, G. T. Barkema

We study the pair contact process with diffusion (PCPD) using Monte Carlo simulations, and concentrate on the decay of the particle density with time, near its critical point,…

math-ph2011★ 79 cited

Exact enumeration of self-avoiding walks

Raoul D. Schram, Gerard T. Barkema, Rob H. Bisseling

A prototypical problem on which techniques for exact enumeration are tested and compared is the enumeration of self-avoiding walks. Here, we show an advance in the methodology of e…