arXiv subjects

Shan He

Publications and source records attributed to Shan He.

41 records · Page 3Linked to original sources

arXiv2018

Quantifying memories: mapping urban perception

What people choose to see, like, or remember is of profound interest to city planners and architects. Previous research suggests what people are more likely to store in their memory - buildings with dominant shapes and bright colors, historical sites, and intruding signs - yet little has been done by the systematic survey. This paper attempts to understand the relationships between the spatial structure of the built environment and inhabitants' memory of the city derived from their perceptual knowledge. For this purpose, we employed the web-based visual survey in the form of a geo-guessing game. This enables us to externalize people's spatial knowledge as a large-scale dataset. The result sheds light on unknown aspects of the cognitive role in exploring the built environment, and hidden patterns embedded in the relationship between the spatial elements and the mental map.

physics.soc-ph↗

arXiv2016

MODA: MOdule Differential Analysis for weighted gene co-expression network

Gene co-expression network differential analysis is designed to help biologists understand gene expression patterns under different condition. By comparing different gene co-expression networks we may find conserved part as well as condition specific set of genes. Taking the network as a collection as modules, we use a sample-saving method to construct condition-specific gene co-expression network, and identify differentially expressed subnetworks as conserved or condition specific modules which may be associated with biological processes. We have implemented the method as an R package which establishes a pipeline from expression profile to biological explanations. The usefulness of the method is also demonstrated by synthetic data as well as Daphnia magna gene expression data under different environmental stresses.

q-bio.QM↗

arXiv2009

Integrating fluctuations into distribution of resources in transportation networks

We propose a resource distribution strategy to reduce the average travel time in a transportation network given a fixed generation rate. Suppose that there are essential resources to avoid congestion in the network as well as some extra resources. The strategy distributes the essential resources by the average loads on the vertices and integrates the fluctuations of the instantaneous loads into the distribution of the extra resources. The fluctuations are calculated with the assumption of unlimited resources, where the calculation is incorporated into the calculation of the average loads without adding to the time complexity. Simulation results show that the fluctuation-integrated strategy provides shorter average travel time than a previous distribution strategy while keeping similar robustness. The strategy is especially beneficial when the extra resources are scarce and the network is heterogeneous and lowly loaded.

cond-mat.stat-mech↗

arXiv2008

Effect of edge removal on topological and functional robustness of complex networks

We study the robustness of complex networks subject to edge removal. Several network models and removing strategies are simulated. Rather than the existence of the giant component, we use total connectedness as the criterion of breakdown. The network topologies are introduced a simple traffic dynamics and the total connectedness is interpreted not only in the sense of topology but also in the sense of function. We define the topological robustness and the functional robustness, investigate their combined effect and compare their relative importance to each other. The results of our study provide an alternative view of the overall robustness and highlight efficient ways to improve the robustness of the network models.

physics.soc-ph↗

arXiv2006

Effective delivering capacity in traffic dynamics based on scale-free network

We investigate the percentage of delivering capacities that are actually consumed in a typical traffic dynamics where the capacities are uniformly assigned over a scale-free network. Theoretical analysis, as well as simulations, reveal that there are a large number of idle nodes under both free and weak congested state of the network. It is worth noting that there is a critical value of effective betweenness to classify nodes in the congested state, below which the node has a constant queue size but above which the queue size increases with time. We also show that the consumption ratio of delivering capacities can be boosted to nearly 100% by adopting a proper distribution of the capacities, which at the same time enhances the network efficiency to the maximum for the current routing strategy.

cond-mat.stat-mech↗