Search results for "J2"
showing 10 items of 137 documents
Modeling the coupled return-spread high frequency dynamics of large tick assets
2015
Large tick assets, i.e. assets where one tick movement is a significant fraction of the price and bid-ask spread is almost always equal to one tick, display a dynamics in which price changes and spread are strongly coupled. We introduce a Markov-switching modeling approach for price change, where the latent Markov process is the transition between spreads. We then use a finite Markov mixture of logit regressions on past squared returns to describe the dependence of the probability of price changes. The model can thus be seen as a Double Chain Markov Model. We show that the model describes the shape of return distribution at different time aggregations, volatility clustering, and the anomalo…
Ergodicity for a stochastic Hodgkin–Huxley model driven by Ornstein–Uhlenbeck type input
2013
We consider a model describing a neuron and the input it receives from its dendritic tree when this input is a random perturbation of a periodic deterministic signal, driven by an Ornstein-Uhlenbeck process. The neuron itself is modeled by a variant of the classical Hodgkin-Huxley model. Using the existence of an accessible point where the weak Hoermander condition holds and the fact that the coefficients of the system are analytic, we show that the system is non-degenerate. The existence of a Lyapunov function allows to deduce the existence of (at most a finite number of) extremal invariant measures for the process. As a consequence, the complexity of the system is drastically reduced in c…
R&D, Competition and Growth with Human Capital Accumulation Revisited
2012
In this paper, we have presented a generalization of Bucci's (2003) model in which have disentangled the monopolistic mark-up in the intermediate goods sector, the intermediate goods share in the final output and the returns to specialization in order to have a better measurement of competition. Indeed, unlike Bucci (2003), in our model, the measure of competition is completely independent of the intermediate goods share in the final output and the returns to specialization. Our main finding is that, unlike Bucci (2003), we show that the competition does not play any role in growth. This result is explained by the complementarity of innovation and human capital assumed in the research produ…
Lieu de résidence et discrimination salariale
2010
Ziel dieses Artikels ist es, die Lohnabweichungen zwischen Jugendlichen, die in sensiblen städtischen Zonen wohnen, am Ende ihrer Ausbildung und denjenigen, die zwar nicht in einer solchen Zone leben, die aber in städtischen Einheiten mit solchen Zonen wohnen, unter Berücksichtigung möglicher Barrieren beim Zugang zu bestimmten Beschäftigungen und insbesondere zu den Arbeitsplätzen von Führungskräften zu untersuchen. In Anknüpfung an Brown, Moon und Zoloth (1980) schlagen wir eine Zerlegung der Lohnabweichungen vor, bei der die Möglichkeit einer Differenzierung beim Zugang zu bestimmten Beschäftigungen entsprechend der Art des Stadtviertels, in dem die Jugendlichen wohnen, berücksichtigt wi…
Establishing some order amongst exact approximations of MCMCs
2016
Exact approximations of Markov chain Monte Carlo (MCMC) algorithms are a general emerging class of sampling algorithms. One of the main ideas behind exact approximations consists of replacing intractable quantities required to run standard MCMC algorithms, such as the target probability density in a Metropolis-Hastings algorithm, with estimators. Perhaps surprisingly, such approximations lead to powerful algorithms which are exact in the sense that they are guaranteed to have correct limiting distributions. In this paper we discover a general framework which allows one to compare, or order, performance measures of two implementations of such algorithms. In particular, we establish an order …
Can the Adaptive Metropolis Algorithm Collapse Without the Covariance Lower Bound?
2011
The Adaptive Metropolis (AM) algorithm is based on the symmetric random-walk Metropolis algorithm. The proposal distribution has the following time-dependent covariance matrix at step $n+1$ \[ S_n = Cov(X_1,...,X_n) + \epsilon I, \] that is, the sample covariance matrix of the history of the chain plus a (small) constant $\epsilon>0$ multiple of the identity matrix $I$. The lower bound on the eigenvalues of $S_n$ induced by the factor $\epsilon I$ is theoretically convenient, but practically cumbersome, as a good value for the parameter $\epsilon$ may not always be easy to choose. This article considers variants of the AM algorithm that do not explicitly bound the eigenvalues of $S_n$ away …
Importance sampling correction versus standard averages of reversible MCMCs in terms of the asymptotic variance
2017
We establish an ordering criterion for the asymptotic variances of two consistent Markov chain Monte Carlo (MCMC) estimators: an importance sampling (IS) estimator, based on an approximate reversible chain and subsequent IS weighting, and a standard MCMC estimator, based on an exact reversible chain. Essentially, we relax the criterion of the Peskun type covariance ordering by considering two different invariant probabilities, and obtain, in place of a strict ordering of asymptotic variances, a bound of the asymptotic variance of IS by that of the direct MCMC. Simple examples show that IS can have arbitrarily better or worse asymptotic variance than Metropolis-Hastings and delayed-acceptanc…
Wardowski conditions to the coincidence problem
2015
In this article we first discuss the existence and uniqueness of a solution for the coincidence problem: Find p ∈ X such that Tp = Sp, where X is a nonempty set, Y is a complete metric space, and T, S:X → Y are two mappings satisfying a Wardowski type condition of contractivity. Later on, we will state the convergence of the Picard-Juncgk iteration process to the above coincidence problem as well as a rate of convergence for this iteration scheme. Finally, we shall apply our results to study the existence and uniqueness of a solution as well as the convergence of the Picard-Juncgk iteration process toward the solution of a second order differential equation. Ministerio de Economía y Competi…
Random time-changes and asymptotic results for a class of continuous-time Markov chains on integers with alternating rates
2021
We consider continuous-time Markov chains on integers which allow transitions to adjacent states only, with alternating rates. We give explicit formulas for probability generating functions, and also for means, variances and state probabilities of the random variables of the process. Moreover we study independent random time-changes with the inverse of the stable subordinator, the stable subordinator and the tempered stable subodinator. We also present some asymptotic results in the fashion of large deviations. These results give some generalizations of those presented in Di Crescenzo A., Macci C., Martinucci B. (2014).
On the stability and ergodicity of adaptive scaling Metropolis algorithms
2011
The stability and ergodicity properties of two adaptive random walk Metropolis algorithms are considered. The both algorithms adjust the scaling of the proposal distribution continuously based on the observed acceptance probability. Unlike the previously proposed forms of the algorithms, the adapted scaling parameter is not constrained within a predefined compact interval. The first algorithm is based on scale adaptation only, while the second one incorporates also covariance adaptation. A strong law of large numbers is shown to hold assuming that the target density is smooth enough and has either compact support or super-exponentially decaying tails.