0% found this document useful (0 votes)
20 views9 pages

Random Graph Models in Social Networks

The document discusses various random graph models, including the Erdos-Renyi and Small-World models, and their applications in analyzing real-world social networks. It highlights the differences between network evolution models and nodal attribute models, emphasizing the effectiveness of the latter in producing assortative networks and community structures. Additionally, it explores concepts such as cohesive subgroups, structural equivalence, and positional analysis in social network analysis.

Uploaded by

amamatha
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
20 views9 pages

Random Graph Models in Social Networks

The document discusses various random graph models, including the Erdos-Renyi and Small-World models, and their applications in analyzing real-world social networks. It highlights the differences between network evolution models and nodal attribute models, emphasizing the effectiveness of the latter in producing assortative networks and community structures. Additionally, it explores concepts such as cohesive subgroups, structural equivalence, and positional analysis in social network analysis.

Uploaded by

amamatha
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Unit-2 Random graph models

Random graphs and alternative models: We compare the predictions of our models
to data for a number of real-world social networks and find that in some cases, the
models are in remarkable agreement with the data, whereas in others the agreement
is poorer, perhaps indicating the presence of additional social structure in the
network that is not captured by the random graph.

1) Erdos-Renyi Random Graph Model :


Two variants: Gn,p: undirected graph on n nodes and each edge (u,v) appears
with probability p
Gn,m: undirected graph with n nodes and m edges, where edges are picked
uniformly at random.
Where n and p do not uniquely determine the graph.

Random Graph Model: Edges


Node Degrees in a Random Graph:

Problem with the ER Model: Gnp model has short paths: O(log n) – This is the
smallest diameter we can get if we have a constant degree. – But clustering is
low! • But real networks have “local” structure

2) Small-world Random Graph Model: We generate graphs with high clustering


coefficient while having short paths (low diameter) and the solution is
Small-World Model.

Two components to the model:


(1) Start with a low-dimensional regular lattice – In our case, we are using a ring
as a lattice – Has high clustering coefficient, but has high diameter.
(2) Rewire: introduce randomness (“shortcuts”) – Add/remove edges to create
shortcuts to join remote parts of the lattice – For each edge with probability p
move the other end to a random node – Reduces the diameter by adding
shortcuts.
Rewiring allows us to “interpolate” between a regular lattice and a random
graph.

Models of network growth: Network evolution models and nodal attribute models

The models fall into two categories: those in which the addition of new links is
dependent on the (typically local) network structure (network evolution models,
NEMs), and those in which links are generated based only on nodal attributes
(nodal attribute models, NAMs).

An exponential random graph model (ERGM) with structural dependencies is


included for comparison. We fit models from each of these categories to two
empirical acquaintance networks with respect to basic network properties. We
compare higher order structures in the resulting networks with those in the data,
with the aim of determining which models produce the most realistic network
structure with respect to degree distributions, assortativity, clustering spectra,
geodesic path distributions, and community structure.

We find that the nodal attribute models successfully produce assortative networks
and very clear community structure. However, they generate unrealistic clustering
spectra and peaked degree distributions that do not match empirical data on large
social networks. On the other hand, many of the network evolution models produce
degree distributions and clustering spectra that agree more closely with data. They
also generate assortative networks and community structure, although often not to
the same extent as in the data. The ERGM model, which turned out to be near-
degenerate in the parameter region best fitting our data, produces the weakest
community structure.

The massive growth and increase in popularity of online social networks has
greatly helped facilitate the spread of information, as it has become increasingly
more common to use the online communities as tools for communication.

We consider growth models based on preferential attachment - the tendency of a


node to connect to a node with higher degree. Using Facebook as a dataset, we
develop a mechanism to model the Facebook network into a simple framework.
We employ numerical and analytical methods to investigate and compare the
structures of the model networks.

Navigation in social Networks:


Social navigation is a form of social computing introduced by Dourish and
Chalmers in 1994. They defined it as when "movement from one item to another is
provoked as an artifact of the activity of another or a group of others". Social
navigation can help to give users a sense of social presence.
The term “social navigation” (SN) refers to media use patterns that are driven by
the previous media activities of others. This phenomenon is widely encountered in
social media environments, which allow users to easily leave and receive
information. However, investigating the variety of SN actions, such as rating,
forwarding, and even producing media items oneself, increases the prevalent
challenges of empirical research on web content. This concept reflects on these
challenges and offers possible solutions via the example of a pilot study
concerning online news based on a multi-method design with a particular emphasis
on online content analysis. Special attention is devoted to the dynamics of online
media and online news in particular, data reactivity during research, algorithmic
content production, and the impact of relationship-related information.

Online social networking enables individuals to connect with family and friends,
play games, and express themselves. It's that last element that tends to get users of
social networking tangled up. Posts on sites like Facebook have the potential to
reach a vast audience in a very short time. It's one thing to have an opinion, but it's
something else to share it with the world, especially in a permanent format.
Cohesive subgroups: Cohesive subgroups are subsets of actors among whom
there are relatively strong, direct, intense, frequent or positive ties.
Cohesive subgroups in one-mode networks focus on properties of pairwise ties,
whereas cohesive subgroups in two-mode affiliation networks focus on ties
existing among actors through their joint membership in collectivities.

Cohesive subgroups are theoretically important according to these theories


because of social forces operating through direct contact among subgroup
members, through indirect conduct transmitted via intermediaries, or through the
relative cohesion within as compared to outside the subgroup.

Many network researchers who have developed or reviewed methods for cohesive
subgroups in social networks have noted that these methods attempt to formalize
the notion of social group.

Social Group and Subgroup: The notions of social group, subgroup, clique, and so
on are widely used in the social sciences, particularly in social psychology and
sociology. Many network researchers who have developed or reviewed methods
for cohesive subgroups in social networks have noted that these methods
attempt to formalize the notion of social group.

Subgroups Based on Nodal Degree: we describe cohesive subgroup ideas that are
based on the adjacency of subgroup members. These approaches are based on
restrictions on the minimum number of actors adjacent to each actor
in a subgroup.

Subgroups based on adjacency between members are useful for understanding


processes that operate primarily through direct contacts among
subgroup members.

Multidimensional Scaling: Multidimensional scaling is been used by many


network analysts to represent proximities among actors. Multidimensional scaling
is a very general data analysis technique, and there are numerous texts and articles
describing multidimensional scaling.

Multidimensional scaling seeks to represent proximities (similarities or


dissimilarities) among a set of entities in low-dimensional space so that entities
that are more proximate to each other in the input data arc closer in the space, and
entities that are less proximate to each other are farther apart in the space.

The usual input to multidimensional scaling is a one-mode symmetric matrix


consisting of measures of similarity, dissimilarity, or proximity between
pairs of entities. To study cohesive subsets of actors in a network the
input to multidimensional scaling should be some measure of pairwise
proximity among actors, such as the geodesic distance between each pair
of actors. The output of multidimensional scaling is a set of estimated
distances among pairs of entities, which can be expressed as coordinates
in one-, two-, or higher-dimensional space. Using multidimensional
scaling to study cohesive subgroups shows which subsets of actors are
relatively close to each other in a graph theoretic sense.

Multidimensional scaling for studying cohesive subgroups we use the marriage


relation for Padgett's Florentine families. We used GRADAP (Sprenger and
Stokman 1989) to calculate the path distances, aud SYSTAT (Wilkinson 1987)
to do the multidimensional scaling. The Pucci family is an isolate on
the marriage relation and thus was omitted · from the multidimensional
scaling. The final multidimensional scaling solution in two dimensions.
Structural equivalence: Structural equivalence, introduced and defined by Lorrain
and White (1971), is a mathematical property of subsets of actors in a network (or
nodes in a graph). Briel1y, two actors are structurally equivalent if they have
identical ties to and from all other actors in the network.

Consider the example In this graph actors 3 and 4 are structurally equivalent since
both have ties to actor 5 and both have ties from both actors 1 and 2. In addition,
actors 1 and 2 are structurally equivalent because both have ties to actors 3 and 4.
Looking at the sociomatrix for this example, we see that structurally equivalent
actors 1 and 2 have identical rows and columns in the sociomatrix (as do actors 3
and 4). In this example, there are B = 3 subsets of structurally equivalent
actors ; [B1] = {1, 2}, [B2] = {3,4}, and [B3] = {5}.

Notice that if two actors are structurally equivalent then their respective
rows and columns in the sociomatrix will be identical. Rows in a sociomatrix,
containing their choices made, will contain l's and D's in exactly the same columns,
and the columns, containing choices received, will contain l's and D's in exactly the
same rows. If there is more than one relation, then the two structurally equivalent
actors will have identical entries in their respective rows and columns in all
sociomatrices.

The above fig represents Sociomatrix and directed graph

Roles and positions: There are two important and related concepts here: position
and role. In social network analysis position refers to a collection of
individuals who are similarly embedded in networks of relations. while
role refers to the patterns of relations which obtain between actors or
between positions. The notion of position thus refers to a collection of
actors who are similar in social activity, ties, or interactions, with respect
to actors in other positions.
Since position is based on the similarity of ties among subsets of actors,
rather than their adjacency, proximity, or reachability, this theoretical
concept, and its formalization network terms, are quite different from
the notion of cohesive subgroup. Actors occupying the same position
need not be in direct, or even indirect, contact with one another.

Positional and Role Analysis: There are two key aspects to the positional and role
analysis of social networks: identifying social positions as collections of actors
who are similar in their ties with others, and modeling social roles as systems of
ties between actors or between positions.

The left path from top to bottom in the below Figure).The major task here is to
locate subsets of actors who are similar across the collection of relations. Similarity
will be defined in terms of the equivalence of actors with respect to some formal
mathematical property. The formal mathematical property specifies which actors
will be "grouped" together in a network position. We can think of a positional
analysis, the vertical path on the left side of the diagram, as mapping actors into
equivalence classes, where (ideally) an equivalence class consists of all
actors who are identical on the specified mathematical property.

Common questions

Powered by AI

Cohesive subgroups represent tightly-knit collections of actors with strong, direct ties, capturing key social processes and dynamics within networks . In one-mode networks, the focus is on pairwise ties between actors, highlighting direct social contacts. In two-mode affiliation networks, the emphasis shifts to shared memberships or affiliations, which reflect indirect social connections through common collectives . These differences affect how social cohesion and influence are modeled and understood, with each type providing distinct insights into network dynamics.

Methods like adjacency-based subgroup identification and multidimensional scaling are used to formalize cohesive subgroups by focusing on direct contacts and proximities respectively . These methods facilitate social network analysis by providing structured, quantifiable measures of group cohesion and interactions, enabling researchers to identify dense clusters, analyze group dynamics, and understand the central actors' roles within networks . Such formalization aids in revealing the network's social architecture and the flow of social influence.

Positional and role analysis focus on mapping actors into equivalence classes based on similar social ties, rather than direct or indirect contact, thus analyzing patterns of relations across actors or positions in a network . In contrast, cohesive subgroup analysis emphasizes strong, direct connectivity within subgroups, focusing on relational density and adjacency. This difference allows positional and role analysis to identify functionally similar actors without requiring direct ties, thus uncovering latent network structures and functional divisions within the network that cohesive subgroup analysis might overlook .

The Small-World model introduces randomness into a regular lattice by rewiring edges, creating shortcuts that drastically reduce path lengths, similar to the Erdos-Renyi model, while maintaining the high clustering coefficient found in lattice models . This interpolation between structured and random graphs allows the model to mimic the short path lengths typical of random networks while preserving the high clustering observed in real-world networks, thereby addressing the primary limitation of the Erdos-Renyi model's low clustering and the lattice model's large path lengths .

Researchers face challenges such as accurately representing the proximities among actors in low-dimensional space and ensuring that these representations are interpretable in terms of social closeness. The representation must correctly reflect the input proximities, which can be complex in real-world networks . Such challenges can lead to misinterpretation if the scaling inaccurately portrays group dynamics or fails to capture the true nature of actor proximities, potentially skewing the analysis of cohesive subgroups and leading to incorrect conclusions about the network's structure and dynamics .

The preferential attachment mechanism contributes to the structure of online social networks by enabling new nodes to preferentially connect with more highly connected nodes, leading to the formation of scale-free networks where a few nodes have many connections while most have few . This is important for modeling because it reflects the observed distribution of network connections in social platforms like Facebook, capturing the capacity for rapid information dissemination and the emergence of 'hubs' that play critical roles in spreading content and ideas .

Social navigation influences user behavior by facilitating interactions based on other users' activities, such as following, rating, or sharing content. This phenomena enhances the sense of social presence and community activity . The implications for online content dissemination are significant as social navigation can rapidly spread information or trends across the network, contributing to viral content circulation and shaping the consumption patterns of news and media, thereby impacting public opinion and engagement .

The Erdos-Renyi (ER) model typically produces networks with short paths and low clustering, which does not align with the high clustering and assorted community structures found in real networks . The Small-World model, however, can generate short paths while preserving a higher clustering coefficient by adding randomness to a regular lattice. Additionally, network evolution models more closely match real-world degree distributions and clustering spectra, compared to nodal attribute models which excel in producing assortative networks but fail in realistic clustering spectra. The ERGM model was found less effective due to its near-degenerate fit with test data, which resulted in the weakest community structure .

Structural equivalence identifies roles and positions by grouping actors who have the same network ties, meaning they have identical interactions with the same sets of other actors . This concept helps discern actors that have interchangeable roles or positions within the network, independent of their direct or indirect connections. Understanding roles and positions is crucial for network analysis as it reveals the functional similarity among actors and uncovers the network's underlying structural patterns, influencing both the flow of information and the network's hierarchy .

Network evolution models generate link additions based on existing network structures, capturing degree distributions and clustering that align closely with empirical data . These models reflect real-world dynamics where new links are influenced by current connections. In contrast, nodal attribute models generate links based solely on nodal attributes, leading to networks with clear community structures and assortativity but unrealistic clustering spectra and degree distributions . The differences occur because network evolution models integrate network dynamics while nodal attribute models assume link formation is driven by fixed node characteristics.

You might also like