By using biclique partitions of digraphs, this paper gives reduction formulas for the number oriented spanning trees, stationary distribution vector and Kemeny's constant digraphs. As applications, we give a method enumerating trees undirected graphs by vertex degrees partitions. The partition formula also extends results Knuth Levine from line digraphs to general

We give necessary and sufficient conditions for the existence of a phantom distribution function stationary random field on regular lattice. also introduce less demanding notion directional distribution, with potentially broader area applicability. Such approach leads to sectorial limit properties, phenomenon well-known in theorems fields. An example Gaussian is provided showing that two notion...

A time-frequency distribution provides many advantages in the analysis of multicomponent nonstationary signals. The simultaneous signal representation with respect to the time and frequency axis defines the signal amplitude, frequency, bandwidth, and the number of components at each time moment. The Rényi entropy, applied to a time-frequency distribution, is shown to be a valuable indicator of ...

Key predistribution is a popular technique for key distribution in sensor networks. The schemes available in current literature using this approach are for nodes with no or limited mobility. In this paper we present two key predistribution based scheme for heterogeneous networks i.e. networks which consist of nodes which are stationary as well as highly mobile. The existing schemes make use of ...