Subhayan Mukerjee, Tian Yang, G. Stadler, Sandra González-Bailón
{"title":"什么是弱关系?分析共曝光网络的过滤技术比较","authors":"Subhayan Mukerjee, Tian Yang, G. Stadler, Sandra González-Bailón","doi":"10.2139/ssrn.3368603","DOIUrl":null,"url":null,"abstract":"Co-exposure networks are a useful tool to analyze patterns of news consumption. In these networks, nodes are news sources and ties measure the strength of their audience overlap. In observational data, some overlap might result from random exposure or random browsing behavior. Filtering techniques can help eliminate the weakest connections and, with them, random noise. There are different approaches to filtering weighted networks; however, it is not always clear which approach is the most appropriate. Here, we describe three different techniques and we compare their performance using two observed networks. First, we assess the impact that each technique has on the global topology. We then study the trade-off that exists between removing ties and preserving the connectedness of the network, and we offer a mathematical approach to systematically analyze that trade-off. We propose a method to identify an optimal threshold to maximize the number of edges removed while minimizing the number of nodes that become isolates.","PeriodicalId":448402,"journal":{"name":"Corporate Governance & Sociology or Psychology eJournal","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"What Counts as a Weak Tie? A Comparison of Filtering Techniques to Analyze Co-Exposure Networks\",\"authors\":\"Subhayan Mukerjee, Tian Yang, G. Stadler, Sandra González-Bailón\",\"doi\":\"10.2139/ssrn.3368603\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Co-exposure networks are a useful tool to analyze patterns of news consumption. In these networks, nodes are news sources and ties measure the strength of their audience overlap. In observational data, some overlap might result from random exposure or random browsing behavior. Filtering techniques can help eliminate the weakest connections and, with them, random noise. There are different approaches to filtering weighted networks; however, it is not always clear which approach is the most appropriate. Here, we describe three different techniques and we compare their performance using two observed networks. First, we assess the impact that each technique has on the global topology. We then study the trade-off that exists between removing ties and preserving the connectedness of the network, and we offer a mathematical approach to systematically analyze that trade-off. We propose a method to identify an optimal threshold to maximize the number of edges removed while minimizing the number of nodes that become isolates.\",\"PeriodicalId\":448402,\"journal\":{\"name\":\"Corporate Governance & Sociology or Psychology eJournal\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-04-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Corporate Governance & Sociology or Psychology eJournal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2139/ssrn.3368603\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Corporate Governance & Sociology or Psychology eJournal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.3368603","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
What Counts as a Weak Tie? A Comparison of Filtering Techniques to Analyze Co-Exposure Networks
Co-exposure networks are a useful tool to analyze patterns of news consumption. In these networks, nodes are news sources and ties measure the strength of their audience overlap. In observational data, some overlap might result from random exposure or random browsing behavior. Filtering techniques can help eliminate the weakest connections and, with them, random noise. There are different approaches to filtering weighted networks; however, it is not always clear which approach is the most appropriate. Here, we describe three different techniques and we compare their performance using two observed networks. First, we assess the impact that each technique has on the global topology. We then study the trade-off that exists between removing ties and preserving the connectedness of the network, and we offer a mathematical approach to systematically analyze that trade-off. We propose a method to identify an optimal threshold to maximize the number of edges removed while minimizing the number of nodes that become isolates.