Abstract Community detection is a prominent research topic in Complex Network Analysis, and it constitutes an important field on all those areas where complex networks represent powerful interpretation tool for describing understanding systems involved neuroscience, biology, social science, economy, many others. A challenging approach to uncover the community structure network, then revealing i...

A random suffix search tree is a binary search tree constructed for the suffixes Xi = 0.BiBi+1Bi+2 . . . of a sequence B1, B2, B3., . . . of independent identically distributed random b-ary digits Bj . Let Dn denote the depth of the node for Xn in this tree when B1 is uniform on Zb. We show that for any value of b > 1, EDn = 2 log n + O(log log n), just as for the random binary search tree. We ...

We model in detail the distribution of Boolean functions implemented by random non-recursive programs, similar to linear genetic programming. Most functions are constants , the remainder are mostly simple. Bounds on how long programs need to be before the distribution of their functionality is close to its limiting distribution are provided in general and for average computers.

We consider random binary search trees when the input consists of a multiset, i.e. a set with multiple occurrences of equal elements, and prove that the randomized insertion and deletion algorithms produce random search trees regardless of multiplicities; even if all the elements are equal during the tree updates, a search tree will maintain its randomness. Thus, equal elements do not degenerat...