Related papers: Modeling Shortest Paths in Polymeric Networks usin…
Random walks are the simplest way to explore or search a graph, and have revealed a very useful tool to investigate and characterize the structural properties of complex networks from the real world, e.g. they have been used to identify the…
Minimising the longest travel distance for a group of mobile robots with interchangeable goals requires knowledge of the shortest length paths between all robots and goal destinations. Determining the exact length of the shortest paths in…
Polymer translocation across a corrugated channel is a paradigmatic stochastic process encountered in diverse systems. The instance of time when a polymer first arrives to some prescribed location defines an important characteristic time…
An underlying structure in several sampling-based methods for continuous multi-robot motion planning (MRMP) is the tensor roadmap (TR), which emerges from combining multiple PRM graphs constructed for the individual robots via a tensor…
Background: This study is mainly motivated by the need of understanding how the diffusion behaviour of a biomolecule (or even of a larger object) is affected by other moving macromolecules, organelles, and so on, inside a living cell,…
We introduce a general framework, applicable to a broad class of random walks on networks, that quantifies the response of the mean first-passage time to a target node to a local perturbation of the network, both in the context of attacks…
Given a large graph, how can we determine similarity between nodes in a fast and accurate way? Random walk with restart (RWR) is a popular measure for this purpose and has been exploited in numerous data mining applications including…
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…
A fundamental problem in wireless networks is the \emph{minimum spanning tree} (MST) problem: given a set $V$ of wireless nodes, compute a spanning tree $T$, so that the total cost of $T$ is minimized. In recent years, there has been a lot…
In this paper, we present a new approach to the Kratky-Porod Model (KP) of semiflexible polymers. Our solution to the model is based on the definition of a generating function which we use to study the statistical mechanics of semiflexible…
We study a symmetric random walk (RW) in one spatial dimension in environment, formed by several zones of finite width, where the probability of transition between two neighboring points and corresponding diffusion coefficient are…
We initiate the study of a fundamental combinatorial problem: Given a capacitated graph $G=(V,E)$, find a shortest walk ("route") from a source $s\in V$ to a destination $t\in V$ that includes all vertices specified by a set…
Continuous Time Random Walk(CTRW) is a model where particle's jumps in space are coupled with waiting times before each jump. A Continuous Time Random Walk Limit(CTRWL) is obtained by a limit procedure on a CTRW and can be used to model…
We describe a distributed randomized algorithm computing approximate distances and routes that approximate shortest paths. Let n denote the number of nodes in the graph, and let HD denote the hop diameter of the graph, i.e., the diameter of…
Network growth models that embody principles such as preferential attachment and local attachment rules have received much attention over the last decade. Among various approaches, random walks have been leveraged to capture such…
Given a spatio-temporal network (ST network) where edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of minimum spanning trees of the ST network, where each tree is associated with a time…
We consider the continuous time random walk model (CTRW) of tracer's motion in porous medium flows based on the experimentally determined distributions of pore velocity and pore size reported in Holzner et al. Phys. Rev. E 92, 013015…
An analytical soluble model based on a Continuous Time Random Walk (CTRW) scheme for the adsorption-desorption processes at interfaces, called bulk-mediated surface diffusion, is presented. The time evolution of the effective probability…
Based on a recent simulation study [Masubuchi et al., Macromolecules, 56, 9359 (2023)], the cycle rank plays a significant role in determining the fracture characteristics of network polymers. However, the study only considered…
The transport of solvent molecules through soft, swollen networks is critical in both natural and engineered systems. While this poroelastic flow has traditionally been explored in networks where the mesh size is comparable to the solvent…