相关论文: The Critical Radius in Sampling-based Motion Plann…

Calculating the diameter of an undirected graph requires quadratic running time under the Strong Exponential Time Hypothesis and this barrier works even against any approximation better than 3/2. For planar graphs with positive edge…

We introduce a new class of objectives for optimal transport computations of datasets in high-dimensional Euclidean spaces. The new objectives are parametrized by $\rho \geq 1$, and provide a metric space $\mathcal{R}_{\rho}(\cdot, \cdot)$…

The radius and diameter are fundamental graph parameters. They are defined as the minimum and maximum of the eccentricities in a graph, respectively, where the eccentricity of a vertex is the largest distance from the vertex to another…

We analyze the Nystr\"om approximation of a positive definite kernel associated with a probability measure. We first prove an improved error bound for the conventional Nystr\"om approximation with i.i.d. sampling and singular-value…

The radial probability measures on $R^p$ are in a one-to-one correspondence with probability measures on $[0,\infty[$ by taking images of measures w.r.t. the Euclidean norm mapping. For fixed $\nu\in M^1([0,\infty[)$ and each dimension p,…

Let C_n be the origin-containing cluster in subcritical percolation on the lattice (1/n) Z^d, viewed as a random variable in the space Omega of compact, connected, origin-containing subsets of R^d, endowed with the Hausdorff metric delta.…

The vacant set of random interlacements on ${\mathbb{Z}}^d$, $d\ge3$, has nontrivial percolative properties. It is known from Sznitman [Ann. Math. 171 (2010) 2039--2087], Sidoravicius and Sznitman [Comm. Pure Appl. Math. 62 (2009) 831--858]…

Let $T(n)$ denote the maximum number of unit distances that a set of $n$ points in the Euclidean plane $\mathbb{R}^2$ can determine with the additional condition that the distinct unit length directions determined by the configuration must…

Sampling based methods are widely used for robotic motion planning. Traditionally, these samples are drawn from probabilistic ( or deterministic ) distributions to cover the state space uniformly. Despite being probabilistically complete,…

\cite{HillMotegi2017} present a new general asymptotic theory for the maximum of a random array $\{\mathcal{X}_{n}(i)$ $:$ $1$ $\leq $ $i$ $\leq $ $\mathcal{L}\}_{n\geq 1}$, where each $\mathcal{X}_{n}(i)$ is assumed to converge in…

We prove the main conjecture from [M. R. Douglas, B. Shiffman and S. Zelditch, Critical points and supersymmetric vacua, II: Asymptotics and extremal metrics. J. Differential Geom. 72 (2006), no. 3, 381-427] concerning the metric dependence…

We study the asymptotic diameter of the preferential attachment model $\operatorname{PA}\!_n^{(m,\delta)}$ with parameters $m \ge 2$ and $\delta > 0$. Building on the recent work \cite{VZ25}, we prove that the diameter of $G_n \sim…

We consider the ``modified Minimal Analytic'' (mMA) coupling that involves an infrared cut to the standard MA coupling. The mMA coupling is a Stieltjes function and, as a consequence, the paradiagonal Pade approximants converge to the…

Sampling based probabilistic roadmap planners (PRM) have been successful in motion planning of robots with higher degrees of freedom, but may fail to capture the connectivity of the configuration space in scenarios with a critical narrow…

Of all the distance and temporal measures in cosmology, the angular-diameter distance, d_A(z), uniquely reaches a maximum value at some finite redshift z_max and then decreases to zero towards the big bang. This effect has been difficult to…

One major open conjecture in the area of critical random graphs, formulated by statistical physicists, and supported by a large amount of numerical evidence over the last decade [23, 24, 28, 63] is as follows: for a wide array of random…

We study the contact process with stirring on $\mathbb{Z}^d$. In this process, particles occupy vertices of $\mathbb{Z}^d$; each particle dies with rate 1 and generates a new particle at a randomly chosen neighboring vertex with rate…

Random graph models with limited choice have been studied extensively with the goal of understanding the mechanism of the emergence of the giant component. One of the standard models are the Achlioptas random graph processes on a fixed set…

Uncertain dynamic obstacles, such as pedestrians or vehicles, pose a major challenge for optimal robot navigation with safety guarantees. Previous work on motion planning has followed two main strategies to provide a safe bound on an…

We provide non-asymptotic $L^1$ bounds to the normal for four well-known models in statistical physics and particle systems in $\mathbb{Z}^d$; the ferromagnetic nearest-neighbor Ising model, the supercritical bond percolation model, the…