Related papers: Shortest paths on systems with power-law distribut…
For r=6,7,...,11 we find an elliptic curve E/Q of rank at least r and the smallest conductor known, improving on the previous records by factors ranging from 1.0136 (for r=6) to over 100 (for r=10 and r=11). We describe our search methods,…
We provide Monte Carlo estimates of the scaling of the length $L_{n}$ of the longest increasing subsequences of $n$-steps random walks for several different distributions of step lengths, short and heavy-tailed. Our simulations indicate…
Stochastic shortest path (SSP) is a well-known problem in planning and control, in which an agent has to reach a goal state in minimum total expected cost. In the learning formulation of the problem, the agent is unaware of the environment…
This paper develops a theoretical framework for Extreme Partial Least Squares (EPLS) dimension reduction in the presence of missing data and weak temporal dependence. Building upon the recent EPLS methodology for modeling extremal…
In this work, we follow the current trend on temporal graph realization, where one is given a property P and the goal is to determine whether there is a temporal graph, that is, a graph where the edge set changes over time, with property P…
$\ell_1$ optimization is a well known heuristic often employed for solving various forms of sparse linear problems. In this paper we look at its a variant that we refer to as the \emph{partial} $\ell_1$ and discuss its mathematical…
The co-evolution between network structure and functional performance is a fundamental and challenging problem whose complexity emerges from the intrinsic interdependent nature of structure and function. Within this context, we investigate…
Let $G=(V,E)$ be an $n$-nodes non-negatively real-weighted undirected graph. In this paper we show how to enrich a {\em single-source shortest-path tree} (SPT) of $G$ with a \emph{sparse} set of \emph{auxiliary} edges selected from $E$, in…
We consider the parametric shortest paths problem in a linearly interpolated graph. Given two positively-weighted directed graphs $G_0=(V,E,\omega_0)$ and $G_1=(V,E,\omega_1),$ the linearly interpolated graph is the family of graphs…
Let $G\sim G(n,p)$ be a (hidden) Erd\H{o}s-R\'enyi random graph with $p=(1+ \varepsilon)/n$ for some fixed constant $ \varepsilon >0$. Ferber, Krivelevich, Sudakov, and Vieira showed that to reveal a path of length…
In the context of first-passage percolation (FPP), we investigate the statistical properties of the selected link-times (SLTs) -the random link times comprising the optimal paths (or geodesics) connecting two given points. We focus on…
We find that the probability distribution for the largest intervals $p(l)$ exhibits universal properties for different systems including random walk and random cutting models. In particular, $p(l)$ has an infinite set of singularities at…
Probabilistic analysis for metric optimization problems has mostly been conducted on random Euclidean instances, but little is known about metric instances drawn from distributions other than the Euclidean. This motivates our study of…
The resistivity minima of the quantum Hall effect arise due to the localization of the electron states at the Fermi energy, when it is positioned between adjacent Landau levels. In this paper we calculate the localization length $\xi$ of…
We present a scaling hypothesis for the distribution function of the shortest paths connecting any two points on a percolating cluster which accounts for {\it (i)} the effect of the finite size of the system, and {\it (ii)} the dependence…
For a graph $G$ and $p\in [0,1]$, let $G_p$ arise from $G$ by deleting every edge mutually independently with probability $1-p$. The random graph model $(K_n)_p$ is certainly the most investigated random graph model and also known as the…
We introduce a model of self-repelling random walks where the short-range interaction between two elements of the chain decreases as a power of the difference in proper time. Analytic results on the exponent $\nu$ are obtained. They are in…
In many application areas we are faced with the following question: Can we recover a sparse vector $x_o \in \mathbb{R}^N$ from its undersampled set of noisy observations $y \in \mathbb{R}^n$, $y=A x_o+w$. The last decade has witnessed a…
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…
For a connected graph $G = (V, E)$ and $s, t \in V$, a non-separating $s$-$t$ path is a path $P$ between $s$ and $t$ such that the set of vertices of $P$ does not separate $G$, that is, $G - V(P)$ is connected. An $s$-$t$ path is…