Andrej Mrvar
Biographic Data
| ID | 98461 |
|---|---|
| NAME | Andrej Mrvar |
| GIVEN NAMES | Andrej |
| FAMILY NAME | Mrvar |
| SIGNATURE | MRVAR A |
| AFFILIATIONS | University of Ljubljana |
| ORCID | 0000-0001-8557-4692 |
| VERIFIED | Yes |
| TOTAL WORKS | 18 |
| TOTAL CITATIONS | 24 |
| AUTHOR COUNT | 18 |
| EDITOR COUNT | 0 |
| FIRST PUBLICATION YEAR | 1996 |
| LATEST PUBLICATION YEAR | 2022 |
| H-INDEX | 4 |
Public issues, policy proposals, social movements, and the interests of the Koch Brothers network of allies
A systemic approach to sociometric group research
Hubs and Authorities in the Koch Brothers Network
Structural Balance and Signed International Relations
We use balance theoretic ideas to study the dynamics of the international system of nations in a network of signed relations from 1946 through 1999. Using the Correlates of War data for this period, we apply pre-specified signed blockmodeling to characterize the fundamental structure of this network. Even though the system expanded greatly with many ties being created and/or destroyed, the basic structure remained the same but with new positions …
Pajek
Testing two theories for generating signed networks using real data
Multiple social processes generate social network structures. We use relaxed structural balance, a generalization of classic structural balance, to facilitate a direct comparative test of two social psychological theories regarding network generation. One is structural balance theory. The other concerns differential popularity. These theories predict distinctive signed blockmodels. We use two well known empirical temporal signed data sets present…
An Exact Algorithm for Blockmodeling of Two-Mode Network Data
We consider problems where relationships between two sets (or modes) of objects are available in the form of a binary matrix with elements of 1 (0) indicating a bond (lack of a bond) between corresponding row and column objects. The goal is to establish a partition of the row objects and, simultaneously, a partition of the column objects to form blocks that consist of either exclusively 1s or exclusively 0s to the greatest extent possible. This t…
Partitioning large signed two-mode networks
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…
Two Algorithms for Relaxed Structural Balance Partitioning
Understanding social phenomena with the help of mathematical models requires a coherent combination of theory, models, and data together with using valid data analytic methods. The study of social networks through the use of mathematical models is no exception. The intuitions of structural balance were formalized and led to a pair of remarkable theorems giving the nature of partition structures for balanced signed networks. Algorithms for partiti…
Partitioning Signed Two-Mode Networks
Structural balance theory forms the foundation for a generalized blockmodel method useful for delineating the structure of signed social one-mode networks for social actors (for example, people or nations). Heider's unit formation relation was dropped. We re-examine structural balance by formulating Heider's unit formation relations as signed two-mode data. Just as generalized blockmodeling has been extended to analyze two-mode unsigned data, we …
Partitioning signed social networks
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…
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…
A subquadratic triad census algorithm for large sparse networks with small maximum degree
Some analyses of Erdős collaboration graph
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…
A partitioning approach to structural balance
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…
Structural Balance and Signed International Relations
We use balance theoretic ideas to study the dynamics of the international system of nations in a network of signed relations from 1946 through 1999. Using the Correlates of War data for this period, we apply pre-specified signed blockmodeling to characterize the fundamental structure of this network. Even though the system expanded greatly with many ties being created and/or destroyed, the basic structure remained the same but with new positions …
An Exact Algorithm for Blockmodeling of Two-Mode Network Data
We consider problems where relationships between two sets (or modes) of objects are available in the form of a binary matrix with elements of 1 (0) indicating a bond (lack of a bond) between corresponding row and column objects. The goal is to establish a partition of the row objects and, simultaneously, a partition of the column objects to form blocks that consist of either exclusively 1s or exclusively 0s to the greatest extent possible. This t…
Two Algorithms for Relaxed Structural Balance Partitioning
Understanding social phenomena with the help of mathematical models requires a coherent combination of theory, models, and data together with using valid data analytic methods. The study of social networks through the use of mathematical models is no exception. The intuitions of structural balance were formalized and led to a pair of remarkable theorems giving the nature of partition structures for balanced signed networks. Algorithms for partiti…
Partitioning Signed Two-Mode Networks
Structural balance theory forms the foundation for a generalized blockmodel method useful for delineating the structure of signed social one-mode networks for social actors (for example, people or nations). Heider's unit formation relation was dropped. We re-examine structural balance by formulating Heider's unit formation relations as signed two-mode data. Just as generalized blockmodeling has been extended to analyze two-mode unsigned data, we …
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 partitioning approach to structural balance
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
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…
Partitioning signed social networks
Partitioning Signed Two-Mode Networks
Structural balance theory forms the foundation for a generalized blockmodel method useful for delineating the structure of signed social one-mode networks for social actors (for example, people or nations). Heider's unit formation relation was dropped. We re-examine structural balance by formulating Heider's unit formation relations as signed two-mode data. Just as generalized blockmodeling has been extended to analyze two-mode unsigned data, we …
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…
Two Algorithms for Relaxed Structural Balance Partitioning
Understanding social phenomena with the help of mathematical models requires a coherent combination of theory, models, and data together with using valid data analytic methods. The study of social networks through the use of mathematical models is no exception. The intuitions of structural balance were formalized and led to a pair of remarkable theorems giving the nature of partition structures for balanced signed networks. Algorithms for partiti…
Partitioning large signed two-mode networks
An Exact Algorithm for Blockmodeling of Two-Mode Network Data
We consider problems where relationships between two sets (or modes) of objects are available in the form of a binary matrix with elements of 1 (0) indicating a bond (lack of a bond) between corresponding row and column objects. The goal is to establish a partition of the row objects and, simultaneously, a partition of the column objects to form blocks that consist of either exclusively 1s or exclusively 0s to the greatest extent possible. This t…
Pajek
Testing two theories for generating signed networks using real data
Multiple social processes generate social network structures. We use relaxed structural balance, a generalization of classic structural balance, to facilitate a direct comparative test of two social psychological theories regarding network generation. One is structural balance theory. The other concerns differential popularity. These theories predict distinctive signed blockmodels. We use two well known empirical temporal signed data sets present…
Structural Balance and Signed International Relations
We use balance theoretic ideas to study the dynamics of the international system of nations in a network of signed relations from 1946 through 1999. Using the Correlates of War data for this period, we apply pre-specified signed blockmodeling to characterize the fundamental structure of this network. Even though the system expanded greatly with many ties being created and/or destroyed, the basic structure remained the same but with new positions …
A systemic approach to sociometric group research
Hubs and Authorities in the Koch Brothers Network
Public issues, policy proposals, social movements, and the interests of the Koch Brothers network of allies
Computer Science (18 works) · Mathematics (12 works) · Complex Network Analysis Techniques (11 works) · Opinion Dynamics and Social Influence (8 works) · Theoretical Computer Science (8 works) · Psychology (7 works) · Data science (6 works) · Sociology (6 works) · Combinatorics (4 works) · Data mining (4 works)