P Doreian
Dados Biográficos
| ID | 856 |
|---|---|
| NOME | P Doreian |
| PRENOMES | P |
| SOBRENOME | Doreian |
| ASSINATURA | DOREIAN P |
| AFILIAÇÕES | University of Pittsburgh |
| ORCID | 0000-0002-3301-7840 |
| VERIFICADO | Sim |
| TOTAL DE OBRAS | 76 |
| TOTAL DE CITAÇÕES | 406 |
| TOTAL COMO AUTOR | 76 |
| TOTAL COMO EDITOR | 0 |
| PRIMEIRO ANO DE PUBLICAÇÃO | 1969 |
| ANO MAIS RECENTE DE PUBLICAÇÃO | 2022 |
| ÍNDICE H | 12 |
Public issues, policy proposals, social movements, and the interests of the Koch Brothers network of allies
Hubs and Authorities in the Koch Brothers Network
Partitioning signed networks using relocation heuristics, tabu search, and variable neighborhood search
Creating the thin blue line
Stability of centrality measures in valued networks regarding different actor non-response treatments and macro-network structures
Social network data are prone to errors regardless their source. This paper focuses on missing data due to actor non-response in valued networks. If actors refuse to provide information, all values for outgoing ties are missing. Partially observed incoming ties to non-respondents and all other patterns for ties between members of the network can be used to impute missing outgoing ties. Many centrality measures are used to determine the most promi…
Finding roles in sparse economic hierarchies
OUP accepted manuscript
Although social network analysis has gained popularity in economic geography over the last decade, most of these applications focused on analyzing the characteristics of and opportunities for single actors or regions within networks. Yet, many contemporary research challenges in economic geography center on questions regarding structural dynamics and their implications in entire networks for the collective outcomes involving social actors. This s…
Actor non-response in valued social networks
Social network data usually contain different types of errors. One of them is missing data due to actor non-response. This can seriously jeopardize the results of analyses if not appropriately treated. The impact of missing data may be more severe in valued networks where not only the presence of a tie is recorded, but also its magnitude or strength. Blockmodeling is a technique for delineating network structure. We focus on an indirect approach …
A real-coded genetic algorithm for two-mode KL-means partitioning with application to homogeneity blockmodeling
Networks in Social Psychology, Beginning with Kurt Lewin
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…
A variable neighborhood search method for a two-mode blockmodeling problem in social network analysis
This paper presents a variable neighborhood search (VNS) algorithm that is specially designed for the blockmodeling of two-mode binary network matrices in accordance with structural equivalence. Computational results for 768 synthetic test networks revealed that the VNS heuristic outperformed a relocation heuristic (RH) and a tabu search (TS) method for the same problem. Next, the three heuristics were applied to two-mode network data pertaining …
Partitioning large signed two-mode networks
Introduction to the special issue on Network Dynamics (Part 2)
Non-response in social networks
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…
Social context, spatial structure and social network structure
Introduction to the special issue on network dynamics
Social network engineering and race in a police academy
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
Understanding a collaborative effort to reduce racial and ethnic disparities in health care
Clashing Paradigms and Mathematics in the Social Sciences
Using in seeking has a long history. While its value for the natural sciences seems evident and has a taken-for granted nature, similar claims for the social sciences have been contentious. The link between knowledge and within social science is often viewed with sus picion, a reaction reinforced by the organiza tion of academia. University departments are frequently turf protection machines clashing over resources. In doing so, they attempt to m…
A multiple indicator approach to blockmodeling signed networks
A note on actor network utilities and network evolution
Linear Models with Spatially Distributed Data
This article deals with linear models for which data have been aggregated over well-defined geographic areas. Such data may be generated by spatial processes, and these may be represented in the form of spatial autocorrelation in the disturbance term or directly in the form of a spatial effect. This article details the derivation of Ord's (1975) MLEprocedurefor the spatial disturbances model and contrasts it with this MLE procedure for the spatia…
Pre‐transitive balance mechanisms for signed networks
The fundamental empirical structural balance hypothesis claims that human signed networks tend towards balance over time. Balance theorists assume that there is a balance theoretic mechanism whose cumulative effect drives the evolution of signed social structures towards balance. In previous work, we used a line index of imbalance to measure the imbalance of a network through time. Consistent with balance theory, we found a steady movement toward…
Estimating Linear Models with Spatially Distributed Data
Sociologists study a wide variety of social, political, and economic phenomena. Many of these phenomena-for example, urbanization, political mobilization, economic development, diffusion of innovations-take place in and are distributed across geographical space. It is reasonable, therefore, to argue that sociologists are interested, indeed have long been interested, in social phenomena distributed in geographical space. Yet, in the main, our theo…
A brief history of balance through time
We present methods for establishing the amount of reciprocity, transitivity and group balance (a generalization of structural balance) in sociometric structures. These methods are applied to the second time series of sociometric data provided by the Newcomb (1961) study. The amount of reciprocity was above chance levels at the outset and showed no systematic variation thereafter. Transitivity has a very different time scale. It climbed steadily t…
Measuring Patterns of Acquaintanceship [and Comments and Reply]
This paper examines some of the factors which determine how people know each other and is a preliminary attempt to discover the rules which govern such interactions. An informant-defined experiment was conducted to elicit the information about a person needed by individuals in a small U.S. university town to choose which of their acquaintances was most likely to know that person. We found, as with a previous experiment, that knowledge of the pers…
Network Autocorrelation Models
For network effects models of network autocorrelation we use Monte Carlo methods to study the relative properties of three estimation methods. The methods are the iterative maximum likelihood estimation (Ord, 1975; Doreian, 1981), ordinary least squares, and a regression-based 'quick and dirty' substitution for iterative MLE. Of the three, OLS is clearly the inferior estimation method and MLE the superior method. We recommend the use of the maxim…
A Structural Control Model of Organizational Change
This paper presents a differential equation model of organizational change which focuses upon the mechanisms of change. The model is obtained from positing the notion of structural control. The necessary procedures for estimating the model are developed and applied to data from a panel study of bureaucracies. The model addresses Blau's formal theory of differentiation and both modifies and extends that theory. The relationship between size variab…
On the connectivity of social networks
In the context of analyzing social structures through the use of graph theory, some binary matrix operations for valued graphs are presented. These operations are demonstrated in the analysis of social network data presented by Kapferer. Further examples of where the procedures should prove useful are suggested
Fixed list versus snowball selection of social networks
Testing a structural model of perception
Maximum Likelihood Methods for Linear Models
This article presents a model that is a natural generalization of both the spatial effects linear model and the linear model with spatial disturbances. Maximum likelihood methods are presented that provide estimates of the parameters of the model together with the asymptotic variance-covariance matrix of the estimates. Numerical illustrations of these methods are provided
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…
Equivalence in a social network
Equivalence has become a foundational concept in social network representations of social structure. Each use of an equivalence concept has two components: (i) the definition of equivalence and (ii) a computational algorithm for detecting equivalences, or the extent to which they exist. In all substantive contexts it is necessary to determine if a particular definition of equivalence is appropriate and the extent to which the computational algori…
Mathematics and the Study of Social Relations
Non-response in social networks
A Note on the Detection of Cliques in Valued Graphs
The theory of graphs has been used considerably in the study of social phenomena when it has been possible to conceive of such phenomena in terms of a set of units and of relations holding between these units. Such a conception of structure is readily handled by graph theory. Among the techniques that have been developed in this area is one of clique detection (Harary and Ross, 1957), where a clique is defined as a maximal subset of elements, eac…
Causality in Social Network Analysis
The role that causality can play in social network analysis is unclear. The author provides a broad characterization of social network analysis before considering the nature of causality. He distinguishes four types of causality: system causality, statistical causality, mechanism causality, and algorithmic causality. Their potential places in network analysis are discussed. Understanding generative mechanisms-be they system, mechanism, or algorit…
Analyzing the Structure of the Centrality-Productivity Literature Created Between 1948 and 1979
Science grows and cumulates on the research fronts of disciplinary specialties, implying that the most fruitful citation analyses will be those looking at well-defined specialties or subspecial ties. The entire literature on centrality and productivity from 1948 to 1979 is used to construct a citation network. Methods are proposed for the analysis of the connective structure of such networks and then applied to the centrality-productivity citatio…
Actor non-response in valued social networks
Social network data usually contain different types of errors. One of them is missing data due to actor non-response. This can seriously jeopardize the results of analyses if not appropriately treated. The impact of missing data may be more severe in valued networks where not only the presence of a tie is recorded, but also its magnitude or strength. Blockmodeling is a technique for delineating network structure. We focus on an indirect approach …
A variable neighborhood search method for a two-mode blockmodeling problem in social network analysis
This paper presents a variable neighborhood search (VNS) algorithm that is specially designed for the blockmodeling of two-mode binary network matrices in accordance with structural equivalence. Computational results for 768 synthetic test networks revealed that the VNS heuristic outperformed a relocation heuristic (RH) and a tabu search (TS) method for the same problem. Next, the three heuristics were applied to two-mode network data pertaining …
A multiple indicator approach to blockmodeling signed networks
Understanding a collaborative effort to reduce racial and ethnic disparities in health care
Stability of centrality measures in valued networks regarding different actor non-response treatments and macro-network structures
Social network data are prone to errors regardless their source. This paper focuses on missing data due to actor non-response in valued networks. If actors refuse to provide information, all values for outgoing ties are missing. Partially observed incoming ties to non-respondents and all other patterns for ties between members of the network can be used to impute missing outgoing ties. Many centrality measures are used to determine the most promi…
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…
A Note on the Detection of Cliques in Valued Graphs
The theory of graphs has been used considerably in the study of social phenomena when it has been possible to conceive of such phenomena in terms of a set of units and of relations holding between these units. Such a conception of structure is readily handled by graph theory. Among the techniques that have been developed in this area is one of clique detection (Harary and Ross, 1957), where a clique is defined as a maximal subset of elements, eac…
A Critique of the Multidimensional Approach to Stratification
The sociology of research
Mathematics and the Study of Social Relations
Mathematics and the Study of Social Relations
On the connectivity of social networks
In the context of analyzing social structures through the use of graph theory, some binary matrix operations for valued graphs are presented. These operations are demonstrated in the analysis of social network data presented by Kapferer. Further examples of where the procedures should prove useful are suggested
A Structural Control Model of Organizational Change
This paper presents a differential equation model of organizational change which focuses upon the mechanisms of change. The model is obtained from positing the notion of structural control. The necessary procedures for estimating the model are developed and applied to data from a panel study of bureaucracies. The model addresses Blau's formal theory of differentiation and both modifies and extends that theory. The relationship between size variab…
Estimates for Differential Equation Models of Social Phenomena
Reply to Daft and MacMillan
Modeling Social Processes
Modeling Social Processes
On the evolution of group and network structure
On the "Social Law of Effect" for Task-Oriented Groups
Estimating Differential Equation Models On Time Series
This paper explores the statistical properties of estimates proposed by Doreian and Hummon (1976) for systems of simultaneous differential equation systems. Since these procedures are iterative and computationally burdensome, alternative simpler methods are also explored via Monte Carlo Simulations. The simpler methods provide reasonably good diagnostics as to whether or not the more com plicated procedures are worthwhile. Problems of autocorrela…
Response Characteristics of the U.S. Scientific and Engineering Labor Force
Views Icon Views Article contents Figures & tables Video Audio Supplementary Data Peer Review Share Icon Share Facebook Twitter LinkedIn Email Tools Icon Tools Get Permissions Cite Icon Cite Search Site Citation Patrick Doreian, Norman Hummon; Response Characteristics of the U.S. Scientific and Engineering Labor Force. Human Organization 1 December 1980; 39 (4): 310–323. doi: https://doi.org/10.17730/humo.39.4.7533214g66633413 Download citation f…
Linear Models with Spatially Distributed Data
This article deals with linear models for which data have been aggregated over well-defined geographic areas. Such data may be generated by spatial processes, and these may be represented in the form of spatial autocorrelation in the disturbance term or directly in the form of a spatial effect. This article details the derivation of Ord's (1975) MLEprocedurefor the spatial disturbances model and contrasts it with this MLE procedure for the spatia…
Polyhedral dynamics and conflict mobilization in social networks
Estimating Linear Models with Spatially Distributed Data
Sociologists study a wide variety of social, political, and economic phenomena. Many of these phenomena-for example, urbanization, political mobilization, economic development, diffusion of innovations-take place in and are distributed across geographical space. It is reasonable, therefore, to argue that sociologists are interested, indeed have long been interested, in social phenomena distributed in geographical space. Yet, in the main, our theo…
Leveling coalitions as network phenomena
Testing a structural model of perception
Maximum Likelihood Methods for Linear Models
This article presents a model that is a natural generalization of both the spatial effects linear model and the linear model with spatial disturbances. Maximum likelihood methods are presented that provide estimates of the parameters of the model together with the asymptotic variance-covariance matrix of the estimates. Numerical illustrations of these methods are provided
Tripartite structural analysis
A report by the editor
(1984). A report by the editor. The Journal of Mathematical Sociology: Vol. 10, No. 1, pp. 105-112
Measuring Patterns of Acquaintanceship [and Comments and Reply]
This paper examines some of the factors which determine how people know each other and is a preliminary attempt to discover the rules which govern such interactions. An informant-defined experiment was conducted to elicit the information about a person needed by individuals in a small U.S. university town to choose which of their acquaintances was most likely to know that person. We found, as with a previous experiment, that knowledge of the pers…
Network Autocorrelation Models
For network effects models of network autocorrelation we use Monte Carlo methods to study the relative properties of three estimation methods. The methods are the iterative maximum likelihood estimation (Ord, 1975; Doreian, 1981), ordinary least squares, and a regression-based 'quick and dirty' substitution for iterative MLE. Of the three, OLS is clearly the inferior estimation method and MLE the superior method. We recommend the use of the maxim…
Computer Science (55 obras) · Mathematics (50 obras) · Complex Network Analysis Techniques (36 obras) · Opinion Dynamics and Social Influence (34 obras) · Sociology (27 obras) · Psychology (26 obras) · Theoretical Computer Science (22 obras) · Political science (19 obras) · Combinatorics (17 obras) · Data mining (16 obras)