original Articles A network approach to measuring state preferences max gallop and shahryar minhas 135 Artificial Benchmark for Community Detection (ABCD)—Fast random graph model with community structure bogumił kamiński, paweł prałat and françois théberge 153 Edge overlap in weighted and directed social networks heather mattie and jukka-pekka onnela 179 Functional disability and the role of children in U.S. older adults’ core discussion networks markus h. schafer and laura upenieks 194 The roles actors play in policy networks: Central positions in strongly institutionalized fields karin ingold, manuel fischer and dimitris christopoulos 213 A fused mixed-methods approach to thematic analysis of personal networks: Two case studies of caregiver support networks reza yousefi nooraie, bronwyn thompson, chelsea d’silva, ian zenlea, maryam tabatabaee and ardavan mohammad aghaei 236 network science editorial team
{"title":"NWS volume 9 issue 2 Cover and Back matter","authors":"Bronwyn Thompson","doi":"10.1017/nws.2021.7","DOIUrl":"https://doi.org/10.1017/nws.2021.7","url":null,"abstract":"original Articles A network approach to measuring state preferences max gallop and shahryar minhas 135 Artificial Benchmark for Community Detection (ABCD)—Fast random graph model with community structure bogumił kamiński, paweł prałat and françois théberge 153 Edge overlap in weighted and directed social networks heather mattie and jukka-pekka onnela 179 Functional disability and the role of children in U.S. older adults’ core discussion networks markus h. schafer and laura upenieks 194 The roles actors play in policy networks: Central positions in strongly institutionalized fields karin ingold, manuel fischer and dimitris christopoulos 213 A fused mixed-methods approach to thematic analysis of personal networks: Two case studies of caregiver support networks reza yousefi nooraie, bronwyn thompson, chelsea d’silva, ian zenlea, maryam tabatabaee and ardavan mohammad aghaei 236 network science editorial team","PeriodicalId":51827,"journal":{"name":"Network Science","volume":"9 1","pages":"b1 - b2"},"PeriodicalIF":1.7,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1017/nws.2021.7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41438454","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract Dense networks with weighted connections often exhibit a community-like structure, where although most nodes are connected to each other, different patterns of edge weights may emerge depending on each node’s community membership. We propose a new framework for generating and estimating dense weighted networks with potentially different connectivity patterns across different communities. The proposed model relies on a particular class of functions which map individual node characteristics to the edges connecting those nodes, allowing for flexibility while requiring a small number of parameters relative to the number of edges. By leveraging the estimation techniques, we also develop a bootstrap methodology for generating new networks on the same set of vertices, which may be useful in circumstances where multiple data sets cannot be collected. Performance of these methods is analyzed in theory, simulations, and real data.
{"title":"Block dense weighted networks with augmented degree correction","authors":"Benjamin Leinwand, V. Pipiras","doi":"10.1017/nws.2022.23","DOIUrl":"https://doi.org/10.1017/nws.2022.23","url":null,"abstract":"Abstract Dense networks with weighted connections often exhibit a community-like structure, where although most nodes are connected to each other, different patterns of edge weights may emerge depending on each node’s community membership. We propose a new framework for generating and estimating dense weighted networks with potentially different connectivity patterns across different communities. The proposed model relies on a particular class of functions which map individual node characteristics to the edges connecting those nodes, allowing for flexibility while requiring a small number of parameters relative to the number of edges. By leveraging the estimation techniques, we also develop a bootstrap methodology for generating new networks on the same set of vertices, which may be useful in circumstances where multiple data sets cannot be collected. Performance of these methods is analyzed in theory, simulations, and real data.","PeriodicalId":51827,"journal":{"name":"Network Science","volume":"10 1","pages":"301 - 321"},"PeriodicalIF":1.7,"publicationDate":"2021-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43959518","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract Decentralized coordination is one of the fundamental challenges for societies and organizations. While extensively explored from a variety of perspectives, one issue that has received limited attention is human coordination in the presence of adversarial agents. We study this problem by situating human subjects as nodes on a network, and endowing each with a role, either regular (with the goal of achieving consensus among all regular players), or adversarial (aiming to prevent consensus among regular players). We show that adversarial nodes are, indeed, quite successful in preventing consensus. However, we demonstrate that having the ability to communicate among network neighbors can considerably improve coordination success, as well as resilience to adversarial nodes. Our analysis of communication suggests that adversarial nodes attempt to exploit this capability for their ends, but do so in a somewhat limited way, perhaps to prevent regular nodes from recognizing their intent. In addition, we show that the presence of trusted nodes generally has limited value, but does help when many adversarial nodes are present, and players can communicate. Finally, we use experimental data to develop computational models of human behavior and explore additional parametric variations: features of network topologies and densities, and placement, all using the resulting data-driven agent-based (DDAB) model.
{"title":"Robust coordination in adversarial social networks: From human behavior to agent-based modeling","authors":"Chen Hajaj, Zlatko Joveski, Sixie Yu, Yevgeniy Vorobeychik","doi":"10.1017/nws.2021.5","DOIUrl":"https://doi.org/10.1017/nws.2021.5","url":null,"abstract":"Abstract Decentralized coordination is one of the fundamental challenges for societies and organizations. While extensively explored from a variety of perspectives, one issue that has received limited attention is human coordination in the presence of adversarial agents. We study this problem by situating human subjects as nodes on a network, and endowing each with a role, either regular (with the goal of achieving consensus among all regular players), or adversarial (aiming to prevent consensus among regular players). We show that adversarial nodes are, indeed, quite successful in preventing consensus. However, we demonstrate that having the ability to communicate among network neighbors can considerably improve coordination success, as well as resilience to adversarial nodes. Our analysis of communication suggests that adversarial nodes attempt to exploit this capability for their ends, but do so in a somewhat limited way, perhaps to prevent regular nodes from recognizing their intent. In addition, we show that the presence of trusted nodes generally has limited value, but does help when many adversarial nodes are present, and players can communicate. Finally, we use experimental data to develop computational models of human behavior and explore additional parametric variations: features of network topologies and densities, and placement, all using the resulting data-driven agent-based (DDAB) model.","PeriodicalId":51827,"journal":{"name":"Network Science","volume":"9 1","pages":"255 - 290"},"PeriodicalIF":1.7,"publicationDate":"2021-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1017/nws.2021.5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47154475","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract We discuss a recently proposed family of statistical network models—relational hyperevent models (RHEMs)—for analyzing team selection and team performance in scientific coauthor networks. The underlying rationale for using RHEM in studies of coauthor networks is that scientific collaboration is intrinsically polyadic, that is, it typically involves teams of any size. Consequently, RHEM specify publication rates associated with hyperedges representing groups of scientists of any size. Going beyond previous work on RHEM for meeting data, we adapt this model family to settings in which relational hyperevents have a dedicated outcome, such as a scientific paper with a measurable impact (e.g., the received number of citations). Relational outcome can on the one hand be used to specify additional explanatory variables in RHEM since the probability of coauthoring may be influenced, for instance, by prior (shared) success of scientists. On the other hand, relational outcome can also serve as a response variable in models seeking to explain the performance of scientific teams. To tackle the latter, we propose relational hyperevent outcome models that are closely related with RHEM to the point that both model families can specify the likelihood of scientific collaboration—and the expected performance, respectively—with the same set of explanatory variables allowing to assess, for instance, whether variables leading to increased collaboration also tend to increase scientific impact. For illustration, we apply RHEM to empirical coauthor networks comprising more than 350,000 published papers by scientists working in three scientific disciplines. Our models explain scientific collaboration and impact by, among others, individual activity (preferential attachment), shared activity (familiarity), triadic closure, prior individual and shared success, and prior success disparity among the members of hyperedges.
{"title":"Micro-level network dynamics of scientific collaboration and impact: Relational hyperevent models for the analysis of coauthor networks","authors":"J. Lerner, Marian-Gabriel Hâncean","doi":"10.1017/nws.2022.29","DOIUrl":"https://doi.org/10.1017/nws.2022.29","url":null,"abstract":"Abstract We discuss a recently proposed family of statistical network models—relational hyperevent models (RHEMs)—for analyzing team selection and team performance in scientific coauthor networks. The underlying rationale for using RHEM in studies of coauthor networks is that scientific collaboration is intrinsically polyadic, that is, it typically involves teams of any size. Consequently, RHEM specify publication rates associated with hyperedges representing groups of scientists of any size. Going beyond previous work on RHEM for meeting data, we adapt this model family to settings in which relational hyperevents have a dedicated outcome, such as a scientific paper with a measurable impact (e.g., the received number of citations). Relational outcome can on the one hand be used to specify additional explanatory variables in RHEM since the probability of coauthoring may be influenced, for instance, by prior (shared) success of scientists. On the other hand, relational outcome can also serve as a response variable in models seeking to explain the performance of scientific teams. To tackle the latter, we propose relational hyperevent outcome models that are closely related with RHEM to the point that both model families can specify the likelihood of scientific collaboration—and the expected performance, respectively—with the same set of explanatory variables allowing to assess, for instance, whether variables leading to increased collaboration also tend to increase scientific impact. For illustration, we apply RHEM to empirical coauthor networks comprising more than 350,000 published papers by scientists working in three scientific disciplines. Our models explain scientific collaboration and impact by, among others, individual activity (preferential attachment), shared activity (familiarity), triadic closure, prior individual and shared success, and prior success disparity among the members of hyperedges.","PeriodicalId":51827,"journal":{"name":"Network Science","volume":"11 1","pages":"5 - 35"},"PeriodicalIF":1.7,"publicationDate":"2021-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48033553","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Reza Yousefi Nooraie, Bronwyn Thompson, Chelsea D'Silva, I. Zenlea, M. Tabatabaee, Ardavan Mohammad Aghaei
Abstract Thematic analysis of personal networks involves identifying regularities in network structure and content, and grouping networks into types/clusters, to allow for a holistic understanding of social complexities. We propose an inductive approach to network thematic analysis, applying the learnings from qualitative coding, fused mixed-methods analysis, and typology development. It involves framing (changing focus by magnifying, aggregating, and graphical configuration), pattern detection (identification of underlying dimensions, sorting, and clustering), labeling, and triangulating (confirmation and fine-tuning using quantitative and qualitative approaches); applied repeatedly and emergently. We describe this approach utilized in two cases of studying support networks of caregivers.
{"title":"A fused mixed-methods approach to thematic analysis of personal networks: Two case studies of caregiver support networks","authors":"Reza Yousefi Nooraie, Bronwyn Thompson, Chelsea D'Silva, I. Zenlea, M. Tabatabaee, Ardavan Mohammad Aghaei","doi":"10.1017/nws.2021.4","DOIUrl":"https://doi.org/10.1017/nws.2021.4","url":null,"abstract":"Abstract Thematic analysis of personal networks involves identifying regularities in network structure and content, and grouping networks into types/clusters, to allow for a holistic understanding of social complexities. We propose an inductive approach to network thematic analysis, applying the learnings from qualitative coding, fused mixed-methods analysis, and typology development. It involves framing (changing focus by magnifying, aggregating, and graphical configuration), pattern detection (identification of underlying dimensions, sorting, and clustering), labeling, and triangulating (confirmation and fine-tuning using quantitative and qualitative approaches); applied repeatedly and emergently. We describe this approach utilized in two cases of studying support networks of caregivers.","PeriodicalId":51827,"journal":{"name":"Network Science","volume":"9 1","pages":"236 - 253"},"PeriodicalIF":1.7,"publicationDate":"2021-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1017/nws.2021.4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41334640","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract Critical cascades are found in many self-organizing systems. Here, we examine critical cascades as a design paradigm for logic and learning under the linear threshold model (LTM), and simple biologically inspired variants of it as sources of computational power, learning efficiency, and robustness. First, we show that the LTM can compute logic, and with a small modification, universal Boolean logic, examining its stability and cascade frequency. We then frame it formally as a binary classifier and remark on implications for accuracy. Second, we examine the LTM as a statistical learning model, studying benefits of spatial constraints and criticality to efficiency. We also discuss implications for robustness in information encoding. Our experiments show that spatial constraints can greatly increase efficiency. Theoretical investigation and initial experimental results also indicate that criticality can result in a sudden increase in accuracy.
{"title":"Logic and learning in network cascades","authors":"G. Wilkerson, S. Moschoyiannis","doi":"10.1017/nws.2021.3","DOIUrl":"https://doi.org/10.1017/nws.2021.3","url":null,"abstract":"Abstract Critical cascades are found in many self-organizing systems. Here, we examine critical cascades as a design paradigm for logic and learning under the linear threshold model (LTM), and simple biologically inspired variants of it as sources of computational power, learning efficiency, and robustness. First, we show that the LTM can compute logic, and with a small modification, universal Boolean logic, examining its stability and cascade frequency. We then frame it formally as a binary classifier and remark on implications for accuracy. Second, we examine the LTM as a statistical learning model, studying benefits of spatial constraints and criticality to efficiency. We also discuss implications for robustness in information encoding. Our experiments show that spatial constraints can greatly increase efficiency. Theoretical investigation and initial experimental results also indicate that criticality can result in a sudden increase in accuracy.","PeriodicalId":51827,"journal":{"name":"Network Science","volume":"9 1","pages":"S157 - S174"},"PeriodicalIF":1.7,"publicationDate":"2021-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1017/nws.2021.3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42596683","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We create a framework to analyze the timing and frequency of instantaneous interactions between pairs of entities. This type of interaction data is especially common nowadays and easily available. Examples of instantaneous interactions include email networks, phone call networks, and some common types of technological and transportation networks. Our framework relies on a novel extension of the latent position network model: we assume that the entities are embedded in a latent Euclidean space and that they move along individual trajectories which are continuous over time. These trajectories are used to characterize the timing and frequency of the pairwise interactions. We discuss an inferential framework where we estimate the individual trajectories from the observed interaction data and propose applications on artificial and real data.
{"title":"Continuous latent position models for instantaneous interactions","authors":"Riccardo Rastelli, Marco Corneli","doi":"10.1017/nws.2023.14","DOIUrl":"https://doi.org/10.1017/nws.2023.14","url":null,"abstract":"\u0000 We create a framework to analyze the timing and frequency of instantaneous interactions between pairs of entities. This type of interaction data is especially common nowadays and easily available. Examples of instantaneous interactions include email networks, phone call networks, and some common types of technological and transportation networks. Our framework relies on a novel extension of the latent position network model: we assume that the entities are embedded in a latent Euclidean space and that they move along individual trajectories which are continuous over time. These trajectories are used to characterize the timing and frequency of the pairwise interactions. We discuss an inferential framework where we estimate the individual trajectories from the observed interaction data and propose applications on artificial and real data.","PeriodicalId":51827,"journal":{"name":"Network Science","volume":"1 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2021-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45779074","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract Centralities are a widely studied phenomenon in network science. In policy networks, central actors are of interest because they are assumed to control information flows, to link opposing coalitions and to directly impact decision-making. First, we study what type of actor (e.g., state authorities or interest groups) is able to occupy central positions in the highly institutionalized context of policy networks. Second, we then ask whether bonding or bridging centralities prove to be more stable over time. Third, we investigate how these types of centrality influence actors’ positions in a network over time. We therefore adopt a longitudinal perspective and run exponential random graph models, including lagged central network positions at t1 as the main independent variable for actors’ activity and popularity at t2. Results confirm that very few actors are able to maintain central positions over time.
{"title":"The roles actors play in policy networks: Central positions in strongly institutionalized fields","authors":"K. Ingold, M. Fischer, D. Christopoulos","doi":"10.1017/nws.2021.1","DOIUrl":"https://doi.org/10.1017/nws.2021.1","url":null,"abstract":"Abstract Centralities are a widely studied phenomenon in network science. In policy networks, central actors are of interest because they are assumed to control information flows, to link opposing coalitions and to directly impact decision-making. First, we study what type of actor (e.g., state authorities or interest groups) is able to occupy central positions in the highly institutionalized context of policy networks. Second, we then ask whether bonding or bridging centralities prove to be more stable over time. Third, we investigate how these types of centrality influence actors’ positions in a network over time. We therefore adopt a longitudinal perspective and run exponential random graph models, including lagged central network positions at t1 as the main independent variable for actors’ activity and popularity at t2. Results confirm that very few actors are able to maintain central positions over time.","PeriodicalId":51827,"journal":{"name":"Network Science","volume":"9 1","pages":"213 - 235"},"PeriodicalIF":1.7,"publicationDate":"2021-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1017/nws.2021.1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43359000","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：