arXiv subjects

Mustafa R. Kılınç

Publications and source records attributed to Mustafa R. Kılınç.

3 recordsLinked to original sources

arXiv2026

Testing the order of fractional integration when smooth deterministic trends are possibly present

This paper introduces a test for fractional integration in a model that possibly contains smooth deterministic trends. We model the trend component using a Chebyshev polynomial and specify the short-run dynamics semi-parametrically, accommodating a broad class of possibly nonlinear processes, including those with conditional heteroskedasticity. We use a local Whittle approach for constructing a Lagrange multiplier test statistic and for constructing a frequency-domain information criterion for the selection of the order of the Chebyshev polynomial. We show that widely used time-domain information criteria are generally inconsistent for the true order, whereas our frequency-domain criterion remains robust under both short- and long-memory behaviour. Monte Carlo simulations and an empirical application to the UK Great Ratios support our theoretical findings.

econ.EM↗

arXiv2026

The modified conditional sum-of-squares estimator for fractionally integrated models

In this paper, we analyse the influence of estimating a constant term on the bias of the conditional sum-of-squares (CSS) estimator in a stationary or non-stationary type-II ARFIMA ($p_1$,$d$,$p_2$) model. We derive expressions for the estimator's bias and show that the leading term can be easily removed by a simple modification of the CSS objective function. We call this new estimator the modified conditional sum-of-squares (MCSS) estimator. We show theoretically and by means of Monte Carlo simulations that its performance relative to that of the CSS estimator is markedly improved even for small sample sizes. Finally, we revisit three classical short datasets that have in the past been described by ARFIMA($p_1$,$d$,$p_2$) models with constant term, namely the post-second World War real GNP data, the extended Nelson-Plosser data, and the Nile data.

econ.EM↗

arXiv2014

Intersection Cuts for Nonlinear Integer Programming: Convexification Techniques for Structured Sets

We study the generalization of split, k-branch split, and intersection cuts from Mixed Integer Linear Programming to the realm of Mixed Integer Nonlinear Programming. Constructing such cuts requires calculating the convex hull of the difference between a convex set and an open set with a simple geometric structure. We introduce two techniques to give precise characterizations of such convex hulls and use them to construct split, k-branch split, and intersection cuts for several classes of non-polyhedral sets. In particular, we give simple formulas for split cuts for essentially all convex sets described by a single quadratic inequality. We also give simple formulas for k-branch split cuts and some general intersection cuts for a wide variety of convex quadratic sets.

math.OC↗