activity
20042009
most citedRandom hypergraphs and their applications

276 citations · 625 across the 4 of their papers we have counts for

collaborators

6 papers

physics.soc-ph2009276 cited

Random hypergraphs and their applications

Gourab Ghoshal, Vinko Zlatic, Guido Caldarelli +1

In the last few years we have witnessed the emergence, primarily in on-line communities, of new types of social networks that require for their representation more complex graph st…

physics.soc-ph200889 cited

On the rich-club effect in dense and weighted networks

Vinko Zlatic, Ginestra Bianconi, Albert Diaz-Guilera +3

For many complex networks present in nature only a single instance, usually of large size, is available. Any measurement made on this single instance cannot be repeated on differen…

cond-mat.stat-mech200758 cited

Reciprocity of Networks with Degree Correlations and Arbitrary Degree Sequences

Gorka Zamora--López, Vinko Zlatić, Changsong Zhou +2

Although most of the real networks contain a mixture of directed and bidirectional (reciprocal) connections, the reciprocity has received little attention as a subject of theor…

physics.soc-ph2006202 cited

Wikipedias: Collaborative web-based encyclopedias as complex networks

V. Zlatic, M. Bozicevic, H. Stefancic +1

Wikipedia is a popular web-based encyclopedia edited freely and collaboratively by its users. In this paper we present an analysis of Wikipedias in several languages as complex net…

cond-mat.dis-nn2004

"Winner takes it all": strongest node rule for evolution of scale free networks

H. Stefancic, V. Zlatic

We study a novel model for evolution of complex networks. We introduce information filtering for reduction of the number of available nodes to a randomly chosen sample, as stochast…

cond-mat.dis-nn2004

Preferential attachment with information filtering - node degree probability distribution properties

Hrvoje Stefancic, Vinko Zlatic

A network growth mechanism based on a two-step preferential rule is investigated as a model of network growth in which no global knowledge of the network is required. In the first…