Vladimir Batagelj
Biographic Data
| ID | 633215 |
|---|---|
| NAME | Vladimir Batagelj |
| GIVEN NAMES | Vladimir |
| FAMILY NAME | Batagelj |
| SIGNATURE | BATAGELJ V |
| AFFILIATIONS | University of Ljubljana |
| ORCID | 0000-0002-0240-9446 |
| VERIFIED | Yes |
| TOTAL WORKS | 35 |
| TOTAL CITATIONS | 37 |
| AUTHOR COUNT | 35 |
| EDITOR COUNT | 0 |
| FIRST PUBLICATION YEAR | 1992 |
| LATEST PUBLICATION YEAR | 2026 |
| H-INDEX | 4 |
Mapping core collaboration structures in research universities
Bridging borders or widening gaps? The dynamics of European scientific collaboration networks
The study explores a dynamic co-authorship network among European countries between 1990 and 2023 that arose from an interplay of geographical, linguistic, and historical factors which influenced the scientific collaboration. In the analysis, bibliometric data from OpenAlex are used in Indirect Blockmodeling (IB) and Dynamic Stochastic Blockmodeling (DSBM) to examine patterns in three critical periods: rise of the Internet (1994–2003), enlargemen…
On weighted two-mode network projections
Weighted degrees and truncated derived bibliographic networks
Cores in multiway networks
Scientific collaboration of post-Soviet countries
Collaboration between authors in the field of social network analysis
Analysis of the Southern women network using fractional approach
Journals publishing social network analysis
Towards a systematic description of the field using keywords analysis
IMetrics
On fractional approach to analysis of linked networks
An algebraic approach to temporal network analysis based on temporal quantities
Generalized two-mode cores
A weighted clustering of population pyramids for the world's countries, 1996, 2001, 2006
This paper presents clusters of the world's countries obtained by a novel weighted clustering method. The approach is based on data representations with symbolic descriptions of age-sex structures. To obtain clusters with similar descriptions, a weighted clustering method is used which is suitable for data described with discrete distributions. In contrast to the classical approach, this method allows the population of each sex to be included in …
Pajek
Semirings and Matrix Analysis of Networks
Sources of Network Data
Models and Methods in Social Network Analysis
Exploratory Social Network Analysis with Pajek
An extensively revised and expanded second edition of the successful textbook on social network analysis integrating theory, applications and network analysis using Pajek. The main structural concepts and their applications in social research are introduced with exercises. Pajek software and data sets are available so readers can learn network analysis through application and case studies. Readers will have the knowledge, skill and tools to apply…
Probabilistic Inductive Classes of Graphs
A unifying framework—probabilistic inductive classes of graphs (PICGs)—is defined by imposing a probability space on the rules and their left elements from the standard notion of inductive class of graphs. The rules can model the processes creating real-world social networks, such as spread of knowledge, dynamics of acquaintanceships or sexual contacts, and emergence of clusters. We demonstrate the characteristics of PICGs by casting some well-kn…
Analysis of Kinship Relations With Pajek
In the article, two general approaches to analysis of large sparse networks are presented: fragment searching and matrix multiplication. These two approaches are applied to analysis of large genealogies. Genealogies can be represented as graphs in different ways: as Ore graphs, p-graphs, or bipartite p-graphs. We show that p-graphs are more suitable for searching for relinking patterns, whereas Ore graphs are better for computing kinship relation…
Computers/Ordinateurs/Internet
Exploratory Social Network Analysis with Pajek
This was the first textbook on social network analysis integrating theory, applications, and professional software for performing network analysis (Pajek). Step by step, the book introduces the main structural concepts and their applications in social research with exercises to test the understanding. An application section explaining how to perform the network analyses with Pajek software follows each theoretical section. Pajek software and data…
Generalized Blockmodeling
This book provides an integrated treatment of blockmodeling, the most frequently used technique in social network analysis. It secures its mathematical foundations and then generalizes blockmodeling for the analysis of many types of network structures. Examples are used throughout the text and include small group structures, little league baseball teams, intra-organizational networks, inter-organizational networks, baboon grooming networks, marri…
Partitioning networks based on generalized concepts of equivalence
The idea of partitioning a network in terms of a specific conceptualization of equivalence has taken a powerful hold on the imagination of network analysts. Frequently, an empirically established blockmodel is assessed in terms of its consistency with a particular visualization of a network. We demonstrate that, while a visual representation of a network can be helpful, this also constrains powerfully our image of the structure of that network. T…
Notes on blockmodeling
Anthropology
Five key problems of kinship networks are boundedness, cohesion, size and cohesive relinking, types of relations and relinking, and groups or roles. Approaches to solving these problems include formats available for electronic storage of genealogical data and representations of genealogies using graphs. P-graphs represent couples and uncoupled children as vertices, whereas parent-child links are the arcs connecting nodes both within and between d…
Semirings for social networks analysis
In the paper four semirings for solving social networks problems are constructed. The closure of relational matrix over geodetic semirings contains for every pair of vertices u and v the length and the number of u ‐ v geodesics; and for geosetic semiring the length and the set of vertices on u — v geodesics. The algorithms for computing the geodetic and the geosetic closure matrix are also given. The closures of the matrix of a given signed graph…
Analysis of the Southern women network using fractional approach
Analysis of Kinship Relations With Pajek
In the article, two general approaches to analysis of large sparse networks are presented: fragment searching and matrix multiplication. These two approaches are applied to analysis of large genealogies. Genealogies can be represented as graphs in different ways: as Ore graphs, p-graphs, or bipartite p-graphs. We show that p-graphs are more suitable for searching for relinking patterns, whereas Ore graphs are better for computing kinship relation…
A weighted clustering of population pyramids for the world's countries, 1996, 2001, 2006
This paper presents clusters of the world's countries obtained by a novel weighted clustering method. The approach is based on data representations with symbolic descriptions of age-sex structures. To obtain clusters with similar descriptions, a weighted clustering method is used which is suitable for data described with discrete distributions. In contrast to the classical approach, this method allows the population of each sex to be included in …
Probabilistic Inductive Classes of Graphs
A unifying framework—probabilistic inductive classes of graphs (PICGs)—is defined by imposing a probability space on the rules and their left elements from the standard notion of inductive class of graphs. The rules can model the processes creating real-world social networks, such as spread of knowledge, dynamics of acquaintanceships or sexual contacts, and emergence of clusters. We demonstrate the characteristics of PICGs by casting some well-kn…
An optimizational approach to regular equivalence
Direct and indirect methods for structural equivalence
Semirings for social networks analysis
In the paper four semirings for solving social networks problems are constructed. The closure of relational matrix over geodetic semirings contains for every pair of vertices u and v the length and the number of u ‐ v geodesics; and for geosetic semiring the length and the set of vertices on u — v geodesics. The algorithms for computing the geodetic and the geosetic closure matrix are also given. The closures of the matrix of a given signed graph…
Partitioning networks based on generalized concepts of equivalence
The idea of partitioning a network in terms of a specific conceptualization of equivalence has taken a powerful hold on the imagination of network analysts. Frequently, an empirically established blockmodel is assessed in terms of its consistency with a particular visualization of a network. We demonstrate that, while a visual representation of a network can be helpful, this also constrains powerfully our image of the structure of that network. T…
Notes on blockmodeling
Anthropology
Five key problems of kinship networks are boundedness, cohesion, size and cohesive relinking, types of relations and relinking, and groups or roles. Approaches to solving these problems include formats available for electronic storage of genealogical data and representations of genealogies using graphs. P-graphs represent couples and uncoupled children as vertices, whereas parent-child links are the arcs connecting nodes both within and between d…
Some analyses of Erdős collaboration graph
A subquadratic triad census algorithm for large sparse networks with small maximum degree
Generalized Blockmodeling
This book provides an integrated treatment of blockmodeling, the most frequently used technique in social network analysis. It secures its mathematical foundations and then generalizes blockmodeling for the analysis of many types of network structures. Examples are used throughout the text and include small group structures, little league baseball teams, intra-organizational networks, inter-organizational networks, baboon grooming networks, marri…
Generalized Blockmodeling (Structural Analysis in the Social Sciences)
Generalized blockmodeling of two-mode network data
Exploratory Social Network Analysis with Pajek
This was the first textbook on social network analysis integrating theory, applications, and professional software for performing network analysis (Pajek). Step by step, the book introduces the main structural concepts and their applications in social research with exercises to test the understanding. An application section explaining how to perform the network analyses with Pajek software follows each theoretical section. Pajek software and data…
Analysis of Kinship Relations With Pajek
In the article, two general approaches to analysis of large sparse networks are presented: fragment searching and matrix multiplication. These two approaches are applied to analysis of large genealogies. Genealogies can be represented as graphs in different ways: as Ore graphs, p-graphs, or bipartite p-graphs. We show that p-graphs are more suitable for searching for relinking patterns, whereas Ore graphs are better for computing kinship relation…
Computers/Ordinateurs/Internet
Probabilistic Inductive Classes of Graphs
A unifying framework—probabilistic inductive classes of graphs (PICGs)—is defined by imposing a probability space on the rules and their left elements from the standard notion of inductive class of graphs. The rules can model the processes creating real-world social networks, such as spread of knowledge, dynamics of acquaintanceships or sexual contacts, and emergence of clusters. We demonstrate the characteristics of PICGs by casting some well-kn…
Exploratory Social Network Analysis with Pajek
An extensively revised and expanded second edition of the successful textbook on social network analysis integrating theory, applications and network analysis using Pajek. The main structural concepts and their applications in social research are introduced with exercises. Pajek software and data sets are available so readers can learn network analysis through application and case studies. Readers will have the knowledge, skill and tools to apply…
Models and Methods in Social Network Analysis
Pajek
Semirings and Matrix Analysis of Networks
Sources of Network Data
Generalized two-mode cores
A weighted clustering of population pyramids for the world's countries, 1996, 2001, 2006
This paper presents clusters of the world's countries obtained by a novel weighted clustering method. The approach is based on data representations with symbolic descriptions of age-sex structures. To obtain clusters with similar descriptions, a weighted clustering method is used which is suitable for data described with discrete distributions. In contrast to the classical approach, this method allows the population of each sex to be included in …
An algebraic approach to temporal network analysis based on temporal quantities
Towards a systematic description of the field using keywords analysis
IMetrics
Computer Science (29 works) · Complex Network Analysis Techniques (24 works) · Mathematics (17 works) · Network analysis (12 works) · Data science (11 works) · Social network analysis (10 works) · World Wide Web (10 works) · Data mining (8 works) · Combinatorics (7 works) · Sociology (7 works)