Search

Beepath a les escoles és un projecte interdisciplinari per incorporar la ciència ciutadana a les escoles de Barcelona i de la seva àrea metropolitana. Adreçada al professorat i l'alumnat de 3r i 4t d’ESO, és una activitat sobre mobilitat i geolocalització que gira entorn de tres eixos principals interrelacionats: l'educació, la ciència i la tecnologia. En aquest document es presenten els resultats obtinguts per l'alumnat (sense el seus noms per preservar-ne la privacitat) de l'experiment realitzat a 10 escoles de l'Àrea Metropolitana de Barcelona l'any 2018. Més detalls sobre l'experiment i les dades recollides es poden trobar a:https://doi.org/10.48550/arXiv.2302.07585

12 páginas, 1 tabla, 3 figuras, Human mobility is becoming an accessible field of study, thanks to the progress and availability of tracking technologies as a common feature of smart phones. We describe an example of a scalable experiment exploiting these circumstances at a public, outdoor fair in Barcelona (Spain). Participants were tracked while wandering through an open space with activity stands attracting their attention. We develop a general modelling framework based on Langevin dynamics, which allows us to test the influence of two distinct types of ingredients on mobility: reactive or context-dependent factors, modelled by means of a force field generated by attraction points in a given spatial configuration and active or inherent factors, modelled from intrinsic movement patterns of the subjects. The additive and constructive framework model accounts for some observed features. Starting with the simplest model (purely random walkers) as a reference, we progressively introduce different ingredients such as persistence, memory and perceptual landscape, aiming to untangle active and reactive contributions and quantify their respective relevance. The proposed approach may help in anticipating the spatial distribution of citizens in alternative scenarios and in improving the design of public events based on a facts-based approach., The research leading to these results has received funding by Barcelona City Council (Spain), RecerCaixa (Spain) through grant Citizen Science: Research and Education (F.B., J.R.P., A.O., M.G.R. and J.P.), by Strep-EU LASAGNE Project under contract no. 318132 (A.D.G. and O.S.), by MINECO (Spain) through grant nos. FIS2013-47532-C3-2-P (J.P. and M.G.R.) and FIS2012-38266-C2-2 (A.D.G. and O.S.), by Generalitat de Catalunya (Spain) through grant no. 2014- SGR-608 (M.G.R., O.S., J.P. and O.S.) and 2012-ACDC-00066 (M.G.R., O.S., J.P. and O.S.), and by Fundación Espaola para la Ciencia y la Tecnología (FECYT, Spain) through the Barcelona Citizen Science Office project of the Barcelona Lab programme (J.P.). O.S. also acknowledges financial support from Generalitat de Catalunya (FI-programme) and the Spanish MINECO (FPU-programme).

In this work we revisit the nonmonotonic behavior (NMB) of synchronization time with velocity reported for systems of mobile pulse-coupled oscillators (PCOs). We devise a control parameter that allows us to predict in which range of velocities NMB may occur, also uncovering the conditions allowing us to establish the emergence of NMB based on specific features of the connectivity rule. Specifically, our results show that if the connectivity rule is such that the interaction patterns are sparse and, more importantly, include a large fraction of non reciprocal interactions, then the system will display NMB. We furthermore provide a microscopic explanation relating the presence of such features of the connectivity patterns to the existence of local clusters unable to synchronize, termed frustrated clusters, for which we also give a precise definition in terms of simple graph concepts. We conclude that, if the probability of finding a frustrated cluster in a system of moving PCOs is high enough, NMB occurs in a predictable range of velocities., Comment: 12 pages, 11 figures

Sharing rides could drastically improve the efficiency of car and taxi transportation. Unleashing such potential, however, requires understanding how urban parameters affect the fraction of individual trips that can be shared, a quantity that we call shareability. Using data on millions of taxi trips in New York City, San Francisco, Singapore, and Vienna, we compute the shareability curves for each city, and find that a natural rescaling collapses them onto a single, universal curve. We explain this scaling law theoretically with a simple model that predicts the potential for ride sharing in any city, using a few basic urban quantities and no adjustable parameters. Accurate extrapolations of this type will help planners, transportation companies, and society at large to shape a sustainable path for urban growth., National Science Foundation (U.S.) (DMS-1513179), National Science Foundation (U.S.) (CCF-1522054)

Complex network null models based on entropy maximization are becoming a powerful tool to characterize and analyze data from real systems. However, it is not easy to extract good and unbiased information from these models: A proper understanding of the nature of the underlying events represented in them is crucial. In this paper we emphasize this fact stressing how an accurate counting of configurations compatible with given constraints is fundamental to build good null models for the case of networks with integer valued adjacency matrices constructed from aggregation of one or multiple layers. We show how different assumptions about the elements from which the networks are built give rise to distinctively different statistics, even when considering the same observables to match those of real data. We illustrate our findings by applying the formalism to three datasets using an open-source software package accompanying the present work and demonstrate how such differences are clearly seen when measuring network observables., Main doc and Supplementary Material To be published in PRE

Understanding human mobility is of vital importance for urban planning, epidemiology, and many other fields that draw policies from the activities of humans in space. Despite the recent availability of large-scale data sets of GPS traces or mobile phone records capturing human mobility, typically only a subsample of the population of interest is represented, giving a possibly incomplete picture of the entire system under study. Methods to reliably extract mobility information from such reduced data and to assess their sampling biases are lacking. To that end, we analyzed a data set of millions of taxi movements in New York City. We first show that, once they are appropriately transformed, mobility patterns are highly stable over long time scales. Based on this observation, we develop a supersampling methodology to reliably extrapolate mobility records from a reduced sample based on an entropy maximization procedure, and we propose a number of network-based metrics to assess the accuracy of the predicted vehicle flows. Our approach provides a well founded way to exploit temporal patterns to save effort in recording mobility data, and opens the possibility to scale up data from limited records when information on the full system is required., EU-LASAGNE Project (Contract 318132 (STREP)), Spain. Ministerio de Economia y Competitividad (Grant FIS2012-38266-C02-02), Generalitat de Catalunya (FI Program 2014-SGR-00608), Enel Foundation, Audi Volkswagen, SENSEable City Lab Consortium

Complex networks grow subject to structural constraints which affect their measurable properties. Assessing the effect that such constraints impose on their observables is thus a crucial aspect to be taken into account in their analysis. To this end,we examine the effect of fixing the strength sequence in multi-edge networks on several network observables such as degrees, disparity, average neighbor properties and weight distribution using an ensemble approach. We provide a general method to calculate any desired weighted network metric and we show that several features detected in real data could be explained solely by structural constraints. We thus justify the need of analytical null models to be used as basis to assess the relevance of features found in real data represented in weighted network form., Comment: 11 pages. 4 figures

We analyze the emergence of synchronization in a population of moving integrate-and-fire oscillators. Oscillators, while moving on a plane, interact with their nearest neighbor upon firing time. We discover a non-monotonic dependence of the synchronization time on the velocity of the agents. Moreover, we find that mechanisms that drive synchronization are different for different dynamical regimes. We report the extreme situation where an interplay between the time-scales involved in the dynamical processes completely inhibit the achievement of a coherent state. We also provide estimators for the transitions between the different regimes., Submitted to PRL, 5 pages, 3 figures. Suplementary Material: 6 pages, 5 figures

We present a model of integrate and fire oscillators that move on a plane. The phase of the oscillators evolves linearly in time and when it reaches a threshold value they fire choosing their neighbors according to a certain interaction range. Depending on the velocity of the ballistic motion and the average number of neighbors each oscillator fires to, we identify different regimes shown in a phase diagram. We characterize these regimes by means of novel parameters as the accumulated number of contacted neighbors., 9 pages, 5 figures

Statistical properties of binary complex networks are well understood and recently many attempts have been made to extend this knowledge to weighted ones. There is, however, a subtle difference between networks where weights are continuos variables and those where they account for discrete, distinguishable events, which we call multi-edge networks. In this work we face this problem introducing multi-edge networks as graphs where multiple (distinguishable) connections between nodes are considered. We develop a statistical mechanics framework where it is possible to get information about the most relevant observables given a large spectrum of linear and nonlinear constraints including those depending both on the number of multi-edges per link and their binary projection. The latter case is particularly interesting as we show that binary projections can be understood from multi-edge processes. The implications of these results are important as many real agent based problems mapped onto graphs require of this treatment for a proper characterization of its collective behavior., 17 pages (13 + Appendix), 3 figures, Submitted to PRX