Related papers: Coincidence rank and multivariate equicontinuity
Consider a real-valued branching random walk in the boundary case. Using the techniques developed by A\"id\'ekon and Shi [5], we give two integral tests which describe respectively the lower limits for the minimal position and the upper…
We study the inverse problem of inferring the state of a finite-level quantum system from expected values of a fixed set of observables, by maximizing a continuous ranking function. We have proved earlier that the maximum-entropy inference…
In this note, we generalise the concept of topo-isomorphic extensions and define finite topomorphic extensions as topological dynamical systems whose factor map to the maximal equicontinuous factor is measure-theoretically at most…
There is an axiomatic treatment of Morley rank in groups, due to Borovik and Poizat. These axioms form the basis of the algebraic treatment of groups of finite Morley rank which is common today. There are, however, ranked structures, i.e.…
Evanescent random fields arise as a component of the 2-D Wold decomposition of homogenous random fields. Besides their theoretical importance, evanescent random fields have a number of practical applications, such as in modeling the…
This paper is devoted to the bipartite ranking problem, a classical statistical learning task, in a high dimensional setting. We propose a scoring and ranking strategy based on the PAC-Bayesian approach. We consider nonlinear additive…
We present a simple, accurate method for solving consistent, rank-deficient linear systems, with or without addi- tional rank-completing constraints. Such problems arise in a variety of applications, such as the computation of the…
We obtain some maximal probability and moment inequalities for multidimensionally indexed demimartingales. Although the class of single-indexed demimartingales has been studied extensively, no significant amount of work has been done for…
A topological dynamical system $(X,f)$ induces two natural systems, one is on the probability measure spaces and other one is on the hyperspace. We introduce a concept for these two spaces, which is called entropy order, and prove that it…
The definition of subshifts of finite symbolic rank is motivated by the finite rank measure-preserving transformations which have been extensively studied in ergodic theory. In this paper we study subshifts of finite symbolic rank as…
In this paper we bring a novel approach to the theory of tournament rankings. We combine two different theories that are widely used to establish rankings of populations after a given tournament. First, we use the statistical approach of…
Moments of the partition rank and crank statistics have been studied for their connections to combinatorial objects such as Durfee symbols, as well as for their connections to harmonic Maass forms. This paper proves a conjecture due to…
In this note we put forward a conjecture on the average optimal length for bipartite matching with a finite number of elements where the different lengths are independent one from the others and have an exponential distribution.
We study combinatorial and asymptotic properties of the rank of strongly unimodal sequences. We find a generating function for the rank enumeration function, and give a new combinatorial interpretation of the ospt-function introduced by…
Many quantities that characterize network elements are defined in an explicit form and calculated directly from the network structure; examples of include several centrality measures like degree, closeness, or betweenness. However, there…
A new phase space criterion, encoding the physically motivated behavior of coincidence arrangements of local observables, is proposed in this work. This condition entails, in particular, uniqueness and purity of the energetically accessible…
We cardinally and ordinally rank distribution functions (CDFs). We present a new class of statistics, maximal adjusted quantiles, and show that a statistic is invariant with respect to cardinal shifts, preserves least upper bounds with…
This work starts from definition of randomness, the results of algorithmic randomness are analyzed from the perspective of application. Then, the source and nature of randomness is explored, and the relationship between infinity and…
A characteristic-dependent linear rank inequality is a linear inequality that holds by ranks of subspaces of a vector space over a finite field of determined characteristic, and does not in general hold over other characteristics. In this…
Robust principal component analysis is an important representative method in data analysis. It is usually viewed as an optimization problem involving the rank and $\ell_0$-norm of matrices. In this paper, we study the rank and $\ell_0$…