Measuring Homophily

Social Network Analysis is employed widely as a means to compute the probability that a given message flows through a social net- work. This approach is mainly grounded upon the correct usage of three basic graph- theoretic measures: degree centrality, closeness centrality and betweeness centrality. We show that, in general, those indices are not adapt to foresee the flow of a given message, that depends upon indices based on the sharing of interests and the trust about depth in knowledge of a topic. We provide new definitions for measures that over- come the drawbacks of general indices discussed above, using Semantic Social Network Analysis, and show experimental results that show that with these measures we have a different understanding of a social network compared to standard measures.