When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Sociomapping - Wikipedia

    en.wikipedia.org/wiki/Sociomapping

    Sociomapping takes into account that, particularly in case of social relations, relational data may be asymmetrical (e.g. John like Mary more than she likes him) and preserves this information by mapping the objects in such a way that for each object the closest other object is the one closest to it according to the metric of choice in the ...

  3. Structural cohesion - Wikipedia

    en.wikipedia.org/wiki/Structural_cohesion

    In sociology, structural cohesion is the conception [1] [2] of a useful formal definition and measure of cohesion in social groups. It is defined as the minimal number of actors in a social network that need to be removed to disconnect the group. It is thus identical to the question of the node connectivity of a given graph in discrete mathematics.

  4. Centrality - Wikipedia

    en.wikipedia.org/wiki/Centrality

    The canonical example is Freeman's betweenness centrality, the number of shortest paths which pass through the given vertex. [7] Likewise, the counting can capture either the volume or the length of walks. Volume is the total number of walks of the given type. The three examples from the previous paragraph fall into this category.

  5. Graph theory - Wikipedia

    en.wikipedia.org/wiki/Graph_theory

    Graph theory in sociology: Moreno Sociogram (1953). [16] Graph theory is also widely used in sociology as a way, for example, to measure actors' prestige or to explore rumor spreading, notably through the use of social network analysis software. Under the umbrella of social networks are many different types of graphs. [17]

  6. Stochastic block model - Wikipedia

    en.wikipedia.org/wiki/Stochastic_block_model

    The goal of detection algorithms is simply to determine, given a sampled graph, whether the graph has latent community structure. More precisely, a graph might be generated, with some known prior probability, from a known stochastic block model, and otherwise from a similar Erdos-Renyi model. The algorithmic task is to correctly identify which ...

  7. Social graph - Wikipedia

    en.wikipedia.org/wiki/Social_graph

    The social graph is a graph that represents social relations between entities. In short, it is a model or representation of a social network, where the word graph has been taken from graph theory. The social graph has been referred to as "the global mapping of everybody and how they're related". [1]

  8. Manifest and latent functions and dysfunctions - Wikipedia

    en.wikipedia.org/wiki/Manifest_and_latent...

    Manifest functions are the consequences that people see, observe or even expect. It is explicitly stated and understood by the participants in the relevant action. The manifest function of a rain dance, according to Merton in his 1957 Social Theory and Social Structure, is to produce rain, and this outcome is intended and desired by people participating in the ritual.

  9. Modularity (networks) - Wikipedia

    en.wikipedia.org/wiki/Modularity_(networks)

    Example of modularity measurement and colouring on a scale-free network. Modularity is a measure of the structure of networks or graphs which measures the strength of division of a network into modules (also called groups, clusters or communities). Networks with high modularity have dense connections between the nodes within modules but sparse ...