The Impact of Facebook on Politics

Many years have passed since we have been introduced to the concept of social media, and as 2019 is nearing its end, it has already been 15 years since Facebook has first launched. By now, it should be no surprise that most of us are revealing more personal information to the public than we would have in a world with no social media, or that Facebook is able to get even more data about you than you have ever intended to reveal. Looking back, how has social media impacted the world of politics? The article ‘What Facebook Did to American Democracy’ attempts to put all the pieces together, introducing personality profiling data1.

I’m sure by now, anybody who has used Facebook must have seen (seemingly innocent) online quizzes that ask you for completion to share its results with your friends. This is actually one example of harvesting data by means of psychographic profiling. With such information, users can be divided and then grouped into networks (as we have seen in class). An ethical way to use such data would be to expose to you targeted advertisements, but it can also be used in ways that influence your stance in politics. Through the harvested data, specific political messages are targeted to different segments without anybody realizing; “How does a campaign know what its opponent is saying if ads are only targeted to white Jewish men between 28 and 34 who have expressed a fondness for U2… and who donated to Barack Obama’s campaign?”2 Harvested data can also be used to target you with posts that you want to see; “Pariser … noticed conservative people, whom he’d befriended on [Facebook] despite his left-leaning politics, has disappeared from his News Feed… no conservative links for me.”2

Targeted political messages to communities. Users targeted only by posts that align with their stance. Adding these together, we have a network where a platform (such as Facebook) provides a source of information (targeted messages), all while eliminating and preventing other sources of information (filtered/targeted posts). In essence, we get communities who’s members have strong ties with each other, with few to none weak edges between the communities.

Depiction of Communities

Taking into consideration Granovetter’s explanation of the social and structural role of an edge, the lack of weak edges prevents communities from accessing other sources of information. Couple this with other tactics involving media (such as blowing up fake news3 ), and we can see that large platforms like Facebook have the power to affect the general population’s stance in politics.

References:

(1) Facebook is Killing Democracy with its Personality Profiling Data. Timothy Summers https://theconversation.com/facebook-is-killing-democracy-with-its-personality-profiling-data-93611

(2) What Facebook Did To American Democracy. Alexis Madrigal –https://www.theatlantic.com/technology/archive/2017/10/what-facebook-did/542502/

(3) Heres Why Facebook’s Trending Algorithm Keeps Promoting Fake News. Craig Silverman – https://www.buzzfeednews.com/article/craigsilverman/can-facebook-trending-fight-off-fake-news#.fadKm1WOG

Image: https://ourpangea.files.wordpress.com/2012/04/social-networks.jpg?w=584

Homophily is Present Even in EverQuest II

We have been shown through numerous in-class examples that proximity and homophily play a key role in who we associate ourselves with. Some of the largest factors identified were age, nationality and race. The factors that were found to exist in virtual worlds such as EverQuest II in the study “Virtually There: Exploring Proximity and Homophily in a Virtual World” were proximity, age and game experience. One of the main factors of the study, proximity, was largely attributed to people bringing their real life friends into the game with them to experience it together.

EverQuest II is a Massively Multiplayer Online Role Playing Game (MMORPG) where players need to work together to complete quests and upgrade their characters. (img: https://store.steampowered.com/app/
333890/EverQuest_II__Pain_in_the_Neck_Bundle/ )

The two main types of homophily that were experienced in EverQuest II and highlighted in the study were age and game experience which greatly determined players in-game relationships. Relationships were measured through teaming, messaging, trading and mailing patterns that took place throughout the game. The results showed that players routinely cooperated and communicated with people of similar ages and skill levels. An interesting note from the results was that gender homophily did not originally appear to be present, but upon further inspection it was found that this was caused by the low probability that 2 female players would interact with each other in the game. There are many possible reasons for this, with the prevailing one throughout the study being that most female players were brought in by male partners (boyfriends/husbands) or other males that they knew.

In many ways virtual worlds like EverQuest II emulate the real world since they are built on top of player-to-player interaction. Therefore, seeing homophily present should be of no surprise, but it is interesting nonetheless to see that even virtual birds of the same feather flock together.

Relevant Link
http://dmitriwilliams.com/proximity.pdf

References

Huang, Y., Shen, C., Williams, D., & Contractor, N. (2009). Virtually There: Exploring Proximity and Homophily in a Virtual World. International Conference on Computational Science and Engineering, 4, 354–359.

Measuring Polarization Using Community Detection Algorithms

People are very divided when it comes to certain issues such as politics, abortion, gun-control and same-sex marriage. When two groups have conflicting and opposing viewpoints with very few people holding a neutral viewpoint, it is known as ‘polarization’ in social science. With the rise of social media and technology use, more people are able to voice their opinions online which allows us to analyze which topics cause polarization. 

Why is it important to study polarization? According to the paper (cited below), polarization causes segregation and political conflict. I chose this paper since it tries to study polarization using community detection algorithm which is a topic we learned in class. The paper also shows how their measure of polarization is related to prior work on this matter which used  a measure known as modularity. Modularity works by quantifying homophily and antagonism. Homophily was also studied in this course.

This paper tries to derive a novel approach to analyze polarization compared to prior work on this matter. It is important to understand the concept of antagonism in graphs prior to understanding this paper’s methodology. Antagonism tries to quantify nodes avoiding to connect with nodes of another community. This provides the intuition for the following idea used in this paper. 

In this paper, firstly, the communities are identified using some community detection algorithm. Then the boundary nodes are identified within each of the two communities. This paper defines the boundary node as having one of two properties.

  1. A node v ∈ Gi has at least one edge connecting to community Gj ; 
  2. 2. A node v ∈ Gi has at least one edge connecting to a member of Gi which is not connected to Gj

Finally, they measure the connectedness of these boundary nodes. The less connections between these boundary nodes implies higher polarization.

This paper observes a real world network of opposing views on gun control following the tragic shootings in Sandy Hook Elementary School in Connecticut by analyzing tweets and retweets on Twitter. 

Here, the polarity constant being positive implies there is polarization and negative means very less polarization or surprisingly more cross-connections between boundary nodes.

In short, we can see how community detection algorithm and other concepts from this course can be used to analyze polarization. We also know why it is important to minimize polarization. With continual knowledge and improved algorithms to detect polarization, we can hope to find solutions to this problem.

Reference List

  1. Guerra, P. C., Meira Jr, W., Cardie, C., & Kleinberg, R. (2013, June). A measure of polarization on social media networks based on community boundaries. In Seventh International AAAI Conference on Weblogs and Social Media.

Should you trust your friends?

Do you trust your friends? I know it is obvious that your response will be, “Of course I trust them! Why would I not?”. Yet, take this to the perspective of social networks or communication on digital networks and you might change your mind.

Paulo, the author of Introduction to Cyber-Warfare, states that there are dangers in transitive trust, which is a topic that is covered in class. Transitive trust is when User A trusts User C under the condition that User A trusts User B and User B trusts User C (see Figure 1). This creates a triadic closure among the three users. We will assume that the direct trust is a strong tie, and the transitive trust can be either a strong or weak tie. Paulo references an experiment performed by Thomas Ryan, in which he observes how a fake account spread through social networks and got people to trust it through transitive trust. Ryan created a fraudulent account called “Robin Sage” with made up information and put her profile on LinkedIn, Facebook and Twitter. This experiment provides some interesting results.

Ryan quotes one user messaging “Robin Sage” stating “I’ve never met you, but I saw you had Marty on your Facebook list, so that is good enough for me.” This shows a common action on social media which is that people tend to send friend requests to those who have mutual friends with them, which is a form of transitive trust common on social media. Another type of transitivity is when a person has a lot of connections with highly respected or trustworthy people. People tend to trust that person, even though they have never met or talked to each other in real life. In the experiment, “Robin Sage” has an extraordinary profile on social media platforms, having graduated from MIT and boasting NSA internship experience. Her extraordinary profile allowed her connect with Joint Chiefs of Staff, the CIO of NSA, etc. – which allowed her to gain the trust of many people through a cascading effect.

Figure 1: Trust relationships between three users. A and C has a transitive trust (box 2).

Another interesting thing Paulo references is the “tipping” model, introduced by Laureate Thomas Schelling. This model clearly points out that when there are two people believing or following a trend, their mutual connection will eventually believe or follow that trend as well. The following graph can give you an idea on how your friends who you trust can eventually influence everyone on what they believe.

Figure 2: Box 1: only two people adopt the trend; Box 2: a white node trusts the two shaded nodes and it adopts the trend as well, turning it into a gray node. Box 3, 4: The action cascades.

Let’s go back to Ryan’s experiment. If we apply the “tipping” model on that experiment, provided that there is a network that indicates their connection (nodes are users, and edges between them means they are friends, or they trust each other), then, from the above diagram, a shaded node represents a user that trusts “Robin Sage” as a legitimate person, which is an effect that cascades throughout the network. From box 1, we can see there is a white node that trusts two gray nodes. The two gray nodes can then convince the white node to trust “Robin Sage” as a legitimate person, due to the “dipping” model. This action repeats recursively within the network, and eventually the whole network will believe that “Robin Sage” is a real person, even though they have never met her in person. This spread in the network is justified by the Strong Triadic Closure property.

As an analogy, consider a scenario where one person tries to spread a false message and one of your friends trusts his/her word. Your friend will bring that message into your network and gradually spread it to everyone. You cannot easily determine if the message is true or not, but since your friends trust it, you will generally trust them.

Figure 4: Trust* relationship.
Figure 3: The PGP web of trust. Users can quickly verify the validity of digital signatures through transitive trust.

The PGP web of trust is a real world example that has this kind of issue, where you can never know if your friends trust the right person. It is dangerous to trust your friend on the Internet without really knowing them, in the perspective of the web of trust. If one of your friends trusted a malicious person, by the transitive trust property learned in class, you will trust the fraud as well. Transitive trust in PGP may bring us the convenience of quick verification but it also creates potential trust issues in the network. The best practice when dealing with trust online is only to trust people that you really know in person, and to exchange your PGP keys in a secure way.

So, ask yourself again: Do you still trust your friends on the digital network?


Citations:

Detecting Credit Card Fraud: Graph Analysis and Visualization

Software companies such as Neo4j and Cambridge Intelligence, provide network visualization products so that organizations could apply social network techniques to analyze data. They advocate for fraud prevention, and have worked with organizations all over the world, including law enforcement. As credit cards have become an increasingly popular form of payment worldwide, these software companies provide insight on the importance of graphing visualization tools in detecting credit card fraud. This is an interesting topic to discuss because of how widespread the problem has become globally and how complex it is to solve it. Many may argue that preventing all fraud incidents is not possible, as it is similar to the cat and mouse scenario, where both parties will always try to be one step ahead of each other. However, there are many innovative graphing tools today, along with machine learning and artificial intelligence algorithms that analysts can use to help prevent complicated criminal activities that were previously undetectable.

Detecting fraud is difficult because of constantly changing tactics that criminals use and their increasingly sophisticated strategies. Fraudulent activities could generally be categorized as two different kinds, known and unknown fraud. Known fraud is an activity that analysts have identified before and can be detected by defined algorithms and automation. Unknown fraud is an activity that needs to be detected, as it has not been encountered before. 


Using graphing technology, the large amount of data that is often incomplete and complex could be rearranged into a network, which analysts could then use to extrapolate or interpolate patterns and find anomalies that otherwise could go unnoticed.  While many algorithms are able to detect known fraud scenarios, detecting fraud when criminals work together and collaborate prove to be much harder to expose.  

Identifying credit card fraud involves studying the relationships between accounts, transactions, events and people. By displaying these entities in a graph, it would be easier to pinpoint the point of origin and common denominators. Additionally, Cambridge Intelligence provide solutions where noise data could be filtered out to highlight underlying patterns and features to support temporal based analyses.



Numerous graphing analyses and techniques can be used to detect fraud. In the case of credit card fraud, multiple network relationships are created by criminals to hide fraudulent activities. In a network, there may be thousands of credit card users and, for example, a new client might be interested in applying for a credit card. Using graph visualization tools to rearrange data, analysts will be able to identify networks that the client is a part of (community detection). Through identifying related clusters and the connectivity of their network, analysts can determine how likely a client is to be a fraud.  As an example, a basic indicator of potential fraudulent activity is if the client is trying to apply for a credit card with a SIN number that is the same SIN as a few different other accounts, but those accounts are under a different name or already marked as fraud. Thus, an investigation could be initiated. A lot more other attributes could be analyzed (i.e. phone numbers, addresses), but generally it is more simple and fast to follow the network connections than a brute force approach. By doing further investigations, such as calculating the node degrees of the social network, you may be able to find the person with the highest influence or perhaps which specific attributes prove to be the most influential in the network. This is useful because it will help in breaking down potential fraud rings, or preventing one to form. It may be the case where the neighbouring nodes that are one edge away from the client in the graph are not known as frauds. However, further analyses may reveal a few frauds 2 edges away from the client. Further more edges away, and a pattern may start to form and show that the client may be involved in some fraud activity. The goal of these graph analyses and identifying such patterns are to prevent fraud before it occurs.

In a similar way, these graphing analyzation and visualization techniques could be used to detect Insurance fraud and Bank fraud.


Fraud costs businesses billions of dollars each year. As crimes become harder to detect due to the level of complexity and sophistication, it is important for data tools and analyzing techniques to also continue to develop and innovate, with the goal of detecting such fraudulent crimes so it can be prevented.  Graph technology and social network analyses help take part in minimizing such losses.

Article:

Sadowksi, Gorka, and Philip Rathle. “Fraud Detection: Discovering Connections with Graph Databases.” Neo Technology, Neo Technology, Jan. 2015.

Relevant Links:

https://neo4j.com/graphconnect-2018/session/graph-technology-ai-machine-learning

How hard is it to fight a fire?

Suppose a wildfire starts in a forest (like in the Amazon rainforest) and you have a limited amount of resources to fight the fire as it spreads throughout the forest. What is the best strategy you should deploy so that you can maximize the number of trees you save before the fire is distinguished?

https://rainforestpartnership.org/amazon-wildfires/

This is the so-called Fire Fighter Problem, it has been discovered since 1995 and is still studied and experimented till today. It’s easy to see that we can transform the description of this problem into a network where

  • nodes = trees in the forest
  • edges = exists if a tree is next to another
  • S = the sources of the fire
  • Strategy = the way in which “firefighters” are deployed to fight the fire

and the goal would be to save the largest set of trees in the forest.

https://slideplayer.com/slide/4290990/

A keen student might attempt to solve this optimization problem with techniques we learn(ed) in CSCB63 and CSCC73. However, it turns out that the Fire Fighter Problem is a NP-hard problem, which means that we have not yet figured out an efficient solution that can deterministically solve every instance of this problem (without proving P=NP first!).

In my opinion, this result actually have a huge significance in our lives. If we refer to our classmate Sol and Jayden‘s blog posts — Sol investigated on the disease spreading network and Jayden on the computer virus network. Both of their problems can be seen as analogous to the Fire Fighter Problem. This implies that it is mathematically hard to come up with a very efficient algorithm to vaccinate people in a network or come up with a protocol to prevent a large network (maybe a SCC in the web) from being infected by a virus or malware.

From Netflix’s “Inside Bill’s Brain” documentary, Bill Gates talked about how it was extremely difficult to exterminate Polio in Africa as figuring out an efficient vaccination strategy was hard. Although this is unfortunate, it is not surprising from our insight of the Fire Fighter Problem and further confirms our intuition on this family of problems.

In summary, we see how we can describe a real world problem into one that involves networks, and by understanding from mathematical results, we can infer how difficult it is to implement a strategy in a real world system.

References:

Social Network reveals privacy

In modern-day, Social Network has become one of the most important features in daily life applications. People communicate and share their personal information on social network platforms such as Facebook, Twitter and etc. Have you ever noticed that social media such as Facebook has people you may know, this is through Triadic Closure in which means that if A knows B and B knows C then it implies A and C might know each other or might meet each other in the future.

This is an example of how the social network connects you with some people that you can potentially build a friendship with. Is this a good thing? It might be beneficial if you look into the perspective of extending your social network between you and other individuals in the digital world. It provides you with greater opportunities to meet people who might be helpful in your carrier or private manner. Build up your knowledge and track the newest information about the world.

The concept of triadic closure does not only apply to the social network, but also other fields. For example, in cybersecurity, this is called the Web of Trust, which means if you believe in your friends then their friends can be trustworthy. This transitive trust is easily applied to the Triadic closure.

On the other hand, this can be dangerous in the sense of revealing your personal information to the public. Since on most social media, users are able to search and look into your profile page, your information is easily leaked. It is also the case when you are browsing some webpages, it requires you to register an account with personal information such as email address, name, and contact information in order to get access to the content. In social media when you repost or like/dislike a post your interest might be known by other people. It is easy to find post that might not be true, It becomes untrustful.

In a recent article by the University of Vermont points out that social media privacy can be at risk even if you have deleted or never had an account. That is, the online posts and words from your friends have high potential predictive accuracy of your future activities without the need for your data. This means that by registering on social media, you are not just giving your information but at the same time your friends too. The result of this is that outside of the social media your friend who does not use the platform might be founded by other individuals. Many of the platforms even have access to your contact lists to create fake profiles which means that they do not even exist on the social network and ask people to invite them into the platform.

In conclusion, the creation of social networks is indeed a beneficial and phenomenal move for humankind, however, due to the ever-increasing size of the social network, privacy leak has become one of our primary concerns and more actions needs to be taken in order to maintain a healthy and clean environment.

Reference:

On Facebook and Twitter Your Privacy Is at Risk — Even If You Don’t Have an Account, Study Finds.” ScienceDaily, ScienceDaily, 21 Jan. 2019, https://www.sciencedaily.com/releases/2019/01/190121115354.htm

HutsonJan, Matthew, et al. “People Can Predict Your Tweets-Even If You Aren’t on Twitter.” Science, 22 Jan. 2019, https://www.sciencemag.org/news/2019/01/people-can-predict-your-tweets-even-if-you-aren-t-twitter

Radicalized through Recommender Systems

Online radicalization is a social phenomenon that has been a popular point of discussion as of late due to recent affairs in the modern political landscape. In light of events such as the Charlottesville protest, Christchurch shooting, and overall rise in hate crimes, many have pointed to major social media platforms in playing a contributing factor. By hosting and promoting extremist fringe content through their recommender systems, platforms like Youtube are becoming fertile grounds for radical ideologues. Caleb Cain is an example of an individual who, as he describes, “had fallen down the alt-right rabbit hole.”  In a New York Times published piece, he speaks of his slow indoctrination into far-right ideology through Youtube’s own recommender system as it would suggest further dubious content for him to view.

In a report from DataSociety by Rebecca Lewis in 2018, she outlines the potential pathways to extremist ideology one might have on Youtube by producing a graph of various political pundits and their relationships through appearances on the same video. Nodes are treated as their respective YouTube channels while the edges represent videos in which both parties contributed. As the algorithm tends to suggest videos from content creators and collaborators that the user has viewed, she lays out potential links between how one could be watching videos made by mainstream political pundits like Ben Shapiro and eventually be lead to viewing content from devout white nationalists such as Richard Spencer.

The findings in this report were further built upon in a study this year titled, “Auditing Radicalization Pathways on YouTube”. Researchers found a strong overlap between the users in comment sections of videos ranging from conservative talk show hosts to alt-right figureheads. To test Youtube’s recommender system, they took a snapshot by beginning at a Youtube channel that belonged to one of their devised community groups while performing a random walk across five suggested channel links and recorded their destination. The researchers found that they would hit a channel belonging to their “Alt-Right” cluster once every five times that they ran their recommender system, meaning one out of a total twenty-five attempts. While the percentages may seem small, they can make a meaningful difference given the scale at which Youtube operates.

Having encountered recommender systems during our discussions about signed networks in lecture, I thought this would be a good opportunity to look into the applications of these systems in the real world. They are no doubt effective at engaging users given how they’re employed in virtually every social media platform in some shape or form. Whether it be for finding products you might enjoy, movies, restaurants, friends and more, these recommender systems do a great job in analyzing a network and giving users more of what already suits their tastes. They are clearly optimized for engagement given the monetary incentives involved. The more time you spend clicking that next video suggestion on Youtube, the more opportunities they have to make money from advertisers. At the cost of only optimizing for engagement, however, you have issues with these recommender systems having unintended consequences.

This brings forward the idea that with recommender systems being so ubiquitous on the web, perhaps the internet isn’t the open sea that people pictured it to be. It might seem, in certain instances, that it’s more prone to forming bubbles instead. The ways in which these recommender systems provide great convenience can be damaging in some aspects as well. It will be interesting to see how companies akin to Google choose to augment their systems, if at all, to address problems such as user radicalization in the future.

Relevant Links:

The Making of a Youtube Radical –
https://www.nytimes.com/interactive/2019/06/08/technology/youtube-radical.html

Alternative Influence: Broadcasting the Reactionary Right on Youtube –
https://datasociety.net/output/alternative-influence/

Auditing Radicalization Pathways on Youtube –
https://arxiv.org/abs/1908.08313

China and Russia are becoming best friends of each other – Balance Theorem in international relations today.

In Wednesday’s lecture as we discussed structure balance and how to balance theorem implies local balance and global collations, we had a couple of graphs of international relations of decades ago, which brought my attention to international relations nowadays.

The article pointed out while U.S. trade relations with China have soured, it is evidential that trade relations between China and Russia are blossoming. China and Russia are increasing their economic, political and military ties which are led by China this time. The leaders signed statements committing to “the development of strategic cooperation and comprehensive partnership” between their nations recently. In other words, they are becoming best friends. It is a good example to demonstrate what we learned in a balanced network – the enemy of the enemy is a friend. If we consider China, Russia, and the US as a triple, China and Russia seemed to have a mutual enemy which is the United States, so that they are looking forward to building a positive relationship which is to confront the sanction from their mutual enemy. It forms a balanced network structure between these three countries: China, Russia forms positive edges and they are both negative to the US.

Figure 1: “Enemy of Enemy is My Friend

The Theory of Structural Balance also claims that a friend’s enemy is my enemy. If China represents a faction that antagonizes the United States, it should have negative relations to the countries which are allies of the United States. As one of the most countries associated closely with the United States, Canada had its relations to China inevitably deteriorated after the US-China trade war started. It has been revealed that China has halted its import from Canada and Canada arrested Meng, who is the chief financial officer of China’s telecom giant Huawei at the request of the United States. On the other side, Russia has been imposed sanctions by Canada for a long time ago, demonstrated Russia’s negative relation with Canada. If we consider Canada and the US represent another faction, the relations between these four countries demonstrate the Balance Theorem, that is local balance implies global coalitions.

Figure 2:  Local Balance network,
A: Canada, B: US, C: China, D: Russia
Figure 3: Balanced graph partitioned into two coalitions dislike each other

Applying the Balance Theorem worldwide, we can clearly see how countries get partitioned into different coalitions and countries tend to build close, strong ties within their own coalitions and fewer connections to outside coalitions. International relations today look very different than decades ago since there are too many factors get involved in and form new balanced structures and coalitions. But no matter how it performs, there is an old adage that always applies: “There are no permanent friends or permanent enemies, only permanent interests. “

Figure 4: An visualization of some alliances.

Relevant Links:

https://www.cnbc.com/2019/09/27/russia-and-chinas-relationship–how-deep-does-it-go.html

https://www.theglobeandmail.com/canada/british-columbia/article-canadian-us-authorities-colluded-arrest-plan-for-meng-wanzhou/

https://www.scmp.com/news/china/diplomacy/article/3027516/chinese-premier-li-keqiang-seeks-manage-expectations-moscow

https://www.armscontrol.org/act/2019-10/news/russia-china-criticize-us-missile-test

https://www.international.gc.ca/world-monde/international_relations-relations_internationales/sanctions/current-actuelles.aspx?lang=eng

Homophily: Is Segregation a Must?

Who knew that growing up and making friends and becoming who we are was not totally a random process. Was it possible that all our choices of the people we hang out with or not hang out with were based on homophily, a tendency in people to connect with others similar to themselves? As a child, I do not remember choosing friends based on their similar interests to me, but on how nice they were. So when did homophily start to affect my choices for friends or those who would remain as acquaintances or even strangers?

According to class lectures, homophily does not produce random uniform connections and is present if there are fewer connections between traits than those that are found if the connections were random. Connections between people may be built and developed based on their similar interests, but connections must also be formed as well as not formed based on other factors. As homophily is responsible for connecting people of similar interests it can also be responsible for the segregation that exists in today’s society. Whether it is segregation based on gender, cultural, social status, or one of the many types that people may have experienced, homophily may have played a part in it.

According to the scientific report “Structural transition in social networks: The role of homophily”, one of the aims of the paper was to show that segregation was due to homophily.  The report mentioned that human traits can remain rigid as well can also evolve. The authors of the study chose to keep the human traits rigid to show that social ties affecting homophily are responsible for the segregation that exists.  The report is very scientific with equations and graphs, but I shall mainly discuss the results that are of interest. The report mentioned that although humans have many traits, there are not really any particular traits that are important, that stands out when creating ties. The authors propose that the overlapping of communities of traits is a more realistic model of how society functions. Also that this connection of traits between nodes can become enhanced when the authors took into consideration the mechanism of local attachments, where there is an attachment emotionally by a person to a place.  They also state that homophily and local attachment when combine together shows an increase in segregation.

Examples of different egocentric networks, based on community overlaps.

According to the study, these egocentric networks showed that as in segregation as seen in figure (a) the nodes tend to connect to similar nodes with nearly identical traits with no connection to other communities. When there is a slight connection about 5% between the communities a pattern as shown in figure (b) is seen where communities are still clustered together. In figure (c), it can be seen that as the communities overlap, the nodes become less like their neighbouring nodes as compared to figure (a) where they were similar.  In figure (d), as the features from different communities become more overlapped, the similarities between features of neighbouring nodes decrease. The study also mentioned that a decrease in the similarity of neighbouring features is also due to an increase in the ego’s diversity which is an important feature for a decrease in segregation.

If according to this study, homophily and local attachments together can increase segregation then according to the egocentric networks above it is possible to decrease it.  It is likely that there are some people who would like to make more friends outside of their comfort zones. According to the study, the authors implied that to prevent the effect of segregation in our society people should support and promote cultural diversity.  The report did not mention how to promote cultural diversity, but for me who is now aware of homophily’s existence and living in a country that embraces cultural diversity, I believe that cultural segregation can be tackled.

Learning about and participating in the languages and activities of the different cultures can increase the number of connections between nodes of a variety of traits thus decreasing some evidence of homophily and thus cultural segregation.

Relevent Link

Reference List

Murase, Y., Jo, H.-H., Török, J., Kertész, J., & Kaski, K. (2019, March 13). Structural transition in social networks: The role of homophily. Retrieved October 4, 2019, from https://www.nature.com/articles/s41598-019-40990-z.