اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدComplex networks and public funding: the case of the 2007-2013 Italian program
113
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper we apply techniques of complex network analysis to data sources representing public funding programs and discuss the importance of the considered indicators for program evaluation. Starting from the Open Data repository of the 2007-2013 Italian Program Programma Operativo Nazionale Ricerca e Competitivit`a (PON R&C), we build a set of data models and perform network analysis over them. We discuss the obtained experimental results outlining interesting new perspectives that emerge from the application of the proposed methods to the socio-economical evaluation of funded programs.
قيم البحث
اقرأ أيضاً
Multimodal transportation systems can be represented as time-resolved multilayer networks where different transportation modes connecting the same set of nodes are associated to distinct network layers. Their quantitative description became possible
recently due to openly accessible datasets describing the geolocalised transportation dynamics of large urban areas. Advancements call for novel analytics, which combines earlier established methods and exploits the inherent complexity of the data. Here, our aim is to provide a novel user-based methodological framework to represent public transportation systems considering the total travel time, its variability across the schedule, and taking into account the number of transfers necessary. Using this framework we analyse public transportation systems in several French municipal areas. We incorporate travel routes and times over multiple transportation modes to identify efficient transportation connections and non-trivial connectivity patterns. The proposed method enables us to quantify the networks overall efficiency as compared to the specific demand and to the car alternative.
Here we developed a new conceptual, stochastic Heterogeneous Opinion-Status model (HOpS model), which is adaptive network model. The HOpS model admits to identify the main attributes of dynamics on networks and to study analytically the relation betw
een topological network properties and processes taking place on a network. Another key point of the HOpS model is the possibility to study network dynamics via the novel parameter of heterogeneity. We show that not only clear topological network properties, such as node degree, but also, the nodes status distribution (the factor of network heterogeneity) play an important role in so-called opinion spreading and information diffusion on a network. This model can be potentially used for studying the co-evolution of globally aggregated or averaged key observables of the earth system. These include natural variables such as atmospheric, oceanic and land carbon stocks, as well as socio-economic quantities such as global human population, economic production or wellbeing.
There are different measures to classify a networks data set that, depending on the problem, have different success. For example, the resistance distance and eigenvector centrality measures have been successful in revealing ecological pathways and di
fferentiating between biomedical images of patients with Alzheimers disease, respectively. The resistance distance measures the effective distance between any two nodes of a network taking into account all possible shortest paths between them and the eigenvector centrality measures the relative importance of each node in the network. However, both measures require knowing the networks eigenvalues and eigenvectors -- eigenvectors being the more computationally demanding task. Here, we show that we can closely approximate these two measures using only the eigenvalue spectra, where we illustrate this by experimenting on elemental resistor circuits and paradigmatic network models -- random and small-world networks. Our results are supported by analytical derivations, showing that the eigenvector centrality can be perfectly matched in all cases whilst the resistance distance can be closely approximated. Our underlying approach is based on the work by Denton, Parke, Tao, and Zhang [arXiv:1908.03795 (2019)], which is unrestricted to these topological measures and can be applied to most problems requiring the calculation of eigenvectors.
This paper analyses the impact of random failure or attack on the public transit networks of London and Paris in a comparative study. In particular we analyze how the dysfunction or removal of sets of stations or links (rails, roads, etc.) affects th
e connectivity properties within these networks. We show how accumulating dysfunction leads to emergent phenomena that cause the transportation system to break down as a whole. Simulating different directed attack strategies, we find minimal strategies with high impact and identify a-priory criteria that correlate with the resilience of these networks. To demonstrate our approach, we choose the London and Paris public transit networks. Our quantitative analysis is performed in the frames of the complex network theory - a methodological tool that has emerged recently as an interdisciplinary approach joining methods and concepts of the theory of random graphs, percolation, and statistical physics. In conclusion we demonstrate that taking into account cascading effects the network integrity is controlled for both networks by less than 0.5 % of the stations i.e. 19 for Paris and 34 for London.
Many real-world networks are known to exhibit facts that counter our knowledge prescribed by the theories on network creation and communication patterns. A common prerequisite in network analysis is that information on nodes and links will be complet
e because network topologies are extremely sensitive to missing information of this kind. Therefore, many real-world networks that fail to meet this criterion under random sampling may be discarded. In this paper we offer a framework for interpreting the missing observations in network data under the hypothesis that these observations are not missing at random. We demonstrate the methodology with a case study of a financial trade network, where the awareness of agents to the data collection procedure by a self-interested observer may result in strategic revealing or withholding of information. The non-random missingness has been overlooked despite the possibility of this being an important feature of the processes by which the network is generated. The analysis demonstrates that strategic information withholding may be a valid general phenomenon in complex systems. The evidence is sufficient to support the existence of an influential observer and to offer a compelling dynamic mechanism for the creation of the network.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
