Minimum Weight Random Graphs with Edge Constraints
Probability
2023-01-13 v1
Abstract
In this paper, we study two examples of minimum weight random graphs with edge constraints. First we consider the complete graph on vertices equipped with uniformly heavy edge weights and use iteration methods to obtain deviation estimates for the minimum weight of subtrees with a given number of edges. Next we analyze edge constrained minimum weight paths in the integer lattice and employ martingale difference techniques to describe the behaviour of the scaled minimum weight in terms of the edge constraint.
Cite
@article{arxiv.2301.04800,
title = {Minimum Weight Random Graphs with Edge Constraints},
author = {Ghurumuruhan Ganesan},
journal= {arXiv preprint arXiv:2301.04800},
year = {2023}
}
Comments
Accepted for presentation in International Conference on Recent Trends in Applied Mathematics (ICRTAM 2022), Loyola College and published in South East Asian Journal of Mathematics and Mathematical Sciences (SEAJMMS)