Constrained Maximum Weight Paths in Random Geometric Graphs

Ghurumuruhan Ganesan

Home/Archive/arXiv

arXiv · 2608.08532

Constrained Maximum Weight Paths in Random Geometric Graphs

Ghurumuruhan Ganesan

View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we consider a random geometric graph (RGG)~$G$ formed by~$n$ vertices distributed uniformly in the unit square~$S$ on the plane and equip each edge of~$G$ with an independent weight. We assume that the adjacency distance between vertices is larger than the connectivity threshold and estimate the maximum weight of a path connecting two fixed points~$O_1$ and~$O_2$ in~$S,$ using edges of~$G$ that satisfy length and weight constraints. Our strategy is to first divide the space between~$O_1$ and~$O_2$ into small squares and identify nice squares containing heavy edges. We then use an iterative stitching procedure to connect these heavy edges and estimate the weight of the resulting path~$P.$ Finally, we invoke a multi-level scaling procedure along with weight segmentation to establish an upper bound for the maximum weight of \emph{any} path between~$O_1$ and~$O_2$ and thereby demonstrate the near-optimality of~$P.$ We also illustrate our results using examples involving edge weights satisfying power law and exponential decay.

Explore related subjects

math.PR

Keep this discovery

BibTeX RIS

Ghurumuruhan Ganesan. 2026-08-09. Constrained Maximum Weight Paths in Random Geometric Graphs. https://arxiv.org/abs/2608.08532

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR↗

arXiv2026

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR↗

arXiv2026

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR↗