We study the evolution of Slovenia’s scientific collaboration network from 1960 till present with a yearly resolution. For each year the network was constructed from publication records of Slovene scientists, whereby two were connected if, up to the given year inclusive, they have coauthored at least one paper together. Starting with no more than 30 scientists with an average of 1.5 collaborato...

An unsupervised competitive learning algorithm based on the classical -means clustering algorithm is proposed. The proposed learning algorithm called the centroid neural network (CNN) estimates centroids of the related cluster groups in training date. This paper also explains algorithmic relationships among the CNN and some of the conventional unsupervised competitive learning algorithms includ...

A wide variety of complex networks (social, biological, information etc.) exhibit local clustering with substantial variation in the clustering coefficient (the probability of neighbors being connected). Existing models of large graphs capture power law degree distributions (BarabásiAlbert) and small-world properties (Watts-Strogatz), but only limited clustering behavior. We introduce a general...

The main aim of this study is twofold: first, to examine the underlying structure of coauthorship in Indian economics; and second, to explore the link between the participation in scientific collaborations and academic visibility. We decipher the structure of co-authorship by presenting collaboration networks of scholars who published articles in six Indian economics journals during 1966-2005, ...

Recent studies have shown that a system composed from several randomly interdependent networks is extremely vulnerable to random failure. However, real interdependent networks are usually not randomly interdependent, rather a pair of dependent nodes are coupled according to some regularity which we coin inter-similarity. For example, we study a system composed from an interdependent world wide ...

In this article, we investigate the structure of Croatian linguistic co-occurrence networks. We examine the change of network structure properties by systematically varying the co-occurrence window sizes, the corpus sizes and removing stopwords. In a cooccurrence window of size n we establish a link between the current word and n − 1 subsequent words. The results point out that the increase of ...

A key issue in complex systems regards the relationship between topology and dynamics. In this work, we use a recently introduced network property known as steering coefficient as a means to approach this issue with respect to different directed complex network systems under varying dynamics. Theoretical and real-world networks are considered, and the influences of reciprocity and average degre...

We introduce a model for a preferentially attached network which has grown from a small world network. Here, the average path length and the clustering coefficient are estimated, and the topological properties of modeled networks are compared as the initial conditions are changed. As a result, it is shown that the topological properties of the initial network remain even after the network growt...

In this paper, we define and study two new classes of analytic functions which generalize a number of classes studied earlier. Sharp coefficient bound and some inclusion results are discussed. We also observe that these classes are preserved under the Bernadi integral transform. 2000 mathematics subject classification: 30C45 • 30C50

The extraction of social groups from social networks existing among employees in the company, its customers or users of various computer systems became one of the research areas of growing importance. Once we have discovered the groups, we can utilise them, in different kinds of recommender systems or in the analysis of the team structure and communication within a given population. The shortco...