We propose a time-invariable, integrated model of wireless networks working in hostile environment with obstructions and other factors causing interference. We present a new probabilistic model wellâ€¦ (More)

Consider a random graph K(n,p) with n labeled vertices in which the edges are chosen independently and with a probability p. Let Tn(p) be the order of the largest induced tree in K(n, p). Among otherâ€¦ (More)

Let D(n, d) be a digraph chosen at random from a family of all d-out-regular digraphs on n points. Let K(n, p) be a simple graph on n points in which each edge appears independently with probabilityâ€¦ (More)

The algorithm by Bar-Yehuda, Goldreich and Itai is one of the best known randomized broadcast algorithms for radio networks. Its probability of success and time complexity are nearly optimal. Weâ€¦ (More)

A general model of a random digraph D(n,P) is considered. Based on a precise estimate of the asymptotic behaviour of the distribution function of the binomial law, a problem of the distribution ofâ€¦ (More)

Let us consider the probability space Ifi(n, p) consisting of all graphs on n labeled vertices where each edge occurs with probability p =1q, independently of all other edges . The aim of this noteâ€¦ (More)