In this paper, we study Dirac-type theorems for an inhomogenous random graph \(G\) whose edge probabilities are not necessarily all the same. We obtain sufficient conditions for the existence of Hamiltonian paths and perfect matchings, in terms of the sum of edge probabilities. For edge probability assignments with two-sided bounds, we use Pósa rotation and single vertex exclusion techniques to show that \(G\) is Hamiltonian with high probability. For weaker one-sided bounds, we use bootstrapping techniques to obtain a perfect matching in \(G,\) with high probability. We also highlight an application of our results in the context of channel assignment problem in wireless networks.
