Searcharxiv⌕ Search

SEARCH · Searcharxiv

Results for “stat.OT”

Search indexed arXiv papers on artificial intelligence, large language models, computer vision and robotics. Read source abstracts and follow links to arXiv.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 163 records · Page 9Linked to original sources

Parametric Risk Parity

Any optimization algorithm based on the risk parity approach requires the formulation of portfolio total risk in terms of marginal contributions. In this paper we use the independence of the underlying factors in the market to derive the centered moments required in the risk decomposition process when the modified versions of Value at Risk and Expected Shortfall are considered. The choice of the Mixed Tempered Stable distribution seems adequate for fitting skewed and heavy tailed distributions. The ensuing detailed description of the optimization procedure is due to the existence of analytical higher order moments. Better results are achieved in terms of out of sample performance and greater diversification.

q-fin.RM↗

Computer experiments with functional inputs and scalar outputs by a norm-based approach

A framework for designing and analyzing computer experiments is presented, which is constructed for dealing with functional and real number inputs and real number outputs. For designing experiments with both functional and real number inputs a two stage approach is suggested. The first stage consists of constructing a candidate set for each functional input and during the second stage an optimal combination of the found candidate sets and a Latin hypercube for the real number inputs is searched for. The resulting designs can be considered to be generalizations of Latin hypercubes. GP models are explored as metamodel. The functional inputs are incorporated into the kriging model by applying norms in order to define distances between two functional inputs. In order to make the calculation of these norms computationally feasible, the use of B-splines is promoted.

stat.ME↗

Using Board Games and Mathematica to Teach the Fundamentals of Finite Stationary Markov Chains

Markov chains are an important example for a course on stochastic processes because simple board games can be used to illustrate the fundamental concepts. For example, a looping board game (like Monopoly) consists of all recurrent states, and a game where players win by reaching a final square (like Chutes and Ladders) consists of all transient states except for the last one. With the availability of computer algebra packages, these games can be analyzed. For example, the mean times in transient states and the stationary probabilities for recurrent states are easily computed. This article analyzes some simple board games with Mathematica, and indicates how this can be extended to more complex situations.

stat.OT↗

Piterbarg's max-discretisation theorem for stationary vector Gaussian processes observed on different grids

In this paper we derive Piterbarg's max-discretisation theorem for two different grids considering centered stationary vector Gaussian processes. So far in the literature results in this direction have been derived for the joint distribution of the maximum of Gaussian processes over $[0,T]$ and over a grid $ \mathfrak{R}(δ_1(T))=\{kδ_1(T): k=0,1,\cdots\}$. In this paper we extend recent findings by considering additionally the \bE{maximum} over another grid $ \mathfrak{R}(δ_2(T))$. We derive the joint limiting distribution of maximum of stationary Gaussian vector processes for different choices of such grids by letting $T\to \infty$.

math.PR↗

Network Analysis with the Enron Email Corpus

We use the Enron email corpus to study relationships in a network by applying six different measures of centrality. Our results came out of an in-semester undergraduate research seminar. The Enron corpus is well suited to statistical analyses at all levels of undergraduate education. Through this note's focus on centrality, students can explore the dependence of statistical models on initial assumptions and the interplay between centrality measures and hierarchical ranking, and they can use completed studies as springboards for future research. The Enron corpus also presents opportunities for research into many other areas of analysis, including social networks, clustering, and natural language processing.

stat.OT↗

Distributed Detection of a Random Process over a Multiple Access Channel under Energy and Bandwidth Constraints

We analyze a binary hypothesis testing problem built on a wireless sensor network (WSN) for detecting a stationary random process distributed both in space and time with circularly-symmetric complex Gaussian distribution under the Neyman-Pearson framework. Using an analog scheme, the sensors transmit different linear combinations of their measurements through a multiple access channel (MAC) to reach the fusion center (FC), whose task is to decide whether the process is present or not. Considering an energy constraint on each node transmission and a limited amount of channel uses, we compute the miss error exponent of the proposed scheme using Large Deviation Theory (LDT) and show that the proposed strategy is asymptotically optimal (when the number of sensors approaches to infinity) among linear orthogonal schemes. We also show that the proposed scheme obtains significant energy saving in the low signal-to-noise ratio regime, which is the typical scenario of WSNs. Finally, a Monte Carlo simulation of a 2-dimensional process in space validates the analytical results.

stat.OT↗

Methods for the generation of normalized citation impact scores in bibliometrics: Which method best reflects the judgements of experts?

Evaluative bibliometrics compares the citation impact of researchers, research groups and institutions with each other across time scales and disciplines. Both factors - discipline and period - have an influence on the citation count which is independent of the quality of the publication. Normalizing the citation impact of papers for these two factors started in the mid-1980s. Since then, a range of different methods have been presented for producing normalized citation impact scores. The current study uses a data set of over 50,000 records to test which of the methods so far presented correlate better with the assessment of papers by peers. The peer assessments come from F1000Prime - a post-publication peer review system of the biomedical literature. Of the normalized indicators, the current study involves not only cited-side indicators, such as the mean normalized citation score, but also citing-side indicators. As the results show, the correlations of the indicators with the peer assessments all turn out to be very similar. Since F1000 focuses on biomedicine, it is important that the results of this study are validated by other studies based on datasets from other disciplines or (ideally) based on multi-disciplinary datasets.

cs.DL↗

Estimating the Tail Index by using Model Averaging

The ideas of model averaging are used to find weights in peak-over-threshold problems using a possible range of thresholds. A range of the largest observations are chosen and considered as possible thresholds, each time performing estimation. Weights based on an information criterion for each threshold are calculated. A weighted estimate of the threshold and shape parameter can be calculated.

stat.OT↗

Precinct Size Matters - The Large Precinct Bias in US Presidential Elections

Examination of precinct level data in US presidential elections reveals a correlation of large precincts and increased fraction of Republican votes. The large precinct bias is analyzed with respect to voter heterogeneity and voter inconvenience as precinct size increases. The analysis shows that voter inconvenience is a significant factor in election outcomes in certain states, and may significantly disadvantage Democratic candidates.

stat.OT↗

A note on Bayesian logistic regression for spatial exponential family Gibbs point processes

Recently, a very attractive logistic regression inference method for exponential family Gibbs spatial point processes was introduced. We combined it with the technique of quadratic tangential variational approximation and derived a new Bayesian technique for analysing spatial point patterns. The technique is described in detail, and demonstrated on numerical examples.

stat.OT↗

Parametric Order Constraints in Multinomial Processing Tree Models: An Extension of Knapp and Batchelder (2004)

Multinomial processing tree (MPT) models are tools for disentangling the contributions of latent cognitive processes in a given experimental paradigm. The present note analyzes MPT models subject to order constraints on subsets of its parameters. The constraints that we consider frequently arise in cases where the response categories are ordered in some sense such as in confidence-rating data, Likert scale data, where graded guessing tendencies or response biases are created via base-rate or payoff manipulations, in the analysis of contingency tables with order constraints, and in many other cases. We show how to construct an MPT model without order constraints that is statistically equivalent to the MPT model with order constraints. This new closure result extends the mathematical analysis of the MPT class, and it offers an approach to order-restricted inference that extends the approaches discussed by Knapp and Batchelder (2004). The usefulness of the method is illustrated by means of an analysis of an order-constrained version of the two-high-threshold model for confidence ratings.

stat.AP↗

Convergence rates of maximal deviation distribution for projection estimates of Lévy densities

In this paper, we consider projection estimates for Lévy densities in high-frequency setup. We give a unified treatment for different sets of basis functions and focus on the asymptotic properties of the maximal deviation distribution for these estimates. Our results are based on the idea to reformulate the problems in terms of Gaussian processes of some special type and to further analyze these Gaussian processes. In particular, we construct a sequence of excursion sets, which guarantees the convergence of the deviation distribution to the Gumbel distribution. We show that the rates of convergence presented in previous articles on this topic are logarithmic and construct the sequences of accompanying laws, which approximate the deviation distribution with polynomial rate.

math.PR↗

Quantile of a Mixture

In this note, we give an explicit expression for the quantile of a mixture of two random variables. We carefully examine all possible cases of discrete and continuous variables with possibly unbounded support. The result is useful for finding bounds on the Value-at-Risk of risky portfolios when only partial information is available (Bernard and Vanduffel (2014)).

stat.OT↗

What Teachers Should Know about the Bootstrap: Resampling in the Undergraduate Statistics Curriculum

I have three goals in this article: (1) To show the enormous potential of bootstrapping and permutation tests to help students understand statistical concepts including sampling distributions, standard errors, bias, confidence intervals, null distributions, and P-values. (2) To dig deeper, understand why these methods work and when they don't, things to watch out for, and how to deal with these issues when teaching. (3) To change statistical practice---by comparing these methods to common t tests and intervals, we see how inaccurate the latter are; we confirm this with asymptotics. n >= 30 isn't enough---think n >= 5000. Resampling provides diagnostics, and more accurate alternatives. Sadly, the common bootstrap percentile interval badly under-covers in small samples; there are better alternatives. The tone is informal, with a few stories and jokes.

stat.OT↗

A Class of Conjugate Priors Defined on the Unit Simplex

Dirichlet distribution and Dirichlet process as its infinite dimensional generalization are primarily used conjugate prior of categorical and multinomial distributions in Bayesian statistics. Extensions have been proposed to broaden applications for different purposes. In this article, we explore a class of prior distributions closely related to Dirichlet distribution incorporating additional information on the data generating mechanism. Examples are given to show potential use of the models.

stat.ME↗

Distinguishing cause from effect using observational data: methods and benchmarks

The discovery of causal relationships from purely observational data is a fundamental problem in science. The most elementary form of such a causal discovery problem is to decide whether X causes Y or, alternatively, Y causes X, given joint observations of two variables X, Y. An example is to decide whether altitude causes temperature, or vice versa, given only joint measurements of both variables. Even under the simplifying assumptions of no confounding, no feedback loops, and no selection bias, such bivariate causal discovery problems are challenging. Nevertheless, several approaches for addressing those problems have been proposed in recent years. We review two families of such methods: Additive Noise Methods (ANM) and Information Geometric Causal Inference (IGCI). We present the benchmark CauseEffectPairs that consists of data for 100 different cause-effect pairs selected from 37 datasets from various domains (e.g., meteorology, biology, medicine, engineering, economy, etc.) and motivate our decisions regarding the "ground truth" causal directions of all pairs. We evaluate the performance of several bivariate causal discovery methods on these real-world benchmark data and in addition on artificially simulated data. Our empirical results on real-world data indicate that certain methods are indeed able to distinguish cause from effect using only purely observational data, although more benchmark data would be needed to obtain statistically significant conclusions. One of the best performing methods overall is the additive-noise method originally proposed by Hoyer et al. (2009), which obtains an accuracy of 63+-10 % and an AUC of 0.74+-0.05 on the real-world benchmark. As the main theoretical contribution of this work we prove the consistency of that method.

cs.LG↗

Nonparametric estimation of the division rate of an age dependent branching process

We study the nonparametric estimation of the branching rate $B(x)$ of a supercritical Bellman-Harris population: a particle with age $x$ has a random lifetime governed by $B(x)$; at its death time, it gives rise to $k \geq 2$ children with lifetimes governed by the same division rate and so on. We observe in continuous time the process over $[0,T]$. Asymptotics are taken as $T \rightarrow \infty$; the data are stochastically dependent and one has to face simultaneously censoring, bias selection and non-ancillarity of the number of observations. In this setting, under appropriate ergodicity properties, we construct a kernel-based estimator of $B(x)$ that achieves the rate of convergence $\exp(-λ_B \fracβ{2β+1}T)$, where $λ_B$ is the Malthus parameter and $β>0$ is the smoothness of the function $B(x)$ in a vicinity of $x$. We prove that this rate is optimal in a minimax sense and we relate it explicitly to classical nonparametric models such as density estimation observed on an appropriate (parameter dependent) scale. We also shed some light on the fact that estimation with kernel estimators based on data alive at time $T$ only is not sufficient to obtain optimal rates of convergence, a phenomenon which is specific to nonparametric estimation and that has been observed in other related growth-fragmentation models.

stat.OT↗

From Curriculum Guidelines to Learning Objectives: A Survey of Five Statistics Programs

The 2000 ASA Guidelines for Undergraduate Statistics majors aimed to provide guidance to programs with undergraduate degrees in statistics as to the content and skills that statistics majors should be learning. With new guidelines forthcoming, it is important to help programs develop an assessment cycle of evaluation. How do we know the students are learning what we want them to learn? How do we improve the program over time? The first step in this process is to translate the broader Guidelines into institution-specific measurable learning outcomes. This paper provides examples of how five programs did so for the 2000 Guidelines. We hope they serve as illustrative examples for programs moving forward with the new guidelines.

stat.OT↗