Related papers: Coherent modeling of double-folded ring polymers a…
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…
Random Forest is an ensemble of decision trees based on the bagging and random subspace concepts. As suggested by Breiman, the strength of unstable learners and the diversity among them are the ensemble models' core strength. In this paper,…
We show how a Monte Carlo method for generating self-avoiding walks on lattice geometries which employs a binary-tree data structure can be adapted for hard-sphere polymers with continuous degrees of freedom. Data suggests that the time per…
We investigate by means of a number of different dynamical Monte Carlo simulation methods the self-assembly of equilibrium polymers in dilute, semidilute and concentrated solutions under good-solvent conditions. In our simulations, both…
In the first part of this work a summary is provided of some recent experiments and theoretical results which are relevant in the research of systems of polymer rings in nontrivial topological conformations. Next, some advances in modeling…
We introduce a novel interpretable tree based algorithm for prediction in a regression setting. Our motivation is to estimate the unknown regression function from a functional decomposition perspective in which the functional components…
When trained on language data, do transformers learn some arbitrary computation that utilizes the full capacity of the architecture or do they learn a simpler, tree-like computation, hypothesized to underlie compositional meaning systems…
Genomic evolution can be viewed as string-editing processes driven by mutations. An understanding of the statistical properties resulting from these mutation processes is of value in a variety of tasks related to biological sequence data,…
We present a new simulation scheme which allows an efficient sampling of reconfigurable supramolecular structures made of polymeric constructs functionalized by reactive binding sites. The algorithm is based on the configurational bias…
In this work a new strategy is proposed in order to build analytic and microscopic models of fluctuating polymer rings subjected to topological constraints. The topological invariants used to fix these constraints belong to a wide class of…
Polymers with active segments constitute prospective future materials and are used as a model for some biological systems such as chromatin. The directions of the active forces are typically introduced with temporal or spatial correlations…
Defining the energy function as the negative logarithm of the density, we explore the energy landscape of a distribution via the tree of sublevel sets of its energy. This tree represents the hierarchy among the connected components of the…
Recombining trinomial trees are a workhorse for modeling discrete-event systems in option pricing, logistics, and feedback control. Because each node stores a state-dependent quantity, a depth-$D$ tree naively yields $\mathcal{O}(3^{D})$…
Tree ensembles, such as random forests and boosted trees, are renowned for their high prediction performance. However, their interpretability is critically limited due to the enormous complexity. In this study, we present a method to make a…
While Flory theories provide an extremely useful framework for understanding the behavior of interacting, randomly branching polymers, the approach is inherently limited. Here we use a combination of scaling arguments and computer…
The induction of additional randomness in parallel and sequential ensemble methods has proven to be worthwhile in many aspects. In this manuscript, we propose and examine a novel random tree depth injection approach suitable for sequential…
Connected acyclic graphs (trees) are data objects that hierarchically organize categories. Collections of trees arise in a diverse variety of fields, including evolutionary biology, public health, machine learning, social sciences and…
Combinatorial trees can be used to represent genealogies of asexual individuals. These individuals can be endowed with birth and death times, to obtain a so-called `chronological tree'. In this work, we are interested in the continuum…
Industrial robots can solve very complex tasks in controlled environments, but modern applications require robots able to operate in unpredictable surroundings as well. An increasingly popular reactive policy architecture in robotics is…
Neural manifolds summarize the intrinsic structure of the information encoded by a population of neurons. Advances in experimental techniques have made simultaneous recordings from multiple brain regions increasingly commonplace, raising…