Related papers: Traveling in randomly embedded random graphs
We consider the number of edge crossings in a random graph drawing generated by projecting a random geometric graph on some compact convex set $W\subset \mathbb{R}^d$, $d\geq 3$, onto a plane. The positions of these crossings form the…
We derive a functional central limit theorem for the excursion of a random walk conditioned on sweeping a prescribed geometric area. We assume that the increments of the random walk are integer-valued, centered, with a third moment equal to…
$t$-spanners are used to approximate the pairwise distances between a set of points in a metric space. They have only a few edges compared to the total number of pairs and they provide a $t$-approximation on the distance of any two…
We revisit an old minor topic in algorithms, the deterministic walk on a finite graph which always moves toward the nearest unvisited vertex until every vertex is visited. There is an elementary connection between this cover time and…
We initiate the study of a fundamental combinatorial problem: Given a capacitated graph $G=(V,E)$, find a shortest walk ("route") from a source $s\in V$ to a destination $t\in V$ that includes all vertices specified by a set…
Let a random geometric graph be defined in the supercritical regime for the existence of a unique infinite connected component in Euclidean space. Consider the first-passage percolation model with independent and identically distributed…
Graphs with bounded highway dimension were introduced by Abraham et al. [SODA 2010] as a model of transportation networks. We show that any such graph can be embedded into a distribution over bounded treewidth graphs with arbitrarily small…
In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least distortion for Hamming graphs, Johnson graphs, and all strongly regular…
In this article, we study special points of a simple random walk and a Gaussian free field, such as (nearly) favorite points, late points and high points. In section $2$, we extend results of [19] and suggest open problems for $d=2$. In…
In this report, the explicit probability density functions of the random Euclidean distances associated with regular hexagons are given, when the two endpoints of a link are randomly distributed in the same hexagon, and two adjacent…
We develop an asymptotic approximation and bounds for the traveling salesman problem with time slots, i.e. when the time windows of points to visit are a partition of a given time horizon. Although this problem is relevant in several…
There have been extensive studies of a random walk among a field of immobile traps (or obstacles), where one is interested in the probability of survival as well as the law of the random walk conditioned on its survival up to time $t$. In…
We experimentally demonstrate that the statistical properties of distances between pedestrians which are hindered from avoiding each other are described by the Gaussian Unitary Ensemble of random matrices. The same result has recently been…
A random motion on the Poincar\'e half-plane is studied. A particle runs on the geodesic lines changing direction at Poisson-paced times. The hyperbolic distance is analyzed, also in the case where returns to the starting point are…
We revisit the classic task of finding the shortest tour of $n$ points in $d$-dimensional Euclidean space, for any fixed constant $d \geq 2$. We determine the optimal dependence on $\varepsilon$ in the running time of an algorithm that…
We study the escape probability problem in random walks over graphs. Given vertices, $s,t,$ and $p$, the problem asks for the probability that a random walk starting at $s$ will hit $t$ before hitting $p$. Such probabilities can be…
In this case study, the renowned Travelling Salesmen problem has been studied. Travelling Salesman problem is a most demanding computational problem in Computer Science. The Travelling Salesmen problem has been solved by two different ways…
Analyzing the mixing time of random walks is a well-studied problem with applications in random sampling and more recently in graph partitioning. In this work, we present new analysis of random walks and evolving sets using more…
This paper proposes a mathematical justification of the phenomenon of extreme congestion at a very limited number of nodes in very large networks. It is argued that this phenomenon occurs as a combination of the negative curvature property…
Place an obstacle with probability $1-p$ independently at each vertex of $\mathbb Z^d$, and run a simple random walk until hitting one of the obstacles. For $d\geq 2$ and $p$ strictly above the critical threshold for site percolation, we…