The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Graph and semigroup homomorphisms on networks of relations
Open accessAbstract
The algebraic definitions presented here are motivated by our search for an adequate formalization of the concepts of social roles as regularities in social network patterns. The theorems represent significant homomorphic reductions of social networks which are possible using these defimtions to capture the role structure of a network. The concepts build directly on the pioneering work of SF. Nadel(l957) and the pathbreaking approach to blockmodeling introduced by Lorrain and White (1971) and refined in subsequent years (White, Boorman and Brelger 1976; Boorman and White 1976; Arabie. Boorman and Levitt, 1978; Sailer. 1978). Blockmodeling 1s one of the predominant techniques for deriving structural models of social networks. When a network is represented by a directed multigraph, a blockmodel of the multigraph can be characterized as mapping points and edges onto their images in a reduced multigraph. The relations in a network or multigraph can also be composed to form a semigroup. In the first part of the paper we examine “graph” homomorphisms, or homomorphic mappings of the points or actors in a network. A family of basic concepts of role equlbalence are Introduced, and theorems presented to show the structure preservmg properties of their various induced homomorphisms. This extends the “classic” approach to blockmodeling via the equivalence of positions. Lorrain and White (1971), Pattison (1980). Boyd (1980, 1982). and most recently Bona&h (1982) have explored the topic taken up in the second part of this paper. namely the homomorphic reduction of the semigroup of relations on a network, and the relation between semigroup and graph homomorphisms. Our approach allows us a significant beginning in reducing the complexity of a multigraph by collapsing relations which play a similar “role” in the network.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Grätzer, G. (1968) · Cited by 2,320
Social Structure from Multiple Networks. I. Blockmodels of Roles and Positions
White, H. C., Boorman, S. A., & Breiger, R. L. (1976) · American Journal of Sociology · doi:10.1086/226141 · Cited by 2,097
Structural equivalence of individuals in social networks
Lorrain, F., & White, H. C. (1971) · The Journal of Mathematical Sociology · doi:10.1080/0022250x.1971.9989788 · Cited by 1,697
Breiger, R. L., Boorman, S. A., & Arabie, P. (1975) · Journal of Mathematical Psychology · doi:10.1016/0022-2496(75)90028-0 · Cited by 820
Social Structure from Multiple Networks. II. Role Structures
Boorman, S. A., & White, H. C. (1976) · American Journal of Sociology · doi:10.1086/226228 · Cited by 788
The Theory of Social Structure
Nadel, S. F. (2013) · Routledge eBooks · doi:10.4324/9781315018003 · Cited by 515
The Theory of Social Structure.
Janowitz, M., & Nadel, S. F. (1958) · American Sociological Review · doi:10.2307/2089014 · Cited by 511
Structural equivalence: Meaning and definition, computation and application
Sailer, L. D. (1978) · Social Networks · doi:10.1016/0378-8733(78)90014-x · Cited by 267
Research Methods in Social Network Analysis
(2017) · Routledge eBooks · doi:10.4324/9781315128511 · Cited by 233
Constructing blockmodels: How and why
Arabie, P., Boorman, S. A., & Levitt, P. R. (1978) · Journal of Mathematical Psychology · doi:10.1016/0022-2496(78)90034-2 · Cited by 222
Cited by
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
Link prediction in complex networks: A survey
Lü, L., & Zhou, T. (2011) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2010.11.027 · Cited by 2,819
The text mining handbook: advanced approaches in analyzing unstructured data
(2007) · Choice Reviews Online · doi:10.5860/choice.44-5684 · Cited by 1,598
Borgatti, S. P., & Halgin, D. S. (2011) · Organization Science · doi:10.1287/orsc.1100.0641 · Cited by 1,596
Connectivity in a citation network: The development of DNA theory
Hummon, N. P., & Dereian, P. (1989) · Social Networks · doi:10.1016/0378-8733(89)90017-8 · Cited by 821
Metadata
- Authors
- White, D. R., & Reitz, K. P.
- Venue
- Social Networks
- Publisher
- Elsevier BV
- Published
- 1983-06
- Volume
- 5
- Issue
- 2
- Pages
- 193-234
- ISSN
- 0378-8733 (ISSN-L)
- OpenAlex
- W2133011836
- Cited by
- 360
- References
- 15
- FWCI
- 2.69
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Graph and semigroup homomorphisms on networks of relations. https://app.cochat.ai/papers/10.1016/0378-8733(83)90025-4
- The paper
- White, D. R., & Reitz, K. P. (1983). Graph and semigroup homomorphisms on networks of relations. Social Networks. https://doi.org/10.1016/0378-8733(83)90025-4
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.