On the use of random graphs in analysing resource utilization in urban systems.
Ontology highlight
ABSTRACT:
SUBMITTER: Arbabi H
PROVIDER: S-EPMC7211871 | biostudies-literature | 2020 Apr
REPOSITORIES: biostudies-literature
Publications
On the use of random graphs in analysing resource utilization in urban systems.
Arbabi Hadi H Punzo Giuliano G Meyers Gregory G Tan Ling Min LM Li Qianqian Q Densley Tingley Danielle D Mayfield Martin M
Royal Society open science 20200415 4
Urban resource models increasingly rely on implicit network formulations. Resource consumption behaviours documented in the existing empirical studies are ultimately by-products of the network abstractions underlying these models. Here, we present an analytical formulation and examination of a generic demand-driven network model that accounts for the effectiveness of resource utilization and its implications for policy levers in addressing resource management in cities. We establish simple limit ...[more]
Similar Datasets
Project description:With increasing populations, mounting environmental pressures and aging infrastructure, urban water and wastewater utilities have to make investment decisions limited by both economic and environmental constraints. The challenges facing urban water systems can no longer be sustainably solved by traditional siloed water management approaches. A central premise of contemporary urban water management paradigms is that in order for urban water systems to be more sustainable and economical, an improvement in resource use efficiency at system level must be achieved. This study provides a quantification of the total resource use of a typical urban water system exemplified in Greater Cincinnati region from raw water extraction for drinking water to wastewater treatment and discharge, providing a better understanding of resource expenditure distributions within the system and a necessary benchmark to which future system improvements can be compared. The emergy methodology was used so that the total environmental work required to produce disparate system inputs could be expressed using a common unit. The results were compared to the concurring life cycle assessment (LCA) and life cycle costing (LCC) results of the same system. Emergy results highlight drinking water treatment and drinking water distribution as two resource-intensive stages, with energy for pumping and chemicals for conditioning representing the greatest inputs to the former and energy for pumping and metals for piping representing the greatest inputs to the latter. For wastewater collection and treatment stages, aeration and sludge handling were identified as the highest emergy unit processes, mostly due to energy use. Comparison with LCA results substantiate the environmental concerns associated with energy use in the drinking water treatment and distribution stages but indicate that environmental burdens associated with infrastructure are more dependent upon upstream resource use rather than downstream environmental impact. Results from emergy, LCA and LCC point towards aeration and sludge handling as two unit processes on the wastewater side that are particularly costly and environmentally impactful. Results in total are used to suggest alternative strategies that can alleviate identified environmental burdens and economic costs.
| S-EPMC6415548 | biostudies-literature
Project description:We investigate the two-word Naming Game on two-dimensional random geometric graphs. Studying this model advances our understanding of the spatial distribution and propagation of opinions in social dynamics. A main feature of this model is the spontaneous emergence of spatial structures called opinion domains which are geographic regions with clear boundaries within which all individuals share the same opinion. We provide the mean-field equation for the underlying dynamics and discuss several properties of the equation such as the stationary solutions and two-time-scale separation. For the evolution of the opinion domains we find that the opinion domain boundary propagates at a speed proportional to its curvature. Finally we investigate the impact of committed agents on opinion domains and find the scaling of consensus time.
| S-EPMC4081874 | biostudies-other
Project description:The study aims to analyse key determinants of urban and peri-urban youth employment in agribusiness in Malawi to support youth policies. A mixed-methods approach is used, which combines both quantitative and qualitative analyses. The quantitative method involved a Bivariate Logit Model and Multinomial Logit Model to analyse nationally representative survey data from the Fourth Integrated Household Survey in 2016-2017. The qualitative method employed thematic analysis to data generated through Focus Group Discussions and Key Informant Interviews for key stakeholders involved in agri-business in Lilongwe district. The qualitative analysis, which focuses on a case study for urban and peri-urban youth in agribusiness, was used to validate, and provide context for the quantitative analysis. The results revealed that a majority of the urban and peri-urban youth engaged in agribusiness across Malawi work in sole farming (family farms or ganyu); in addition, women outnumber men in terms of engagement in agribusiness, and this stems from tradition. In addition, the determinants that affect youth's engagement in agribusiness consist of demographic factors, institutional support, assets, and shocks. It was also shown that men were more likely than women to be engaged in sole farming, but they were as likely as women to be engaged in other forms of agribusiness. The policy recommendation from this study is that programs aimed at supporting youth engagement in agribusiness should consider a variety of factors; If resources are limited, the programs should ensure that they offer capacity strengthening for the youth in the form of extension services and practical training in agribusiness.
| S-EPMC10513215 | biostudies-literature
Project description:BackgroundCommunity structure is ubiquitous in biological networks. There has been an increased interest in unraveling the community structure of biological systems as it may provide important insights into a system's functional components and the impact of local structures on dynamics at a global scale. Choosing an appropriate community detection algorithm to identify the community structure in an empirical network can be difficult, however, as the many algorithms available are based on a variety of cost functions and are difficult to validate. Even when community structure is identified in an empirical system, disentangling the effect of community structure from other network properties such as clustering coefficient and assortativity can be a challenge.ResultsHere, we develop a generative model to produce undirected, simple, connected graphs with a specified degrees and pattern of communities, while maintaining a graph structure that is as random as possible. Additionally, we demonstrate two important applications of our model: (a) to generate networks that can be used to benchmark existing and new algorithms for detecting communities in biological networks; and (b) to generate null models to serve as random controls when investigating the impact of complex network features beyond the byproduct of degree and modularity in empirical biological networks.ConclusionOur model allows for the systematic study of the presence of community structure and its impact on network function and dynamics. This process is a crucial step in unraveling the functional consequences of the structural properties of biological systems and uncovering the mechanisms that drive these systems.
| S-EPMC4094994 | biostudies-literature
Project description:Extracting network-based functional relationships within genomic datasets is an important challenge in the computational analysis of large-scale data. Although many methods, both public and commercial, have been developed, the problem of identifying networks of interactions that are most relevant to the given input data still remains an open issue. Here, we have leveraged the method of random walks on graphs as a powerful platform for scoring network components based on simultaneous assessment of the experimental data as well as local network connectivity. Using this method, NetWalk, we can calculate distribution of Edge Flux values associated with each interaction in the network, which reflects the relevance of interactions based on the experimental data. We show that network-based analyses of genomic data are simpler and more accurate using NetWalk than with some of the currently employed methods. We also present NetWalk analysis of microarray gene expression data from MCF7 cells exposed to different doses of doxorubicin, which reveals a switch-like pattern in the p53 regulated network in cell cycle arrest and apoptosis. Our analyses demonstrate the use of NetWalk as a valuable tool in generating high-confidence hypotheses from high-content genomic data.
| S-EPMC2924243 | biostudies-literature
Project description:Branching processes are used to model diverse social and physical scenarios, from extinction of family names to nuclear fission. However, for a better description of natural phenomena, such as viral epidemics in cellular tissues, animal populations and social networks, a spatial embedding-the branching random walk (BRW)-is required. Despite its wide range of applications, the properties of the volume explored by the BRW so far remained elusive, with exact results limited to one dimension. Here we present analytical results, supported by numerical simulations, on the scaling of the volume explored by a BRW in the critical regime, the onset of epidemics, in general environments. Our results characterise the spreading dynamics on regular lattices and general graphs, such as fractals, random trees and scale-free networks, revealing the direct relation between the graphs' dimensionality and the rate of propagation of the viral process. Furthermore, we use the BRW to determine the spectral properties of real social and metabolic networks, where we observe that a lack of information of the network structure can lead to differences in the observed behaviour of the spreading process. Our results provide observables of broad interest for the characterisation of real world lattices, tissues, and networks.
| S-EPMC6821755 | biostudies-literature
Project description:Bee populations are currently undergoing severe global declines driven by the interactive effects of a number of factors. Ongoing urbanisation has the potential to exacerbate bee declines, unless steps are taken to ensure appropriate floral resources are available. Sown wildflower strips are one way in which floral resources can be provided to urban bees. However, the use of these strips by pollinators in urban environments remains little studied. Here, we employ pollen metabarcoding of the rbcL gene to compare the foraging patterns of different bee species observed using urban sown wildflower strips in July 2016, with a goal of identifying which plant species are most important for bees. We also demonstrate the use of a non-destructive method of pollen collection. Bees were found to forage on a wide variety of plant genera and families, including a diverse range of plants from outside the wildflower plots, suggesting that foragers visiting sown wildflower strips also utilize other urban habitats. Particular plants within the wildflower strips dominated metabarcoding data, particularly Papaver rhoeas and Phacelia tanacetifolia. Overall, we demonstrate that pollinators observed in sown wildflower strips use certain sown foodplants as part of a larger urban matrix.
| S-EPMC6385686 | biostudies-literature
Project description:In 2004, we presented a web resource for stimulating the search for novel RNAs, RNA-As-Graphs (RAG), which classified, catalogued, and predicted RNA secondary structure motifs using clustering and build-up approaches. With the increased availability of secondary structures in recent years, we update the RAG resource and provide various improvements for analyzing RNA structures.Our RAG update includes a new supervised clustering algorithm that can suggest RNA motifs that may be "RNA-like". We use this utility to describe RNA motifs as three classes: existing, RNA-like, and non-RNA-like. This produces 126 tree and 16,658 dual graphs as candidate RNA-like topologies using the supervised clustering algorithm with existing RNAs serving as the training data. A comparison of this clustering approach to an earlier method shows considerable improvements. Additional RAG features include greatly expanded search capabilities, an interface to better utilize the benefits of relational database, and improvements to several of the utilities such as directed/labeled graphs and a subgraph search program.The RAG updates presented here augment the database's intended function - stimulating the search for novel RNA functionality - by classifying available motifs, suggesting new motifs for design, and allowing for more specific searches for specific topologies. The updated RAG web resource offers users a graph-based tool for exploring available RNA motifs and suggesting new RNAs for design.
| S-EPMC3123240 | biostudies-literature
Project description:We present a message-passing algorithm to solve a series of edge-disjoint path problems on graphs based on the zero-temperature cavity equations. Edge-disjoint paths problems are important in the general context of routing, that can be defined by incorporating under a unique framework both traffic optimization and total path length minimization. The computation of the cavity equations can be performed efficiently by exploiting a mapping of a generalized edge-disjoint path problem on a star graph onto a weighted maximum matching problem. We perform extensive numerical simulations on random graphs of various types to test the performance both in terms of path length minimization and maximization of the number of accommodated paths. In addition, we test the performance on benchmark instances on various graphs by comparison with state-of-the-art algorithms and results found in the literature. Our message-passing algorithm always outperforms the others in terms of the number of accommodated paths when considering non trivial instances (otherwise it gives the same trivial results). Remarkably, the largest improvement in performance with respect to the other methods employed is found in the case of benchmarks with meshes, where the validity hypothesis behind message-passing is expected to worsen. In these cases, even though the exact message-passing equations do not converge, by introducing a reinforcement parameter to force convergence towards a sub optimal solution, we were able to always outperform the other algorithms with a peak of 27% performance improvement in terms of accommodated paths. On random graphs, we numerically observe two separated regimes: one in which all paths can be accommodated and one in which this is not possible. We also investigate the behavior of both the number of paths to be accommodated and their minimum total length.
| S-EPMC4699204 | biostudies-literature
Project description:Random geometric graphs in hyperbolic spaces explain many common structural and dynamical properties of real networks, yet they fail to predict the correct values of the exponents of power-law degree distributions observed in real networks. In that respect, random geometric graphs in asymptotically de Sitter spacetimes, such as the Lorentzian spacetime of our accelerating universe, are more attractive as their predictions are more consistent with observations in real networks. Yet another important property of hyperbolic graphs is their navigability, and it remains unclear if de Sitter graphs are as navigable as hyperbolic ones. Here we study the navigability of random geometric graphs in three Lorentzian manifolds corresponding to universes filled only with dark energy (de Sitter spacetime), only with matter, and with a mixture of dark energy and matter. We find these graphs are navigable only in the manifolds with dark energy. This result implies that, in terms of navigability, random geometric graphs in asymptotically de Sitter spacetimes are as good as random hyperbolic graphs. It also establishes a connection between the presence of dark energy and navigability of the discretized causal structure of spacetime, which provides a basis for a different approach to the dark energy problem in cosmology.
| S-EPMC5562713 | biostudies-literature