Abstract
In this paper, we consider a one-dimensional random geometric graph process with the inter-nodal gaps evolving according to an exponential first order autoregressive (AR(1)) process. The transition probability matrix and stationary distribution are derived for the Markov chains in terms of network connectivity and the number of components. We characterize an algorithm for the hitting time regarding disconnectivity. In addition, we also study static topological properties including connectivity, degree distributions and the largest nearest neighbor distance associated with the random graph process. Both closed form results and limit theorems are provided.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
