The centrality measures of the nodes and edges of the street networks are related to various urban phenomena. In particular, betweenness centrality correlates with the spatial distribution of economic activities, the levels of congestion, and the structural changes in cities. In this work, we study how betweenness tends to concentrate in a small set of edges and develop a model to analyse this concentration throughout the growth of graphs. We show that random planar graphs tend to betweenness concentration as the number of nodes increases. The evolution of Paris and Tijuana street networks shows the same behaviour but at a higher rate. A set of 300 street networks worldwide follows a similar relationship between the number of nodes and the betweenness concentration. We find a significant correlation between congestion ranks and betweenness concentration.
{"title":"The concentration of edge betweenness in the evolution of planar graphs and street networks","authors":"J A Pichardo-Corpus","doi":"10.1093/comnet/cnad004","DOIUrl":"https://doi.org/10.1093/comnet/cnad004","url":null,"abstract":"The centrality measures of the nodes and edges of the street networks are related to various urban phenomena. In particular, betweenness centrality correlates with the spatial distribution of economic activities, the levels of congestion, and the structural changes in cities. In this work, we study how betweenness tends to concentrate in a small set of edges and develop a model to analyse this concentration throughout the growth of graphs. We show that random planar graphs tend to betweenness concentration as the number of nodes increases. The evolution of Paris and Tijuana street networks shows the same behaviour but at a higher rate. A set of 300 street networks worldwide follows a similar relationship between the number of nodes and the betweenness concentration. We find a significant correlation between congestion ranks and betweenness concentration.","PeriodicalId":15442,"journal":{"name":"Journal of complex networks","volume":"11 2","pages":"1-10"},"PeriodicalIF":2.1,"publicationDate":"2023-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49937035","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
F. Bauza, G. Ruiz-Manzanares, J. Gómez-Gardeñes, A. Tarancón, D. Iñiguez
Community detection theory is vital for the structural analysis of many types of complex networks, especially for human-like collaboration networks. In this work, we present a new community detection algorithm, the Targeted Community Merging algorithm, based on the well-known Girvan–Newman algorithm, which allows obtaining community partitions with high values of modularity and a small number of communities. We then perform an analysis and comparison between the departmental and community structure of scientific collaboration networks within the University of Zaragoza. Thus, we draw valuable conclusions from the inter- and intra-departmental collaboration structure that could be useful to take decisions on an eventual departmental restructuring.
{"title":"Targeted Community Merging provides an efficient comparison between collaboration clusters and departmental partitions","authors":"F. Bauza, G. Ruiz-Manzanares, J. Gómez-Gardeñes, A. Tarancón, D. Iñiguez","doi":"10.1093/comnet/cnad012","DOIUrl":"https://doi.org/10.1093/comnet/cnad012","url":null,"abstract":"\u0000 Community detection theory is vital for the structural analysis of many types of complex networks, especially for human-like collaboration networks. In this work, we present a new community detection algorithm, the Targeted Community Merging algorithm, based on the well-known Girvan–Newman algorithm, which allows obtaining community partitions with high values of modularity and a small number of communities. We then perform an analysis and comparison between the departmental and community structure of scientific collaboration networks within the University of Zaragoza. Thus, we draw valuable conclusions from the inter- and intra-departmental collaboration structure that could be useful to take decisions on an eventual departmental restructuring.","PeriodicalId":15442,"journal":{"name":"Journal of complex networks","volume":"62 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2023-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74318322","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Complex network is a versatile tool for exploring the internal structures and dynamical properties of complex system. The Earth's climate is a typical complex system, and the climate variability is mainly controlled by Sun–Earth interactions on planetary scales. The Earth's rotation could induce Rossby waves, and the oceanic Rossby waves significantly affect the Earth's climate in turn. In this study, climate network, a kind of complex network for climate sciences, has been applied to detect Rossby waves in extratropics of global oceans. The nodes of the climate networks are the regular grid points zonally distributed in four regions of global oceans (North Pacific, South Pacific, North Atlantic and South Atlantic-Indian), and the links represent the statistically significant cross-correlations of sea level anomalies. The results show that the westward propagation of oceanic Rossby waves in the extratropics could be detected by the climate network. Also, the climate network has the potential to detect the more oceanic dynamics.
{"title":"Detection of oceanic Rossby waves in the extratropics by complex networks","authors":"Meng Gao;Aidi Zhang;Han Zhang;Yueqi Wang","doi":"10.1093/comnet/cnad003","DOIUrl":"https://doi.org/10.1093/comnet/cnad003","url":null,"abstract":"Complex network is a versatile tool for exploring the internal structures and dynamical properties of complex system. The Earth's climate is a typical complex system, and the climate variability is mainly controlled by Sun–Earth interactions on planetary scales. The Earth's rotation could induce Rossby waves, and the oceanic Rossby waves significantly affect the Earth's climate in turn. In this study, climate network, a kind of complex network for climate sciences, has been applied to detect Rossby waves in extratropics of global oceans. The nodes of the climate networks are the regular grid points zonally distributed in four regions of global oceans (North Pacific, South Pacific, North Atlantic and South Atlantic-Indian), and the links represent the statistically significant cross-correlations of sea level anomalies. The results show that the westward propagation of oceanic Rossby waves in the extratropics could be detected by the climate network. Also, the climate network has the potential to detect the more oceanic dynamics.","PeriodicalId":15442,"journal":{"name":"Journal of complex networks","volume":"11 1","pages":"175-308"},"PeriodicalIF":2.1,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49961484","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Liquid water, besides being fundamental for life on Earth, has long fascinated scientists due to several anomalies. Different hypotheses have been put forward to explain these peculiarities. The most accredited one foresees the presence in the supercooled region of two phases at different densities: the low-density liquid phase and the high-density liquid phase. In our previous work [Faccio et al. (2022), J. Mol. Liq., 355, 118922], we showed that it is possible to identify these two forms in water networks through a computational approach based on molecular dynamics simulation and on the calculation of the total communicability of the associated graph, in which the nodes correspond to water molecules and the edges represent the connections (interactions) between molecules. In this article, we present a more in-depth investigation of the application of graph-theory based approaches to the analysis of the structure of water networks. In particular, we investigate different connectivity and centrality measures and we report on the use of a variety of global metrics aimed at giving a topological and geometrical characterization of liquid water.
液态水除了是地球生命的基础外，还因其一些异常现象而长期吸引着科学家。人们提出了不同的假设来解释这些特性。最可信的一种预测在过冷区存在两种不同密度的相:低密度液相和高密度液相。在我们之前的工作[Faccio et al. (2022)， J. Mol. Liq.， 355, 118922]中，我们表明，可以通过基于分子动力学模拟和关联图的总可通通性计算的计算方法来识别水网络中的这两种形式，其中节点对应于水分子，边缘代表分子之间的连接(相互作用)。在本文中，我们对基于图论的方法在水网络结构分析中的应用进行了更深入的研究。特别是，我们研究了不同的连通性和中心性度量，并报告了各种旨在给出液态水的拓扑和几何特征的全局度量的使用。
{"title":"Structural analysis of water networks","authors":"Michele Benzi;Isabella Daidone;Chiara Faccio;Laura Zanetti-Polzi","doi":"10.1093/comnet/cnad001","DOIUrl":"https://doi.org/10.1093/comnet/cnad001","url":null,"abstract":"Liquid water, besides being fundamental for life on Earth, has long fascinated scientists due to several anomalies. Different hypotheses have been put forward to explain these peculiarities. The most accredited one foresees the presence in the supercooled region of two phases at different densities: the low-density liquid phase and the high-density liquid phase. In our previous work [Faccio et al. (2022), J. Mol. Liq., 355, 118922], we showed that it is possible to identify these two forms in water networks through a computational approach based on molecular dynamics simulation and on the calculation of the total communicability of the associated graph, in which the nodes correspond to water molecules and the edges represent the connections (interactions) between molecules. In this article, we present a more in-depth investigation of the application of graph-theory based approaches to the analysis of the structure of water networks. In particular, we investigate different connectivity and centrality measures and we report on the use of a variety of global metrics aimed at giving a topological and geometrical characterization of liquid water.","PeriodicalId":15442,"journal":{"name":"Journal of complex networks","volume":"11 1","pages":"334-343"},"PeriodicalIF":2.1,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49961485","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Miguel E P Silva;Robert E Gaunt;Luis Ospina-Forero;Caroline Jay;Thomas House
Network comparison is a widely used tool for analysing complex systems, with applications in varied domains including comparison of protein interactions or highlighting changes in structure of trade networks. In recent years, a number of network comparison methodologies based on the distribution of graphlets (small connected network subgraphs) have been introduced. In particular, NetEmd has recently achieved state of the art performance in undirected networks. In this work, we propose an extension of NetEmd to directed networks and deal with the significant increase in complexity of graphlet structure in the directed case by denoising through linear projections. Simulation results show that our framework is able to improve on the performance of a simple translation of the undirected NetEmd algorithm to the directed case, especially when networks differ in size and density.
{"title":"Comparing directed networks via denoising graphlet distributions","authors":"Miguel E P Silva;Robert E Gaunt;Luis Ospina-Forero;Caroline Jay;Thomas House","doi":"10.1093/comnet/cnad006","DOIUrl":"https://doi.org/10.1093/comnet/cnad006","url":null,"abstract":"Network comparison is a widely used tool for analysing complex systems, with applications in varied domains including comparison of protein interactions or highlighting changes in structure of trade networks. In recent years, a number of network comparison methodologies based on the distribution of graphlets (small connected network subgraphs) have been introduced. In particular, NetEmd has recently achieved state of the art performance in undirected networks. In this work, we propose an extension of NetEmd to directed networks and deal with the significant increase in complexity of graphlet structure in the directed case by denoising through linear projections. Simulation results show that our framework is able to improve on the performance of a simple translation of the undirected NetEmd algorithm to the directed case, especially when networks differ in size and density.","PeriodicalId":15442,"journal":{"name":"Journal of complex networks","volume":"11 2","pages":"151-158"},"PeriodicalIF":2.1,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49937037","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Complex networks encoding the topological architecture of real-world complex systems have recently been undergoing a fundamental transition beyond pairwise interactions described by dyadic connections among nodes. Higher-order structures such as hypergraphs and simplicial complexes have been utilized to model group interactions for varied networked systems from brain, society, to biological and physical systems. In this article, we investigate the consensus dynamics over temporal hypergraphs featuring non-linear modulating functions, time-dependent topology and random perturbations. Based upon analytical tools in matrix, hypergraph, stochastic process and real analysis, we establish the sufficient conditions for all nodes in the network to reach consensus in the sense of almost sure convergence and $mathscr{L}^2$ convergence. The rate of consensus and the moments of the equilibrium have been determined. Our results offer a theoretical foundation for the recent series of numerical studies and physical observations in the multi-body non-linear dynamical systems.
{"title":"Non-linear consensus dynamics on temporal hypergraphs with random noisy higher-order interactions","authors":"Yilun Shang","doi":"10.1093/comnet/cnad009","DOIUrl":"https://doi.org/10.1093/comnet/cnad009","url":null,"abstract":"Complex networks encoding the topological architecture of real-world complex systems have recently been undergoing a fundamental transition beyond pairwise interactions described by dyadic connections among nodes. Higher-order structures such as hypergraphs and simplicial complexes have been utilized to model group interactions for varied networked systems from brain, society, to biological and physical systems. In this article, we investigate the consensus dynamics over temporal hypergraphs featuring non-linear modulating functions, time-dependent topology and random perturbations. Based upon analytical tools in matrix, hypergraph, stochastic process and real analysis, we establish the sufficient conditions for all nodes in the network to reach consensus in the sense of almost sure convergence and \u0000<tex>$mathscr{L}^2$</tex>\u0000 convergence. The rate of consensus and the moments of the equilibrium have been determined. Our results offer a theoretical foundation for the recent series of numerical studies and physical observations in the multi-body non-linear dynamical systems.","PeriodicalId":15442,"journal":{"name":"Journal of complex networks","volume":"11 2","pages":"509-512"},"PeriodicalIF":2.1,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/8016804/10056757/10091815.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49937039","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We introduce L-hydra (landmarked hyperbolic distance recovery and approximation), a method for embedding network- or distance-based data into hyperbolic space, which requires only the distance measurements to a few ‘landmark nodes’. This landmark heuristic makes L-hydra applicable to large-scale graphs and improves upon previously introduced methods. As a mathematical justification, we show that a point configuration in $d$ -dimensional hyperbolic space can be perfectly recovered (up to isometry) from distance measurements to just $d+1$ landmarks. We also show that L-hydra solves a two-stage strain-minimization problem, similar to our previous (unlandmarked) method ‘hydra’. Testing on real network data, we show that L-hydra is an order of magnitude faster than the existing hyperbolic embedding methods and scales linearly in the number of nodes. While the embedding error of L-hydra is higher than the error of the existing methods, we introduce an extension, L-hydra+, which outperforms the existing methods in both runtime and embedding quality.
{"title":"Strain-minimizing hyperbolic network embeddings with landmarks","authors":"Martin Keller-Ressel;Stephanie Nargang","doi":"10.1093/comnet/cnad002","DOIUrl":"https://doi.org/10.1093/comnet/cnad002","url":null,"abstract":"We introduce L-hydra (landmarked hyperbolic distance recovery and approximation), a method for embedding network- or distance-based data into hyperbolic space, which requires only the distance measurements to a few ‘landmark nodes’. This landmark heuristic makes L-hydra applicable to large-scale graphs and improves upon previously introduced methods. As a mathematical justification, we show that a point configuration in \u0000<tex>$d$</tex>\u0000-dimensional hyperbolic space can be perfectly recovered (up to isometry) from distance measurements to just \u0000<tex>$d+1$</tex>\u0000 landmarks. We also show that L-hydra solves a two-stage strain-minimization problem, similar to our previous (unlandmarked) method ‘hydra’. Testing on real network data, we show that L-hydra is an order of magnitude faster than the existing hyperbolic embedding methods and scales linearly in the number of nodes. While the embedding error of L-hydra is higher than the error of the existing methods, we introduce an extension, L-hydra+, which outperforms the existing methods in both runtime and embedding quality.","PeriodicalId":15442,"journal":{"name":"Journal of complex networks","volume":"11 1","pages":"537-211"},"PeriodicalIF":2.1,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49961487","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Graphs have become crucial for representing and examining biological, social and technological interactions. In this context, the graph spectrum is an exciting feature to be studied because it encodes the structural and dynamic characteristics of the graph. Hence, it becomes essential to efficiently compute the graph's spectral distribution (eigenvalue's density function). Recently, some authors proposed degree-based methods to obtain the spectral density of locally tree-like networks in linear time. The bottleneck of their approach is that they assumed that the graph's assortativity is zero. However, most real-world networks, such as social and biological networks, present assortativity. Consequently, their spectral density approximations may be inaccurate. Here, we propose a method that considers assortativity. Our algorithm's time and space complexities are $mathscr{O}(d_{max}^{2})$ , where $d_{max}$ is the largest degree of the graph. Finally, we show our method's efficacy in simulated and empirical networks.
{"title":"A fast algorithm to approximate the spectral density of locally tree-like networks with assortativity","authors":"Grover E C Guzman;André Fujita","doi":"10.1093/comnet/cnad005","DOIUrl":"https://doi.org/10.1093/comnet/cnad005","url":null,"abstract":"Graphs have become crucial for representing and examining biological, social and technological interactions. In this context, the graph spectrum is an exciting feature to be studied because it encodes the structural and dynamic characteristics of the graph. Hence, it becomes essential to efficiently compute the graph's spectral distribution (eigenvalue's density function). Recently, some authors proposed degree-based methods to obtain the spectral density of locally tree-like networks in linear time. The bottleneck of their approach is that they assumed that the graph's assortativity is zero. However, most real-world networks, such as social and biological networks, present assortativity. Consequently, their spectral density approximations may be inaccurate. Here, we propose a method that considers assortativity. Our algorithm's time and space complexities are \u0000<tex>$mathscr{O}(d_{max}^{2})$</tex>\u0000, where \u0000<tex>$d_{max}$</tex>\u0000 is the largest degree of the graph. Finally, we show our method's efficacy in simulated and empirical networks.","PeriodicalId":15442,"journal":{"name":"Journal of complex networks","volume":"11 2","pages":"187-211"},"PeriodicalIF":2.1,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49937038","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this article, we studied the role of the topological structure of semantic networking in creating verbal aggression. It is shown that centralities such as degree, betweenness and closeness play an important role in the activation of verbal aggression in the network. We have also shown that aggressive labelled nodes with spectral clustering in different spectra are often divided into two groups, with the larger group activating more aggressive labelled nodes. In addition, the parameter of eccentric distribution from the origin is introduced to study the dispersion of aggressive nodes around the specific nodes. Hence, studying two networks with different contexts shows that the dispersion of nodes with aggressive labelling around the network's hub, as the centre of the network with political context, is much more than artistic context. In addition, different clusters of verbal aggression in the political and artistic context have the same pattern of frequency. In addition, we investigated semantic features in creating verbal aggression, showing that non-aggressive words are prone to create verbal aggression as much as aggressive words.
{"title":"The role of network topological structure and semantic features in creating verbal aggression","authors":"Meghdad Abarghouei Nejad;Salman Abarghouei Nejad;Azizollah Memariani;Masoud Asadpour;Javad Hatami;Mohammad Mahdi Kashani","doi":"10.1093/comnet/cnac056","DOIUrl":"https://doi.org/10.1093/comnet/cnac056","url":null,"abstract":"In this article, we studied the role of the topological structure of semantic networking in creating verbal aggression. It is shown that centralities such as degree, betweenness and closeness play an important role in the activation of verbal aggression in the network. We have also shown that aggressive labelled nodes with spectral clustering in different spectra are often divided into two groups, with the larger group activating more aggressive labelled nodes. In addition, the parameter of eccentric distribution from the origin is introduced to study the dispersion of aggressive nodes around the specific nodes. Hence, studying two networks with different contexts shows that the dispersion of nodes with aggressive labelling around the network's hub, as the centre of the network with political context, is much more than artistic context. In addition, different clusters of verbal aggression in the political and artistic context have the same pattern of frequency. In addition, we investigated semantic features in creating verbal aggression, showing that non-aggressive words are prone to create verbal aggression as much as aggressive words.","PeriodicalId":15442,"journal":{"name":"Journal of complex networks","volume":"11 1","pages":"79-88"},"PeriodicalIF":2.1,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49961483","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Individuals who interact with each other in social networks often exchange ideas and influence each other's opinions. A popular approach to study the spread of opinions on networks is by examining bounded-confidence models (BCMs), in which the nodes of a network have continuous-valued states that encode their opinions and are receptive to other nodes’ opinions when they lie within some confidence bound of their own opinion. In this article, we extend the Deffuant–Weisbuch (DW) model, which is a well-known BCM, by examining the spread of opinions that coevolve with network structure. We propose an adaptive variant of the DW model in which the nodes of a network can (1) alter their opinions when they interact with neighbouring nodes and (2) break connections with neighbours based on an opinion tolerance threshold and then form new connections following the principle of homophily. This opinion tolerance threshold determines whether or not the opinions of adjacent nodes are sufficiently different to be viewed as ‘discordant’. Using numerical simulations, we find that our adaptive DW model requires a larger confidence bound than a baseline DW model for the nodes of a network to achieve a consensus opinion. In one region of parameter space, we observe ‘pseudo-consensus’ steady states, in which there exist multiple subclusters of an opinion cluster with opinions that differ from each other by a small amount. In our simulations, we also examine the roles of early-time dynamics and nodes with initially moderate opinions for achieving consensus. Additionally, we explore the effects of coevolution on the convergence time of our BCM.
{"title":"An adaptive bounded-confidence model of opinion dynamics on networks","authors":"Unchitta Kan;Michelle Feng;Mason A Porter","doi":"10.1093/comnet/cnac055","DOIUrl":"https://doi.org/10.1093/comnet/cnac055","url":null,"abstract":"Individuals who interact with each other in social networks often exchange ideas and influence each other's opinions. A popular approach to study the spread of opinions on networks is by examining bounded-confidence models (BCMs), in which the nodes of a network have continuous-valued states that encode their opinions and are receptive to other nodes’ opinions when they lie within some confidence bound of their own opinion. In this article, we extend the Deffuant–Weisbuch (DW) model, which is a well-known BCM, by examining the spread of opinions that coevolve with network structure. We propose an adaptive variant of the DW model in which the nodes of a network can (1) alter their opinions when they interact with neighbouring nodes and (2) break connections with neighbours based on an opinion tolerance threshold and then form new connections following the principle of homophily. This opinion tolerance threshold determines whether or not the opinions of adjacent nodes are sufficiently different to be viewed as ‘discordant’. Using numerical simulations, we find that our adaptive DW model requires a larger confidence bound than a baseline DW model for the nodes of a network to achieve a consensus opinion. In one region of parameter space, we observe ‘pseudo-consensus’ steady states, in which there exist multiple subclusters of an opinion cluster with opinions that differ from each other by a small amount. In our simulations, we also examine the roles of early-time dynamics and nodes with initially moderate opinions for achieving consensus. Additionally, we explore the effects of coevolution on the convergence time of our BCM.","PeriodicalId":15442,"journal":{"name":"Journal of complex networks","volume":"11 1","pages":"415-444"},"PeriodicalIF":2.1,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/8016804/10068397/10068398.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49961486","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：