in this article a graph theoretical approach is employed to study some specifications of dynamic systems with time delay in the inputs and states, such as structural controllability and observability. first, the zero and non-zero parameters of a proposed system have been determined, next the general structure of the system is presented by a graph which is constructed by non-zero parameters. the...

Exploring unknown environments is a fundamental task in many domains, e.g., robot navigation, network security, and internet search. We initiate the study of learning-augmented variant classical, notoriously hard online graph exploration problem by adding access to machine-learned predictions. propose an algorithm that naturally integrates predictions into well-known Nearest Neighbor (NN) signi...

In this paper, we apply the Turan sieve and simple developed by R. Murty first author to study problems in random graph theory. particular, obtain upper lower bounds on probability of a n vertices having diameter 2 (or 3 case bipartite graphs) with edge p(n) where edges are chosen independently . An interesting feature revealed these results is that `almost completely' complement each other. As...

Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 20 December 2020Accepted: 23 February 2021Published online: 04 November 2021Keywordsdeep neural networks, high-dimensionality, latent space, similarity, uncertainty quantification, intrinsic dimension, graph embedding at scaleAMS Subject Headings68T07, 05C62, 94A15, 68T37...