相关论文: A unified scaling for the optimal path length in d…
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),…
We study the behavior of the optimal path between two sites separated by a distance $r$ on a $d$-dimensional lattice of linear size $L$ with weight assigned to each site. We focus on the strong disorder limit, i.e., when the weight of a…
We study the statistics of the optimal path in both random and scale free networks, where weights $w$ are taken from a general distribution $P(w)$. We find that different types of disorder lead to the same universal behavior. Specifically,…
By a new type of finite size scaling analysis on the square lattice, and by renormalization group calculations on hierarchical lattices we investigate the effects of dilution on optimal undirected self-avoiding paths in a random…
We apply the Dijkstra algorithm to generate optimal paths between two given sites on a lattice representing a disordered energy landscape. We study the geometrical and energetic scaling properties of the optimal path where the energies are…
We review results on the scaling of the optimal path length in random networks with weighted links or nodes. In strong disorder we find that the length of the optimal path increases dramatically compared to the known small world result for…
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…
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 study the optimal distance in networks, $\ell_{\scriptsize opt}$, defined as the length of the path minimizing the total weight, in the presence of disorder. Disorder is introduced by assigning random weights to the links or nodes. For…
We perform numerical simulations to study the optimal path problem on disordered hierarchical graphs with effective dimension d=2.32. Therein, edge energies are drawn from a disorder distribution that allows for positive and negative…
We propose a lattice model for Dirac fermions which allows us to break the degeneracy of the node structure. In the presence of a random gap we analyze the scaling behavior of the localization length as a function of the system width within…
We seek to augment a geometric network in the Euclidean plane with shortcuts to minimize its continuous diameter, i.e., the largest network distance between any two points on the augmented network. Unlike in the discrete setting where a…
Numerous problems of both theoretical and practical interest are related to finding shortest (or otherwise optimal) paths in networks, frequently in the presence of some obstacles or constraints. A somewhat related class of problems focuses…
The exact path length problem is to determine if there is a path of a given fixed cost between two vertices. This paper focuses on the exact path problem for costs $-1,0$ or $+1$ between all pairs of vertices in an edge-weighted digraph.…
A fundamental problem in network science is the normalization of the topological or physical distance between vertices, that requires understanding the range of variation of the unnormalized distances. Here we investigate the limits of the…
Many real networks are embedded in space, where in some of them the links length decay as a power law distribution with distance. Indications that such systems can be characterized by the concept of dimension were found recently. Here, we…
We analyze the statistics of the shortest and fastest paths on the road network between randomly sampled end points. To a good approximation, these optimal paths are found to be directed in that their lengths (at large scales) are linearly…
Disordered complex networks are of fundamental interest as stochastic models for information transmission over wireless networks. Well-known networks based on the Poisson point process model have limitations vis-a-vis network efficiency,…
To better understand the temporal characteristics and the lifetime of fluctuations in stochastic processes in networks, we investigated diffusive persistence in various graphs. Global diffusive persistence is defined as the fraction of…
We show that choosing appropriate distributions of the randomness, the search for optimal paths links diverse problems of disordered media like directed percolation, invasion percolation, directed and non-directed spanning polymers. We also…