Related papers: Predicting Optimal Lengths of Random Knots
We study the properties of discrete-time random walks on networks formed by randomly interconnected cliques, namely, random networks of cliques. Our purpose is to derive the parameters that define the network structure -- specifically, the…
We consider dynamic random walks where the nearest neighbour jump rates are determined by an underlying supercritical contact process in equilibrium. This has previously been studied by den Hollander and dos Santos and den Hollander, dos…
Several interesting approaches have been reported in the literature on complex networks, random walks, and hierarchy of graphs. While many of these works perform random walks on stable, fixed networks, in the present work we address the…
Network control refers to a very large and diverse set of problems including controllability of linear time-invariant dynamical systems, where the objective is to select an appropriate input to steer the network to a desired state. There…
The viscous flow of polymer chains in dense melts is dominated by topological constraints whenever the single chain contour length, N, becomes larger than the characteristic scale Ne, defining comprehensively the macroscopic rheological…
We apply the power-of-two-choices paradigm to a random walk on a graph: rather than moving to a uniform random neighbour at each step, a controller is allowed to choose from two independent uniform random neighbours. We prove that this…
We consider a random $N$-step polymer under the influence of an attractive interaction with the origin and derive a limit law -- after suitable shifting and norming -- for the length of the longest excursion towards the Gumbel distribution.…
We present a computer simulation study of the compact self-avoiding loops as regards their length and topological state. We use a Hamiltonian closed path on the cubic-shaped segment of a 3D cubic lattice as a model of a compact polymer. The…
The exact mean time between encounters of a given particle in a system consisting of many particles undergoing random walks in discrete time is calculated, on both regular and complex networks. Analytical results are obtained both for…
Complex numbers define the relationship between entities in many situations. A canonical example would be the off-diagonal terms in a Hamiltonian matrix in quantum physics. Recent years have seen an increasing interest to extend the tools…
We consider the dynamical properties of Quantum Walks defined on the d-dimensional cubic lattice, or the homogeneous tree of coordination number 2d, with site dependent random phases, further characterised by transition probabilities…
We observed the conformation of threads that free released from different altitudes. We also explore the effect of wetting liquid on the conformation developed. When released from an altitude, the thread conformation changes when free…
We consider a random walk on top of the contact process on $\mathbb{Z}^d$ with $d\geq 1$. In particular, we focus on the "contact process as seen from the random walk". Under the assumption that the infection rate of the contact process is…
The ropelength of a knot is the minimum length required to tie it. Computational upper bounds have previously been computed for every prime knot with up to 11 crossings. Here, we present ropelength measurements for the 2176 knots with 12…
In this work we investigate the dynamics of random walk processes on scale-free networks in a short to moderate time scale. We perform extensive simulations for the calculation of the mean squared displacement, the network coverage and the…
Single linear polymer chains in dilute solutions under good solvent conditions are studied by Monte Carlo simulations with the pruned-enriched Rosenbluth method up to the chain length $N \sim {\cal O}(10^4)$. Based on the standard simple…
In a wide range of complex networks, the links between the nodes are temporal and may sporadically appear and disappear. This temporality is fundamental to analyze the formation of paths within such networks. Moreover, the presence of the…
Many natural and artificial networks evolve in time. Nodes and connections appear and disappear at various timescales, and their dynamics has profound consequences for any processes in which they are involved. The first empirical analysis…
Distribution of loops in a one-dimensional random walk (RW), or, equivalently, neutral segments in a sequence of positive and negative charges is important for understanding the low energy states of randomly charged polymers. We investigate…
We consider a walker that at each step keeps the same direction with a probabilitythat depends on the time already spent in the direction the walker is currently moving. In this paper, we study some asymptotic properties of this persistent…