A crucial step in the analysis of persistent homology is the transformation of data into an appropriate topological object (which, in our case, is a simplicial complex). Software packages for computing persistent homology typically construct Vietoris--Rips or other distance-based simplicial complexes on point clouds because they are relatively easy to compute. We investigate alternative methods of constructing simplicial complexes and the effects of making associated choices during simplicial-complex construction on the output of persistent-homology algorithms. We present two new methods for constructing simplicial complexes from two-dimensional geospatial data (such as maps). We apply these methods to a California precinct-level voting data set, and we thereby demonstrate that our new constructions can capture geometric characteristics that are missed by distancebased constructions. Our new constructions can thus yield more interpretable persistence modules and barcodes for geospatial data. In particular, they are able to distinguish short-persistence features that occur only for a narrow range of distance scales (e.g., voting patterns in densely populated cities) from short-persistence noise by incorporating information about other spatial relationships between regions.
Spatial networks are ubiquitous in social, geographical, physical, and biological applications. To understand the large-scale structure of networks, it is important to develop methods that allow one to directly probe the effects of space on structure and dynamics. Historically, algebraic topology has provided one framework for rigorously and quantitatively describing the global structure of a space, and recent advances in topological data analysis have given scholars a new lens for analyzing network data. In this paper, we study a variety of spatial networks-including both synthetic and natural ones-using topological methods that we developed recently for analyzing spatial systems. We demonstrate that our methods are able to capture meaningful quantities, with specifics that depend on context, in spatial networks and thereby provide useful insights into the structure of those networks. We illustrate these ideas with examples of synthetic networks and dynamics on them, street networks in cities, snowflakes, and webs that were spun by spiders under the influence of various psychotropic substances.
People's opinions evolve with time as they interact with their friends, family, colleagues, and others. In the study of opinion dynamics on networks, one often encodes interactions between people in the form of dyadic relationships, but many social interactions in real life are polyadic (i.e., they involve three or more people). In this paper, we extend an asynchronous bounded-confidence model (BCM) on graphs, in which nodes are connected pairwise by edges, to an asynchronous BCM on hypergraphs, in which arbitrarily many nodes can be connected by a single hyperedge. We show that our hypergraph BCM converges to consensus for a wide range of initial conditions for the opinions of the nodes, including for nonuniform and asymmetric initial opinion distributions. We also show that, under suitable conditions, echo chambers can form on hypergraphs with community structure. We demonstrate that the opinions of nodes can sometimes jump from one opinion cluster to another in a single time step; this phenomenon (which we call ``opinion jumping"") is not possible in standard dyadic BCMs. Additionally, we observe a phase transition in the convergence time of our BCM on a complete hypergraph when the variance \sigma 2 of the initial opinion distribution equals the confidence bound c. We prove that the convergence time grows at least exponentially fast with the number of nodes when \sigma 2 > c and the initial opinions are normally distributed. Therefore, to determine the convergence properties of our hypergraph BCM when the variance and the number of hyperedges are both large, it is necessary to use analytical methods instead of relying only on Monte Carlo simulations.
A crucial step in the analysis of persistent homology is the transformation of data into an appropriate topological object (in our case, a simplicial complex). Modern packages for persistent homology often construct Vietoris-Rips or other distance-based simplicial complexes on point clouds because they are relatively easy to compute. We investigate alternative methods of constructing these complexes and the effects of making associated choices during simplicial-complex construction on the output of persistent-homology algorithms. We present two new methods for constructing simplicial complexes from two-dimensional geospatial data (such as maps). We apply these methods to a California precinct-level voting data set, demonstrating that our new constructions can capture geometric characteristics that are missed by distance-based constructions. Our new constructions can thus yield more interpretable persistence modules and barcodes for geospatial data. In particular, they are able to distinguish short-persistence features that occur only for a narrow range of distance scales (e.g., voting behaviors in densely populated cities) from short-persistence noise by incorporating information about other spatial relationships between precincts.
Individuals who interact with each other in social networks often exchange ideas and influence each other's opinions. A popular approach to studying the dynamics of opinion spread on networks is by examining bounded-confidence (BC) models, in which the nodes of a network have continuous-valued states that encode their opinions and are receptive to other opinions if they lie within some confidence bound of their own opinion. We extend the Deffuant--Weisbuch (DW) model, which is a well-known BC model, by studying opinion dynamics 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 opinion when they interact with a neighboring node and (2) break a connection with a neighbor based on an opinion tolerance threshold and then form a new connection to a node following the principle of homophily. This opinion tolerance threshold acts as a threshold to determine if the opinions of adjacent nodes are sufficiently different to be viewed as discordant. We find that our adaptive BC model requires a larger confidence bound than the standard DW model for the nodes of a network to achieve a consensus. Interestingly, our model includes regions with `pseudo-consensus' steady states, in which there exist two subclusters within an opinion-consensus group that deviate from each other by a small amount. We conduct extensive numerical simulations of our adaptive BC model and examine the importance of early-time dynamics and nodes with initial moderate opinions for achieving consensus. We also examine the effects of coevolution on the convergence time of the dynamics.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.