A new stochastic path-length tree methodology for constructing communication networks
dc.contributor.author | Cho, Jaewun | en_US |
dc.contributor.author | DeSarbo, Wayne S. | en_US |
dc.date.accessioned | 2006-04-10T14:41:48Z | |
dc.date.available | 2006-04-10T14:41:48Z | |
dc.date.issued | 1991-06 | en_US |
dc.identifier.citation | Cho, Jaewun, DeSarbo, Wayne S. (1991/06)."A new stochastic path-length tree methodology for constructing communication networks." Social Networks 13(2): 105-140. <http://hdl.handle.net/2027.42/29291> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6VD1-4697XH4-6/2/6607bdeef3fd9c1b5943f1cd908706ee | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/29291 | |
dc.description.abstract | Network analysis has become a popular method for identifying the communication structure in a system where positional and relational aspects are important. In this paper, a maximum likelihood based methodology is presented that allows for the analysis of binary sociometric data. This methodology provides a network representation via estimated path-length or additive trees that indicate the distance between all pairs of members. The methodology is distinguished from traditional hierarchical clustering based procedures by its direct consideration of the asymmetry in a typical communication process, the simultaneous representation of structural characteristics (e.g., clique membership, clique cohesiveness), and the identification of the specialized communication roles of each member (e.g., opinion leader, liaison). A penalty function algorithm is developed and its performance is investigated via a Monte Carlo analysis with synthetic data. An application examining information flows among managers is presented. Finally, directions for future research are suggested. | en_US |
dc.format.extent | 1903700 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | A new stochastic path-length tree methodology for constructing communication networks | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Social Sciences (General) | en_US |
dc.subject.hlbtoplevel | Social Sciences | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | School of Business Administration, University of Michigan, Ann Arbor, MI 48109-1234, USA | en_US |
dc.contributor.affiliationother | College of Business, Arizona State University, Tempe, AZ 85287, USA | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/29291/1/0000352.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/0378-8733(91)90016-M | en_US |
dc.identifier.source | Social Networks | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.