2025/04/09 by Ghurumuruhan Ganesan, Ganesan, Ghurumuruhan
Computer Science · Mathematics · #Cooperative Communication and Network Coding #Mobile Ad Hoc Networks #Stochastic processes and statistical mechanics
paper · pdf · doi:10.48550/arxiv.2504.06999
In this paper we study maximum size and minimum weight planar matchings of inhomogenous random bipartite graphs. Our motivation for this study comes from efficient usage of cross edges in relay networks for overall improvement in network performance. We first consider Bernoulli planar matchings with a constraint on the edge length and obtain deviation estimates for the maximum size of a planar matching. We then equip each edge of the complete bipartite graph with a positive random weight and obtain bounds on the minimum weight of a planar matching containing a given number of edges. We also use segmentation and martingale methods to obtain~\(L2-\)convergence of the minimum weight, appropriately scaled and centred.