Related papers: Efficiency of the Incomplete Enumeration algorithm…
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 generalizations for the analogue {\it Amoeba} algorithm for…
The efficiency of a Markov chain Monte Carlo algorithm might be measured by the cost of generating one independent sample, or equivalently, the total cost divided by the effective sample size, defined in terms of the integrated…
We study the statistics of branching polymers with excluded-volume interactions, by modeling them as single self-avoiding trees on a generic regular periodic lattice with coordination number $q$. Each lattice site can be occupied at most by…
We begin the study of list-decodable linear regression using batches. In this setting only an $\alpha \in (0,1]$ fraction of the batches are genuine. Each genuine batch contains $\ge n$ i.i.d. samples from a common unknown distribution and…
Compact polymers are self-avoiding random walks which visit every site on a lattice. This polymer model is used widely for studying statistical problems inspired by protein folding. One difficulty with using compact polymers to perform…
We report the results of extensive Dynamic Monte Carlo simulations of systems of self-assembled Equilibrium Polymers without rings in good solvent. Confirming recent theoretical predictions, the mean-chain length is found to scale as $\Lav…
We present an algorithm that enumerates all the minimal triangulations of a graph in incremental polynomial time. Consequently, we get an algorithm for enumerating all the proper tree decompositions, in incremental polynomial time, where…
In this paper we give a detailed analysis of deterministic and randomized algorithms that enumerate any number of irreducible polynomials of degree $n$ over a finite field and their roots in the extension field in quasilinear where $N=n^2$…
We develop the hybrid Monte Carlo method for simulations of single off-lattice polymer chains. We discuss implementation and choice of simulation parameters in some detail. The performance of the algorithm is tested on models for…
Building on and from the work of Brydges and Imbrie, we give an elementary calculation of the volume of the space of branched polymers of order $n$ in the plane and in 3-space. Our development reveals some more general identities, and…
We present a new and general Monte Carlo iteration method for generalized ensembles. It consists of two elements: (1) a simple algorithm to distinguish between distributions arising from respectively equilibrium- and non-equilibrium…
We describe an embarrassingly parallel, anytime Monte Carlo method for likelihood-free models. The algorithm starts with the view that the stochasticity of the pseudo-samples generated by the simulator can be controlled externally by a…
This paper studies the problem of enumerating all maximal collinear subsets of size at least three in a given set of $n$ points. An algorithm for this problem, besides solving degeneracy testing and the exact fitting problem, can also help…
Complex scientific models where the likelihood cannot be evaluated present a challenge for statistical inference. Over the past two decades, a wide range of algorithms have been proposed for learning parameters in computationally feasible…
We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an $n\times n$ matrix over a finite field that requires $O(n^3)$ field operations and O(n) random vectors, and is well suited for successful practical…
Topologically constrained genome-like polymers often double-fold into tree-like configurations, which can be modelled on the level of folded (ring) polymers or on the level of the underlying random trees. For both descriptions, we have…
Motivated by renewed interest in the physics of branched polymers, we present here a complete characterization of the connectivity and spatial properties of $2$ and $3$-dimensional single-chain conformations of randomly branching polymers…
We study the statistics of meanders, i.e. configurations of a road crossing a river through "n" bridges, and possibly winding around the source, as a toy model for compact folding of polymers. We introduce a Monte-Carlo method which allows…
We discuss the complexity of path enumeration and counting in weighted temporal graphs. In a weighted temporal graph, each edge has an availability time, a traversal time and some real cost. We introduce two bicriteria temporal min-cost…
We perform a Monte Carlo study of $N$-step self-avoiding walks, attached to the corner of an impenetrable wedge in two dimensions ($d=2$), or the tip of an impenetrable cone in $d=3$, of sizes ranging up to $N=10^6$ steps. We find that the…