Related papers: A simple self-avoiding walking process as a reason…

We resolve difficulties in training and sampling from a discrete generative model by learning a smoothed energy function, sampling from the smoothed data manifold with Langevin Markov chain Monte Carlo (MCMC), and projecting back to the…

An important goal of self-assembly is to achieve a preprogrammed structure with high fidelity. Here, we control the valence of DNA-functionalized emulsions to make linear and branched model polymers, or `colloidomers'. The distribution of…

We study random walk with adaptive move strategies on a class of directed graphs with variable wiring diagram. The graphs are grown from the evolution rules compatible with the dynamics of the world-wide Web [Tadi\'c, Physica A {\bf 293},…

This article presents a new class of Pseudorandom Number Generators. The generators are based on traversing a n-cube where a Balanced Hamiltonian Cycle has been removed. The construction of such generators is automatic for small number of…

We analyze equilibrium properties and adsorption desorption phase transition behaviour of a linear semiflexible copolymer chain under constrained geometrical situation on square lattice in a good solvent. One dimensional stair shaped line…

We consider a process of noncolliding $q$-exchangeable random walks on $\mathbb{Z}$ making steps $0$ (straight) and $-1$ (down). A single random walk is called $q$-exchangeable if under an elementary transposition of the neighboring steps…

We consider random walks on discrete state spaces, such as general undirected graphs, where the random walkers are designed to approximate a target quantity over the network topology via sampling and neighborhood exploration in the form of…

A polymer-chain network is a collection of interconnected polymer-chains, made themselves of the repetition of a single pattern called a monomer. Our first main result establishes that, for a class of models for polymer-chain networks, the…

Proteinaceous aggregation occurs through self-assembly-- a process not entirely understood. In a recent article [1], an analytical theory for amyloid fibril growth via secondary rather than primary nucleation was presented. Remarkably, with…

We study self-avoiding walks on three-dimensional critical percolation clusters using a new exact enumeration method. It overcomes the exponential increase in computation time by exploiting the clusters' fractal nature. We enumerate walks…

A lattice model is presented for the simulation of dynamics in polymeric systems. Each polymer is represented as a chain of monomers, residing on a sequence of nearest-neighbor sites of a face-centered-cubic lattice. The polymers are self-…

Generic interactions e.g. the Coulomb or other long ranged radially symmetric repulsive interactions between monomers of bead-spring model of a semi-flexible polymer induce instabilities in a initially straight polymer chain to form long…

We consider the escape of a flexible, self-avoiding polymer chain out of a confined geometry. By means of simulations, we demonstrate that the translocation time can be described by a simple scaling law that exhibits a nonlinear dependence…

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 give a deterministic algorithm to construct a graph with no loops (a tree or a forest) whose vertices are the points of a d-dimensional stationary Poisson process S, subset of R^d. The algorithm is independent of the origin of…

We present a new Monte Carlo scheme for the efficient simulation of multi-polymer systems. The method permits chains to be inserted into the system using a biased growth technique. The growth proceeds via the use of a retractable feeler,…

We design a stochastic individual-based model structured in energy, for single species consuming an external resource, where populations are characterized by a typical energy at birth in $\mathbb{R}^{*}_{+}$. The resource is maintained at a…

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 enumeration, making the process thousands or millions of…

The statistics of self-avoiding random walks have been used to model polymer physics for decades. A self-avoiding walk that grows one step at a time on a lattice will eventually trap itself, which occurs after an average of 71 steps on a…

Self-avoiding random walks on graphs can be seen as walkers interacting with their own past history. This letter considers a complementary class of dynamics: Mutual future avoiding random walks (MFARWs), where stochastically driven walkers…