Related papers: Consequences of Dependent Dividing on Burden
There is an increasing interest to understand the dependence structure of a random vector not only in the center of its distribution but also in the tails. Extreme-value theory tackles the problem of modelling the joint tail of a…
Measuring conditional dependencies among the variables of a network is of great interest to many disciplines. This paper studies some shortcomings of the existing dependency measures in detecting direct causal influences or their lack of…
We study t-structures generated by sets of objects which satisfy a condition weaker than the compactness. We also study weight structures cogenerated by sets of objects satisfying the dual condition. Under some appropriate hypothesis, it…
Any superrosy division ring (i.e. a division ring equipped with an abstract notion of rank) is shown to be centrally finite. Furthermore, division rings satisfying a generalized chain condition on definable subgroups are studied. In…
The problem of estimating the coefficient of bivariate tail dependence is considered here from the robustness point of view; it combines two apparently contradictory theories of robust statistics and extreme value statistics. The usual…
This paper proposes a new approach for testing Granger non-causality on panel data. Instead of aggregating panel member statistics, we aggregate their corresponding p-values and show that the resulting p-value approximately bounds the type…
We investigate the dynamics of substitution subshifts and their associated tiling spaces. For a given subshift, the associated tiling spaces are all homeomorphic, but their dynamical properties may differ. We give criteria for such a tiling…
We evaluate the dependence among the margins of a random vector with Multivariate Extreme Value distribution throughout the expected value of a range and relate this coefficient of dependence with the multivariate tail dependence. Its…
It is well known that non-parametric methods suffer from the "curse of dimensionality". We propose here a new estimation method for a multivariate distribution, using sub-sampling and ranks, which seems not to suffer from this "curse". We…
We introduce the concept of an extremely negatively dependent (END) sequence of random variables with a given common marginal distribution. The END structure, as a new benchmark for negative dependence, is comparable to comonotonicity and…
A possible signal of new phenomena emerging in the global characteristics of multiparticle production in hadron interactions at TeV energies is studied. The multiplicity distributions of charged particles measured in proton-proton…
We investigate the VC-dimension of the perceptron and simple two-layer networks like the committee- and the parity-machine with weights restricted to values $\pm1$. For binary inputs, the VC-dimension is determined by atypical pattern sets,…
We have systematically studied the effects of in-plane uniaxial pressure $p$ on the superconducting transition temperature $T_c$ in many iron-based superconductors. The change of $T_c$ with $p$ is composed of linear and nonlinear…
We study compressible types in the context of (local and global) NIP. By extending a result in machine learning theory (the existence of a bound on the recursive teaching dimension), we prove density of compressible types. Using this, we…
When developing and assessing density functional theory methods, a finite basis set is usually employed. In most cases, however, the issue of basis set dependency is neglected. Here, we assess several basis sets and functionals. In…
The response function approach is proposed to include vibrational state in calculation of level density. The calculations show rather strong dependence of level density on the relaxation times of collective state damping.
Strongly Turing determinacy, or $\mathrm{sTD}$, says that for any set $A$ of reals, if $\forall x\exists y\geq_T x (y\in A)$, then there is a pointed set $P\subseteq A$. We prove the following consequences of Turing determinacy…
We study the problem of decomposing (clustering) a tree with respect to costs attributed to pairs of nodes, so as to minimize the sum of costs for those pairs of nodes that are in the same component (cluster). For the general case and for…
In this paper, we have considered the dense rank for assigning positions to alternatives in weak orders. If we arrange the alternatives in tiers (i.e., indifference classes), the dense rank assigns position 1 to all the alternatives in the…
All types of networks arise as intricate combinations of dyadic building blocks formed by pairs of vertices. In directed networks, the dyadic patterns are entirely determined by reciprocity, i.e. the tendency to form, or to avoid, mutual…