Related papers: Optimal paths on the road network as directed poly…
We study the probability that two directed polymers in the same random potential do not intersect. We use the replica method to map the problem onto the attractive Lieb-Liniger model with generalized statistics between particles. We obtain…
We consider a directed graph on the 2-dimensional integer lattice, placing a directed edge from vertex $(i_1,i_2)$ to $(j_1,j_2)$, whenever $i_1 \le j_1$, $i_2 \le j_2$, with probability $p$, independently for each such pair of vertices.…
Many major cities suffer from severe traffic congestion. Road expansion in the cites is usually infeasible, and an alternative way to alleviate traffic congestion is to coordinate the route of vehicles. Various path selection and planning…
It is a well-known open problem in the literature on random polymers to show that a directed polymer in random environment localizes around a favorite path at low temperature. A precise statement of this conjecture is formulated and proved…
We study the distribution of optimal path lengths in random graphs with random weights associated with each link (``disorder''). With each link $i$ we associate a weight $\tau_i = \exp(ar_i)$ where $r_i$ is a random number taken from a…
The distribution of monomers along a linear polymer grafted on a hard wall is modelled by determining the probability distribution of occupied vertices of Dyck and ballot path models of adsorbing linear polymers. For example, the…
In a network, the shortest paths between nodes are of great importance as they allow the fastest and strongest interaction between nodes. However measuring the shortest paths between all nodes in a large network is computationally…
Optimal transportation distances are valuable for comparing and analyzing probability distributions, but larger-scale computational techniques for the theoretically favorable quadratic case are limited to smooth domains or regularized…
We study the directed polymer model for general graphs (beyond $\mathbb Z^d$) and random walks. We provide sufficient conditions for the existence or non-existence of a weak disorder phase, of an $L^2$ region, and of very strong disorder,…
Consider directed polymers in a random environment on the complete graph of size $N$. This model can be formulated as a product of i.i.d. $N\times N$ random matrices and its large time asymptotics is captured by Lyapunov exponents and the…
We investigate the behaviour of the shortest path on a directed two-dimensional square lattice for bond percolation at the critical probability $p_c$ . We observe that flipping an edge lying on the shortest path has a non-local effect in…
Optimal path planning is prone to convergence to local, rather than global, optima. This is often the case for mobile manipulators due to nonconvexities induced by obstacles, robot kinematics and constraints. This paper focuses on planning…
Consider the short-time probability distribution $\mathcal{P}(H,t)$ of the one-point interface height difference $h(x=0,\tau=t)-h(x=0,\tau=0)=H$ of the stationary interface $h(x,\tau)$ described by the Kardar-Parisi-Zhang equation. It was…
The design of efficient transportation networks is an important challenge in many research areas. Among the most promising recent methods, biological routing mimic local rules found in nature. However comparisons with other methods are…
We study analytically and numerically the winding of directed polymers of length $t$ around each other or around a rod. Unconfined polymers in pure media have exponentially decaying winding angle distributions, the decay constant depending…
In this work we are concerned with the crossover between strong disorder (SD) and weak disorder (WD) behaviors in three well-known problems that involve minimal paths: directed polymers (directed paths with fixed starting point and length),…
Computer experiments are performed to investigate why protein contact networks (networks induced by spatial contacts between amino acid residues of a protein) do not have shorter average shortest path lengths in spite of their importance to…
Shortest paths are not always simple. In planar networks, they can be very different from those with the smallest number of turns - the simplest paths. The statistical comparison of the lengths of the shortest and simplest paths provides a…
A simple and accurate relationship is demonstrated that links the average shortest path, nodes, and edges in a complex network. This relationship takes advantage of the concept of link density and shows a large improvement in fitting…
Importance sampling of trajectories has proved a uniquely successful strategy for exploring rare dynamical behaviors of complex systems in an unbiased way. Carrying out this sampling, however, requires an ability to propose changes to…