Related papers: Shortest path and Schramm-Loewner Evolution
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…
The Shortest Path Reconfiguration problem has as input a graph G (with unit edge lengths) with vertices s and t, and two shortest st-paths P and Q. The question is whether there exists a sequence of shortest st-paths that starts with P and…
Decoder-only transformers lead to a step-change in capability of large language models. However, opinions are mixed as to whether they are really planning or reasoning. A path to making progress in this direction is to study the model's…
We simulate several models of random curves in the half plane and numerically compute their stochastic driving process (as given by the Loewner equation). Our models include models whose scaling limit is the Schramm-Loewner evolution (SLE)…
We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a…
In this note, we prove a version of the conjectured duality of Schramm-Loewner Evolutions, by establishing exact identities in distribution between some boundary arcs of chordal $\SLE_\kappa$, $\kappa>4$, and appropriate versions of…
It was recently claimed that on d-dimensional small-world networks with a density p of shortcuts, the typical separation s(p) ~ p^{-1/d} between shortcut-ends is a characteristic length for shortest-paths{cond-mat/9904419}. This contradicts…
We consider the Schramm-Loewner evolution (SLE$_\kappa$) for $\kappa \in (4,8)$, which is the regime where the curve is self-intersecting but not space-filling. We show that there exists $\delta_0>0$ such that for $\kappa \in (8 -…
Shortest path computation is a fundamental problem in road networks. However, in many real-world scenarios, determining solely the shortest path is not enough. In this paper, we study the problem of finding k-Dissimilar Paths with Minimum…
We consider the problem of a particle traveling from an initial configuration to a final configuration (given by a point in the plane along with a prescribed velocity vector) in minimum time with non-homogeneous velocity and with…
Fractal structure of shortest paths depends strongly on interresidue interaction cutoff distance. The dimensionality of shortest paths is calculated as a function of interaction cutoff distance. Shortest paths are self similar with a…
In this paper, we study some properties of optimal paths in the first passage percolation on $\Z^d$ and show the followings: (1) the number of optimal paths has an exponential growth if the distribution has an atom; (2) the means of…
Given a directed acyclic graph with positive edge-weights, two vertices s and t, and a threshold-weight L, we present a fully-polynomial time approximation-scheme for the problem of counting the s-t paths of length at most L. We extend the…
Due to the computational complexity of finding almost shortest simple paths, we propose that identifying a larger collection of (nonbacktracking) paths is more efficient than finding almost shortest simple paths on positively weighted…
This paper proves conjectures originating in the physics literature regarding the intersection exponents of Brownian motion in a half-plane. For instance, suppose that B and B' are two independent planar Brownian motions started from…
SLE_k stochastic processes describe growth of random curves which, in some cases, may be identified with boundaries of two dimensional critical percolating clusters. By generalizing SLE_k growths to formal Markov processes on the central…
Cheeger's fundamental inequality states that any edge-weighted graph has a vertex subset $S$ such that its expansion (a.k.a. conductance) is bounded as follows: \[ \phi(S) \defeq \frac{w(S,\bar{S})}{\min \set{w(S), w(\bar{S})}} \leq…
We study the problem of finding a small sparse cut in an undirected graph. Given an undirected graph G=(V,E) and a parameter k <= |E|, the small sparsest cut problem is to find a subset of vertices S with minimum conductance among all sets…
Using the estimate of the difference between the discrete harmonic function and its corresponding continuous version we derive a rate of convergence of the Loewner driving function for the harmonic explorer to the Brownian motion with speed…
In line with Pomeau's conjecture about the relevance of directed percolation (DP) to turbulence onset/decay in wall-bounded flows, we propose a minimal stochastic model dedicated to the interpretation of the spatially intermittent regimes…