Related papers: Shortest Path Distance in Manhattan Poisson Line C…
We present an analytical approach to calculating the distribution of shortest paths lengths (also called intervertex distances, or geodesic paths) between nodes in unweighted undirected networks. We obtain very accurate results for…
Study the general single-source shortest path problem. Firstly, define a path function on a set of some path with same source on a graph, and develop a kind of general single-source shortest path problem (GSSSP) on the defined path…
We consider long-range percolation in dimension $d\geq 1$, where distinct sites $x$ and $y$ are connected with probability $p_{x,y}\in[0,1]$. Assuming that $p_{x,y}$ is translation invariant and that $p_{x,y}=\|x-y\|^{-s+o(1)}$ with $s>2d$,…
Cooperation in cellular networks is a promising scheme to improve system performance. Existing works consider that a user dynamically chooses the stations that cooperate for his/her service, but such assumption often has practical…
We consider a change detection problem in which the arrival rate of a Poisson process changes suddenly at some unknown and unobservable disorder time. It is assumed that the prior distribution of the disorder time is known. The objective is…
Sampling all possible transition paths between two 3D states of a molecular system has various applications ranging from catalyst design to drug discovery. Current approaches to sample transition paths use Markov chain Monte Carlo and rely…
In the bidirected minimum Manhattan network problem, given a set T of n terminals in the plane, we need to construct a network N(T) of minimum total length with the property that the edges of N(T) are axis-parallel and oriented in a such a…
In Optimal Transport (OT) on a finite metric space, one defines a distance on the probability simplex that extends the distance on the ground space. The distance is the value of a Linear Programming (LP) problem on the set of…
The arrival of molecules in molecular communication via diffusion (MCvD) is a counting process, exhibiting by its nature binomial distribution. Even if the binomial process describes well the arrival of molecules, when considering…
Distance queries are a basic tool in data analysis. They are used for detection and localization of change for the purpose of anomaly detection, monitoring, or planning. Distance queries are particularly useful when data sets such as…
We give an algorithm that takes a directed graph $G$ undergoing $m$ edge insertions with lengths in $[1, W]$, and maintains $(1+\epsilon)$-approximate shortest path distances from a fixed source $s$ to all other vertices. The algorithm is…
Stochastic models for performance analysis, optimization and control of queues hinge on a multitude of alternatives for input point processes. In case of bursty traffic, one very popular model is the \textit{Markov Modulated Poisson…
In this paper, we apply the Stein's method in the context of point processes, namely when the target measure is the distribution of a finite Poisson point process. We show that the so-called Kantorovich-Rubinstein distance between such a…
In this work we study shortest path problems in multimode graphs, a generalization of the min-distance measure introduced by Abboud, Vassilevska W. and Wang in [SODA'16]. A multimode shortest path is the shortest path using one of multiple…
A simple transit model is described along with tests of this model against published results for 4 exoplanet systems (Kepler-1, 2, 8, and 77). Data from the Kepler mission are used. The Markov Chain Monte Carlo (MCMC) method is applied to…
In this paper we address two different related problems. We first study the problem of finding a simple shortest path in a $d$-dimensional real space subdivided in several polyhedra endowed with different $\ell_p$-norms. This problem is a…
Mobile parcel lockers have been recently proposed by logistics operators as a technology that could help reduce traffic congestion and operational costs in urban freight distribution. Given their ability to relocate throughout their area of…
This paper investigates the complexity of finding secluded paths in graphs. We focus on the \textsc{Short Secluded Path} problem and a natural new variant we introduce, \textsc{Shortest Secluded Path}. Formally, given an undirected graph…
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…
DC power flow approximations are ubiquitous in the electricity industry. However, these linear approximations fail to capture important physical aspects of power flow, such as the reactive power and voltage magnitude, which are crucial in…