Related papers: A simple self-avoiding walking process as a reason…
We study the diffusion of a linear polymer in the presence of permeable membranes without excluded volume interactions, using scaling theory and Monte Carlo simulations. We find that the average time it takes for a chain with polymerization…
This paper introduces nondeterministic walks, a new variant of one-dimensional discrete walks. The main difference to classical walks is that its nondeterministic steps consist of sets of steps from a predefined set such that all possible…
Topological gapless phases of matter have been a recent interest among theoretical and experimental condensed matter physicists. Fermionic chains with extended nearest neighbor couplings have been observed to show unique topological…
Polymer-like structures are ubiquitous in nature and synthetic materials. Their configurational and migration properties are often affected by crowded environments leading to non-thermal fluctuations. Here, we study an ideal Rouse chain in…
We consider the persistent exclusion process in which a set of persistent random walkers interact via hard-core exclusion on a hypercubic lattice in $d$ dimensions. We work within the ballistic regime whereby particles continue to hop in…
Dynamic systems characterized by diversified evolutions are not only more flexible, but also more resilient to attacks, failures and changing conditions. This article addresses the quantification of the diversity of non-linear transient…
We explain a unified approach to a study of ballistic phase for a large family of self-interacting random walks with a drift and self-interacting polymers with an external stretching force. The approach is based on a recent version of the…
We describe a new algorithm for the enumeration of self-avoiding walks on the square lattice. Using up to 128 processors on a HP Alpha server cluster we have enumerated the number of self-avoiding walks on the square lattice to length 71.…
Herein, we describe new methods to produce colloidal particle chains of three stiffness regimes that can be observed on a single-particle level, that is, on the level of the monomers that make up the chain; the chains can even be observed…
We present Monte Carlo simulations of semidilute solutions of long self-attracting chain polymers near their Ising type critical point. The polymers are modeled as monodisperse self-avoiding walks on the simple cubic lattice with attraction…
Conformation-dependent design of polymer sequences can be considered as a tool to control macromolecular self-assembly. We consider the monomer unit sequences created via the modification of polymers in a homogeneous melt in accordance with…
We formulate a framework for discrete-time quantum walks, motivated by classical random walks with memory. We present a specific representation of the classical walk with memory 2 on which this is based. The framework has no need for coin…
Self-avoiding walks are studied on the 3-simplex fractal lattice as a model of linear polymer conformations in a dilute, non-homogeneous solution. A model is supplemented with bending energies and attractive-interaction energies between…
The model of self-avoiding lattice walks and the asymptotic analysis of power-series have been two of the major research themes of Tony Guttmann. In this paper we bring the two together and perform a new analysis of the generating functions…
Designing efficient traffic lanes for pedestrians is a critical aspect of urban planning as walking remains the most common form of mobility among the increasingly diverse methods of transportation. Herein, we investigate pedestrian counter…
Prudent walks are special self-avoiding walks that never take a step towards an already occupied site, and \emph{$k$-sided prudent walks} (with $k=1,2,3,4$) are, in essence, only allowed to grow along $k$ directions. Prudent polygons are…
We propose a random walks based model to generate complex networks. Many authors studied and developed different methods and tools to analyze complex networks by random walk processes. Just to cite a few, random walks have been adopted to…
Several kinds of walks on complex networks are currently used to analyze search and navigation in different systems. Many analytical and computational results are known for random walks on such networks. Self-avoiding walks (SAWs) are…
We consider a new model of a branching random walk on a multidimensional lattice with continuous time and one source of particle reproduction and death, as well as an infinite number of sources in which, in addition to the walk, only…
We address the enumeration of walks with small steps confined to a two-dimensional cone, for example the quarter plane, three-quarter plane or the slit plane. In the quarter plane case, the solutions for unweighted step-sets are already…