English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

<P>A random vector X with given univariate marginals can be obtained by first applying the normal distribution function to each coordinate of a vector Z of correlated standard normals to produce a vector U of correlated uniforms over (0,1) and then transforming each coordinate of U by the relevant inverse marginal. One approach to fitting requires, separately for each pair of coordinates of X, the rank correlation, r(ρ), or the product-moment correlation, rL(ρ), where ρ is the correlation of the corresponding coordinates of Z, to equal some target r*. We prove the existence and uniqueness of a solution for any feasible target, without imposing restrictions on the marginals. For the case where r(ρ) cannot be computed exactly because of an infinite discrete support, the relevant infinite sums are approximated by truncation, and lower and upper bounds on the truncation errors are developed. With a function <inline-formula id=\"IEq0001\"<mml:math id=\"IEq0001-mml\" display=\"inline\" overflow=\"scroll\"<mml:mrow><mml:mover accent=\"true\"<mml:mi>r</mml:mi><mml:mo>Ë</mml:mo></mml:mover><mml:mo stretchy=\"false\"(</mml:mo><mml:mi>Ï</mml:mi><mml:mo stretchy=\"false\")</mml:mo></mml:mrow></mml:math></inline-formula> defined by the truncated sums, a bound on the error r(ρ*)-r* is given, where ρ* is a solution to <inline-formula id=\"IEq0002\"<mml:math id=\"IEq0002-mml\" display=\"inline\" overflow=\"scroll\"<mml:mrow><mml:mover accent=\"true\"<mml:mi>r</mml:mi><mml:mo>Ë</mml:mo></mml:mover><mml:mo stretchy=\"false\"(</mml:mo><mml:msup><mml:mi>Ï</mml:mi><mml:mo>'—ï¾</mml:mo></mml:msup><mml:mo stretchy=\"false\")</mml:mo><mml:mo>=</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mo>'—ï¾</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula>. Based on this bound, an algorithm is proposed that determines truncation points so that the solution has any specified accuracy. The new truncation method has potential for significant work reduction relative to truncating heuristically, largely because as required accuracy decreases, so does the number of terms in the truncated sums. This is quantified with examples. The gain appears to increase with the heaviness of tails.</P>

Constructing Discrete Unbounded Distributions with Gaussian-Copula Dependence and Given Rank Correlation