activity
20162026
most citedCritical Exponent for the Acyclic Chromatic Number of Random Graphs

1 citations · 5 across the 42 of their papers we have counts for

collaborators

59 papers

cs.LG2026

Criticality in Dissimilar Decomposition and Undersampling of Random Datasets with Anomalies

Ghurumuruhan Ganesan

Training datasets for upcoming LLMs would include a significant amount of AI text/image data generated from current LLMs. In such a scenario, it is important to understand how this…

math.PR2026

Extremal Spanning Trees of Random Marked Graphs with Independent Edge Weights

Ghurumuruhan Ganesan

In this paper, we consider a Bernoulli random graph~\(G\) on~\(n\) vertices with non-uniform edge probabilities, where each vertex has an independent mark and each edge is equipped…

math.PR2026

Constrained Maximum Weight Paths in Random Geometric Graphs

Ghurumuruhan Ganesan

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\) wi…

math.PR2026

Maximum Spanning Trees of Random Geometric Graphs With Independent Edge Weights

Ghurumuruhan Ganesan

In this paper, we study maximum weight spanning trees of the random geometric graph (RGG)~\(G\) formed by~\(n\) vertices where each edge is independently either open or closed with…

math.PR2025

Deviation Estimates for Extremal Relay Random Geometric Graphs

Ghurumuruhan Ganesan

In this paper, we consider a deterministic graph~\(Γ\) drawn on the unit square with straight line segments as edges and connect vertices of~\(Γ\) using edges of a random geometric…

math.PR2025

Extremal Planar Matchings of Inhomogenous Random Bipartite Graphs

Ghurumuruhan Ganesan

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 e…