E-LIS, Eprints in Library and Information Science Homepage E-LIS, Eprints in Library and Information Science
   home   |   about   |   search   |   browse   |   register   |   registered users area   |   help   |   FAQ   |   JITA   

Q-measures for binary divided networks: an investigation within the field of informetrics

Rousseau, Ronald (2005) Q-measures for binary divided networks: an investigation within the field of informetrics. In Grove, Andrew, Eds. Proceedings 68th Annual Meeting of the American Society for Information Science and Technology (ASIST) 42, Charlotte (US).

Full text available as:
PDF - Requires Adobe Acrobat Reader or other PDF viewer.

Abstract

Q-measures for binary divided networks, as introduced by Flom, Friedman, Strauss and Neaigus are studied. These measures try to capture the idea of bridges between two groups in a connected undirected network. Values for these measures are calculated for building blocks such as line and star networks. As an application two small co-author networks are analyzed.

Keywords:Q-measures ; networks
Subjects:I. Information treatment for information services > IZ. None of these, but in this section.
ID Code:5265
Deposited By:Medeiros, Norm
Deposited On:08 February 2006
All fields:Show all fields

Adamic, L. & Adar, E. (2003). Friends and neighbors on the Web. Social Networks, 25, 211-230.

Björneborn, L. & Ingwersen. P. (2001). Perspectives of webometrics. Scientometrics, 50, 65-82.

Braun, T. (2004). Hungarian priority in network theory. Science, 304, 1745-1746.

Davis, M. & Wilson, C.S. (Eds.). (2001). Proceedings of the 8th International Conference on Scientometrics & Informetrics. Sydney (Australia): Bibliometric & Informetrics Research Group (BIRG), University of New South Wales.

Flom, P.L., Friedman, S.R., Strauss, S., & Neaigus, A. (2004). A new measure of linkage between two sub-networks. Connections, 26(1), 62-70.

Freeman, L.C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40, 35-41.

Kochen, M. (Ed.). (1989). The Small World. Norwood (NJ): Ablex.

Kretschmer, H. (2004). Author productivity and geodesic distance in co-authorship networks, and visibility on the Web. Scientometrics, 60, 409-420.

Milgram, S. (1967). The small world problem. Psychology Today, 2, 60-67.

Newman, M.E.J. (2001). The structure of scientific collaboration networks. Proceedings of the National Academy of Sciences of the USA, 98, 404-409.

Newman, M.E.J. & Watts, D.J. (1999). Scaling and percolation in the small-world network model. Physical Review E, 60, 7332-7342.

Otte, E., & Rousseau, R. (2002). Social network analysis: a powerful strategy, also for the information sciences. Journal of Information Science, 28, 441-453.

Rousseau, R. (2005). Another look at small worlds: one node set – two link structures. ISSI Newsletter, 1(1), p.7.

Van Raan, A.F.J. (2005). Reference-based publication networks with episodic memories. Scientometrics, 63, 549-566.

Wasserman, S., & Faust, K. (1994). Social network analysis. Cambridge University Press.

White, H.D., Wellman, B., & Nazer, N. (2004). Does citation reflect social structure? Journal of the American Society for Information Science and Technology, 55, 111-126.

Archive Staff Only: edit this record