most citedAmoeba Monte Carlo algorithms for random trees with controlled branching activity: efficient trial move generation and universal dynamics

6 citations · 9 across the 3 of their papers we have counts for

collaborators
Showing cond-mat.softShow all

2 papers · 1 filter

cond-mat.soft2025★ 1 cited

Configurational entropy of randomly double-folding ring polymers

Pieter H. W. van der Hoek, Angelo Rosa, Elham Ghobadpour +1

Topologically constrained genome-like polymers often double-fold into tree-like configurations. Here we calculate the exact number of tightly double-folded configurations available…

cond-mat.soft2024★ 6 cited

Amoeba Monte Carlo algorithms for random trees with controlled branching activity: efficient trial move generation and universal dynamics

Pieter H. W. van der Hoek, Angelo Rosa, Ralf Everaers

The reptation Monte Carlo algorithm is a simple, physically motivated and efficient method for equilibrating semi-dilute solutions of linear polymers. Here we propose two simple ge…