Related papers: Phase Diagram of Optimal Paths
Neural network methods are increasingly applied to solve phase transition problems, particularly in identifying critical points in non-equilibrium phase transitions, offering more convenience compared to traditional methods. In this paper,…
We consider the optimal paths in a $d$-dimensional lattice, where the bonds have isotropically correlated random weights. These paths can be interpreted as the ground state configuration of a simplified polymer model in a random potential.…
We propose an exact algorithm for solving the longest simple path problem between two given vertices in undirected weighted graphs. By using graph partitioning and dynamic programming, we obtain an algorithm that is significantly faster…
We study an ancient problem that in a static or dynamical system, sought an optimal path, which the context always means within an extremal condition. In fact, through those discussions about this theme, we established a universal essential…
We investigate the phase diagram of disordered copolymers at the interface between two selective solvents, and in particular its weak-coupling behavior, encoded in the slope $m_c$ of the critical line at the origin. In mathematical terms,…
We present a novel probabilistic approach for optimal path experimental design. In this approach a discrete path optimization problem is defined on a static navigation mesh, and trajectories are modeled as random variables governed by a…
We study the dynamical exponents $d_{w}$ and $d_{s}$ for a particle diffusing in a disordered medium (modeled by a percolation cluster), from the regime of extreme disorder (i.e., when the percolation cluster is a fractal at $p=p_{c}$) to…
We consider connectivity properties of certain i.i.d. random environments on $\Z^d$, where at each location some steps may not be available. Site percolation and oriented percolation can be viewed as special cases of the models we consider.…
We propose an optimal algorithm for solving the longest path problem in undirected weighted graphs. By using graph partitioning and dynamic programming, we obtain an algorithm that is significantly faster than other state-of-the-art…
We study the depinning phase transition of a directed polymer in a $d$-dimensional space by a periodic potential localized on a straight line. We give exact formulas in all dimensions for the critical pinning we need to localize the…
This paper introduces a graph-based, potential-guided method for path planning problems in unknown environments, where obstacles are unknown until the robots are in close proximity to the obstacle locations. Inspired by optimal transport…
We theoretically study the transport properties of self-propelled particles on complex structures, such as motor proteins on filament networks. A general master equation formalism is developed to investigate the persistent motion of…
We provide the exact solution of several variants of simple models of the zipping transition of two bound polymers, such as occurs in DNA/RNA, in two and three dimensions using pairs of directed lattice paths. In three dimensions the…
The probability distributions of the order parameter for two models in the directed percolation universality class were evaluated. Monte Carlo simulations have been performed for the one-dimensional generalized contact process and the…
We examine the evolution of the best choice algorithm and the probability of its success from a directed path to the linear order of the same cardinality through $k$th powers of a directed path, $1 \leq k < n$. The vertices of a $k$th power…
The statistics of equally weighted random paths (ideal polymer) is studied in $2$ and $3$ dimensional percolating clusters. This is equivalent to diffusion in the presence of a trapping environment. The number of $N$ step walks follows a…
In this paper, we consider directed polymers in random environment with long range jumps in discrete space and time. We extend to this case some techniques, results and classifications known in the usual short range case. However, some…
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the recent research on dynamic networks has only addressed the…
We introduce a model of percolation induced by disorder, where an initially homogeneous network with links of equal weight is disordered by the introduction of heterogeneous weights for the links. We consider a pair of nodes i and j to be…
We provide an introductory account of a tricritical phase diagram, in the setting of a mean-field random walk model of a polymer density transition, and clarify the nature of the density transition in this context. We consider a…