SearcharxivSearch

arXiv · 2101.12401

Construction of New Copulas with Queueing Application

Abstract

In this paper, we construct a bound copula, which can reach both Frechet's lower and upper bounds for perfect positive and negative dependence cases. Since it covers a wide range of dependency and simple for computational purposes, it can be very useful. We then develop a new perturbed copula using the lower and upper bounds of Frechet copula and show that it satisfies all properties of a copula. In some cases, it is very difficult to get results such as distribution functions and the expected values in explicit form by using copulas such as Archemedes, Guassian, $t$-copula. Thus, we can use these new copulas. For both copulas, we derive the strength of measures of the dependency such as Spearman's rho, Kendall's tau, Blomqvist's beta and Gini's gamma, and the coefficients of the tail dependency. As an application, we use the bound copula to analyze the dependency between two service times to evaluate the mean waiting time and the mean service time when customers launch two replicas of each task on two parallel servers using the cancel-on-finish policy. We assume that the inter-arrival time is exponential and the service time is general.

Explore related subjects

Keep this discovery

BibTeXRIS

Suman Thapa, Yiqiang Q. Zhao. 2021-01-29. Construction of New Copulas with Queueing Application. https://arxiv.org/abs/2101.12401

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR