In this paper we derive entropy bounds for hierarchical networks. More precisely, starting from a recently introduced measure to determine the topological entropy of non-hierarchical networks, we provide bounds for estimating the entropy of hierarchical graphs. Apart from bounds to estimate the entropy of a single hierarchical graph, we see that the derived bounds can also be used for character...

Many methods for inferring genetic networks have been proposed, but the regulations they infer often include false-positives. Several researchers have attempted to reduce these erroneous regulations by proposing the use of a priori knowledge about the properties of genetic networks such as their sparseness, scale-free structure, and so on. This study focuses on another piece of a priori knowled...

The distribution of motifs in random hierarchical networks defined by nonsymmetric random block–hierarchical adjacency matrices, is constructed for the first time. According to the classification of U. Alon et al of network superfamilies [11] by their motifs distributions, our artificial directed random hierarchical networks falls into the superfamily of natural networks to which the class of n...

Increases in incidents involving so-called confused persons have brought attention to the potential costs of recent changes to public mental health (PMH) services in the Netherlands. Decentralized under the (Community) Participation Act (2014), local governments must find resources to compensate for reduced central funding to such services or “innovate.” But innovation, even when pressure for c...