We present an analysis of the topologies of a class of networks which are optimal in terms of the requirements of having as short a route as possible between any two nodes while yet keeping the congestion in the network as low as possible. Strikingly, we find a variety of distinct topologies and novel phase transitions between them on varying the number of links per node. Our results suggest th...

network environments always can be invaded by intruder agents. in networks where nodes are performing some computations, intruder agents might contaminate some nodes. therefore, problem of decontaminating a network infected by intruder agents is one of the major problems in these networks. in this paper, we present a distributed asynchronous local algorithm for decontaminating a network. in mos...

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . v

Bayesian networks are basic graphical models, used widely both in statistics and artificial intelligence. These statistical models of conditional independence structure are described by acyclic directed graphs whose nodes correspond to (random) variables in consideration. A quite important topic is the learning of Bayesian network structures, which is determining the best fitting statistical mo...

This paper describes and studies generalizations of the well known double ring network structures. Two classes of structures are studied, the N2R(p; q) and N2R(p; q; r) structures, of which the former is a special case of the well known Generalized Petersen Graphs. Basic properties of these structures are shown, indicating that they form a suitable base for future access network infrastructures...