Social Network Development using Graph Model in PRI System

The review of current research emphasizes three strands of literature on social networks. The first strand composed of endogenous network models, which highlights the sensitive dependence of the topology on parameters of the behavioural models employed. The second strand draws from the recent econophysics literature reviewing the recent revival of interest in the random graph theory and also allowing a mathematical tool to study social networks. The review explores a number of examples to assess the potential of recent research on random graphs with arbitrary degree distributions. The third strand focuses on a specific model of social networks where random graphs with different dependent edges are present, if edges are incident to the same node, and independent, otherwise. Besides, this paper introduces a new graph model helping to design the interconnected model to connect blocks and gram panchayats in Panchayati Raj Institution (PRI) system at ease and in turn helping in further progress in computer science. In practice, this model is appearing quiet beneficial in network establishment and strongly capable of handling small number of blocks strictly avoiding loss of data resources. The empirical study reveals that this unique dynamic model keeps all the units strongly interconnected. Thus, the present paper is attempting to analyse the benefits of the network structure models and concludes with an assessment of observable consequences of optimising behaviour in networks for the purpose of estimation.