اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn the changeover timescales of technology transitions and induced efficiency changes: an overarching theory
41
0
0.0
(
0
)
نشر من قبل
Jean-Francois Mercure
تاريخ النشر
2012
مجال البحث
الهندسة المعلوماتية
والبحث باللغة
English
تأليف
Jean-Francois Mercure
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This paper presents a general theory that aims at explaining timescales observed empirically in technology transitions and predicting those of future transitions. This framework is used further to derive a theory for exploring the dynamics that underlie the complex phenomenon of irreversible and path dependent price or policy induced efficiency changes. Technology transitions are known to follow patterns well described by logistic functions, which should more rigorously be modelled mathematically using the Lotka-Volterra family of differential equations, originally developed to described the population growth of competing species. The dynamic evolution of technology has also been described theoretically using evolutionary dynamics similar to that observed in nature. The theory presented here joins both approaches and presents a methodology for predicting changeover time constants in order to describe real systems of competing technologies. The problem of price or policy induced efficiency changes becomes naturally explained using this framework. Examples of application are given.
قيم البحث
اقرأ أيضاً
In this work, we aim to determine the main factors driving behavioral change during the seasonal flu. To this end, we analyze a unique dataset comprised of 599 surveys completed by 434 Italian users of Influweb, a Web platform for participatory surve
illance, during the 2017-18 and 2018-19 seasons. The data provide socio-demographic information, level of concerns about the flu, past experience with illnesses, and the type of behavioral changes implemented by each participant. We describe each response with a set of features and divide them in three target categories. These describe those that report i) no (26 %), ii) only moderately (36 %), iii) significant (38 %) changes in behaviors. In these settings, we adopt machine learning algorithms to investigate the extent to which target variables can be predicted by looking only at the set of features. Notably, $66%$ of the samples in the category describing more significant changes in behaviors are correctly classified through Gradient Boosted Trees. Furthermore, we investigate the importance of each feature in the classification task and uncover complex relationships between individuals characteristics and their attitude towards behavioral change. We find that intensity, recency of past illnesses, perceived susceptibility to and perceived severity of an infection are the most significant features in the classification task. Interestingly, the last two match the theoretical constructs suggested by the Health-Belief Model. Overall, the research contributes to the small set of empirical studies devoted to the data-driven characterization of behavioral changes induced by infectious diseases.
Inverse phase transitions are striking phenomena in which an apparently more ordered state disorders under cooling. This behavior can naturally emerge in tricritical systems on heterogeneous networks and it is strongly enhanced by the presence of dis
assortative degree correlations. We show it both analytically and numerically, providing also a microscopic interpretation of inverse transitions in terms of freezing of sparse subgraphs and coupling renormalization.
The analysis of the dynamics on complex networks is closely connected to structural features of the networks. Features like, for instance, graph-cores and node degrees have been studied ubiquitously. Here we introduce the D-spectrum of a network, a n
ovel new framework that is based on a collection of nested chains of subgraphs within the network. Graph-cores and node degrees are merely from two particular such chains of the D-spectrum. Each chain gives rise to a ranking of nodes and, for a fixed node, the collection of these ranks provides us with the D-spectrum of the node. Besides a node deletion algorithm, we discover a connection between the D-spectrum of a network and some fixed points of certain graph dynamical systems (MC systems) on the network. Using the D-spectrum we identify nodes of similar spreading power in the susceptible-infectious-recovered (SIR) model on a collection of real world networks as a quick application. We then discuss our results and conclude that D-spectra represent a meaningful augmentation of graph-cores and node degrees.
We analyse the autocatalytic structure of technological networks and evaluate its significance for the dynamics of innovation patenting. To this aim, we define a directed network of technological fields based on the International Patents Classificati
on, in which a source node is connected to a receiver node via a link if patenting activity in the source field anticipates patents in the receiver field in the same region more frequently than we would expect at random. We show that the evolution of the technology network is compatible with the presence of a growing autocatalytic structure, i.e. a portion of the network in which technological fields mutually benefit from being connected to one another. We further show that technological fields in the core of the autocatalytic set display greater fitness, i.e. they tend to appear in a greater number of patents, thus suggesting the presence of positive spillovers as well as positive reinforcement. Finally, we observe that core shifts take place whereby different groups of technology fields alternate within the autocatalytic structure; this points to the importance of recombinant innovation taking place between close as well as distant fields of the hierarchical classification of technological fields.
In order to investigate the role of the weight in weighted networks, the collective behavior of the Ising system on weighted regular networks is studied by numerical simulation. In our model, the coupling strength between spins is inversely proportio
nal to the corresponding weighted shortest distance. Disordering link weights can effectively affect the process of phase transition even though the underlying binary topological structure remains unchanged. Specifically, based on regular networks with homogeneous weights initially, randomly disordering link weights will change the critical temperature of phase transition. The results suggest that the redistribution of link weights may provide an additional approach to optimize the dynamical behaviors of the system.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
