646 citations · 1.2k across the 19 of their papers we have counts for
19 papers
Weighted degrees and truncated derived bibliographic networks
Vladimir Batagelj
Large bibliographic networks are sparse -- the average node degree is small. This is not necessarily true for their product -- in some cases, it can ``explode'' (it is not sparse,…
On weighted two-mode network projections
Vladimir Batagelj
The standard and fractional projections are extended from binary two-mode networks to weighted two-mode networks. Some interesting properties of the extended projections are proved…
Exactly mergeable summaries
Vladimir Batagelj
In the analysis of large/big data sets, aggregation (replacing values of a variable over a group by a single value) is a standard way of reducing the size (complexity) of the data.…
Cores in multiway networks
Vladimir Batagelj
The notion of a core is generalized to multiway networks. To determine the multiway cores, we adapted already-known algorithms for determining the generalized cores in one-mode and…
Corrected overlap weight and clustering coefficient
Vladimir Batagelj
We discuss two well known network measures: the overlap weight of an edge and the clustering coefficient of a node. For both of them it turns out that they are not very useful for…
Temporal Bibliographic Networks
Vladimir Batagelj, Daria Maltseva
We present two ways (instantaneous and cumulative) to transform bibliographic networks, using the works' publication year, into corresponding temporal networks based on temporal qu…
On Fractional Approach to Analysis of Linked Networks
Vladimir Batagelj
In this paper, we present the outer product decomposition of a product of compatible linked networks. It provides a foundation for the fractional approach in network analysis. We d…
Social Network Analysis: Bibliographic Network Analysis of the Field and its Evolution / Part 1. Basic Statistics and Citation Network Analysis
Daria Maltseva, Vladimir Batagelj
In this paper, we present the results of the study on the development of social network analysis (SNA) discipline and its evolution over time, using the analysis of bibliographic n…
Semirings for temporal network analysis
Selena Praprotnik, Vladimir Batagelj
In the article, we describe a new algebraic approach to the temporal network analysis based on the notion of temporal quantities. We define the semiring for computing the foremost…
Clustering of Modal Valued Symbolic Data
Vladimir Batagelj, Nataša Kejžar, Simona Korenjak-Černe
Symbolic Data Analysis is based on special descriptions of data - symbolic objects (SO). Such descriptions preserve more detailed information about units and their clusters than th…
Generalized Two-mode Cores
Monika Cerinšek, Vladimir Batagelj
The node set of a two-mode network consists of two disjoint subsets and all its links are linking these two subsets. The links can be weighted. We developed a new method for identi…
An algebraic approach to temporal network analysis based on temporal quantities
Vladimir Batagelj, Selena Praprotnik
In a temporal network, the presence and activity of nodes and links can change through time. To describe temporal networks we introduce the notion of temporal quantities. We define…
Network analysis of Zentralblatt MATH data
Monika Cerinšek, Vladimir Batagelj
We analyze the data about works (papers, books) from the time period 1990-2010 that are collected in Zentralblatt MATH database. The data were converted into four 2-mode networks (…
On bibliographic networks
Vladimir Batagelj, Monika Cerinšek
In the paper we show that the bibliographic data can be transformed into a collection of compatible networks. Using network multiplication different interesting derived networks ca…
Probabilistic Inductive Classes of Graphs
Nataša Kejžar, Zoran Nikoloski, Vladimir Batagelj
Models of complex networks are generally defined as graph stochastic processes in which edges and vertices are added or deleted over time to simulate the evolution of networks. Her…
An O(m) Algorithm for Cores Decomposition of Networks
V. Batagelj, M. Zaversnik
The structure of large networks can be revealed by partitioning them to smaller parts, which are easier to handle. One of such decompositions is based on --cores, proposed in 19…
Efficient Algorithms for Citation Network Analysis
Vladimir Batagelj
In the paper very efficient, linear in number of arcs, algorithms for determining Hummon and Doreian's arc weights SPLC and SPNP in citation network are proposed, and some theoreti…
Short Cycles Connectivity
V. Batagelj, M. Zaversnik
Short cycles connectivity is a generalization of ordinary connectivity. Instead by a path (sequence of edges), two vertices have to be connected by a sequence of short cycles, in w…
Generalized Cores
V. Batagelj, M. Zaveršnik
Cores are, besides connectivity components, one among few concepts that provides us with efficient decompositions of large graphs and networks. In the paper a generalization of the…