نمایش منو
صفحه اصلی
جستجوی پیشرفته
فهرست کتابخانه ها
درباره پایگاه
ارتباط با ما
تاریخچه
ورود / ثبت نام
عنوان
Graph and semigroup homomorphisms on networks of relations
پدید آورنده
White, DR; Reitz, KP
موضوع
رده
کتابخانه
مرکز و کتابخانه مطالعات اسلامی به زبانهای اروپایی
محل استقرار
استان:
قم
ـ شهر:
قم
تماس با کتابخانه :
32910706
-
025
شماره کتابشناسی ملی
شماره
LA6db6t66g
عنوان و نام پديدآور
عنوان اصلي
Graph and semigroup homomorphisms on networks of relations
نام عام مواد
[Article]
نام نخستين پديدآور
White, DR; Reitz, KP
یادداشتهای مربوط به خلاصه یا چکیده
متن يادداشت
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 definitions to capture the role structure of a network. The concepts build directly on the pioneering work of S.F. Nadel (1957) and the pathbreaking approach to blockmodeling introduced by Lorrain and White (1971) and refined in subsequent years (White, Boorman and Breiger 1976;Boorman and White 1976; Arabie, Boorman and Levitt, 1978; Sailer, 1978). Blockmodeling is 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 equivalence are introduced, and theorems presented to show the structure preserving 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 Bonacich (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. © 1983.
مجموعه
تاريخ نشر
1983
عنوان
UC Irvine
دسترسی و محل الکترونیکی
نام الکترونيکي
مطالعه متن کتاب
اطلاعات رکورد کتابشناسی
نوع ماده
[Article]
کد کاربرگه
275578
اطلاعات دسترسی رکورد
سطح دسترسي
a
تكميل شده
Y
پیشنهاد / گزارش اشکال
×
پیشنهاد / گزارش اشکال
×
اخطار!
اطلاعات را با دقت وارد کنید
گزارش خطا
پیشنهاد