Related papers: Distality Rank
Statistical distances, divergences, and similar quantities have a large history and play a fundamental role in statistics, machine learning and associated scientific disciplines. However, within the statistical literature, this extensive…
Forking is a central notion of model theory, generalizing linear independence in vector spaces and algebraic independence in fields. We develop the theory of forking in abstract, category-theoretic terms, for reasons both practical (we…
Ioffe's criterion and various reformulations of it have become a~standard tool in proving theorems guaranteeing metric regularity of a (set-valued) mapping. First, we demonstrate that one should always use directly the so-called general…
It is shown how a selection of prominent results in singularity theory and differential geometry can be deduced from one theorem, the Rank Theorem for maps between spaces of power series.
The convex and metric structures underlying probabilistic physical theories are generally described in terms of base normed vector spaces. According to a recent proposal, the purely geometrical features of these spaces are appropriately…
Given a finitely-connected bounded planar domain $\Omega$, it is possible to define a {\it divergence distance} $D(x,y)$ from $x\in\Omega$ to $y\in\Omega$, which takes into account the complex geometry of the domain. This distance function…
We consider $n$-component fixed-length order parameter interacting with a weak random field in $d=1,2,3$ dimensions. Relaxation from the initially ordered state and spin-spin correlation functions have been studied on lattices containing…
We examine whether mobility measures appropriately represent changes in individual status, like income or ranks. We suggest three elementary principles for mobility comparisons and show that many commonly used indices violate one or more of…
We develop the theory of generically stable types, independence relation based on nonforking and stable weight in the context of dependent (NIP) theories.
A rank is a notion in descriptive set theory that describes ranks such as the Cantor-Bendixson rank on the set of closed subsets of a Polish space, differentiability ranks on the set of differentiable functions in $C[0,1]$ such as the…
We present a systematic study of the regularity phenomena for NIP hypergraphs and connections to the theory of (locally) generically stable measures, providing a model-theoretic hypergraph version of the results from [L. Lov\'asz, B.…
We investigate the extent of second order characterizable structures by extending Shelah's Main Gap dichotomy to second order logic. For this end we consider a countable complete first order theory T. We show that all sufficiently large…
We give sufficient conditions for a predicate P in a complete theory T to be stably embedded: P with its induced 0-definable structure has "finite rank", P has NIP in T and P is 1-stably embedded. This generalizes recent work by Hasson and…
Max-stability is the property that taking a maximum between two inputs results in a maximum between two outputs. We study max-stability with respect to first-order stochastic dominance, the most fundamental notion of stochastic dominance in…
We show that the first order theory of the lattice of open sets in some natural topological spaces is $m$-equivalent to second order arithmetic. We also show that for many natural computable metric spaces and computable domains the first…
We consider optimization problems with a disjunctive structure of the constraints. Prominent examples of such problems are mathematical programs with equilibrium constraints or vanishing constraints. Based on the concepts of directional…
Consider a random sample in the max-domain of attraction of a multivariate extreme value distribution such that the dependence structure of the attractor belongs to a parametric model. A new estimator for the unknown parameter is defined as…
We consider real-valued branching random walks and prove a large deviation result for the position of the rightmost particle. The position of the rightmost particle is the maximum of a collection of a random number of dependent random…
Although there is no doubt that multi-parameter persistent homology is a useful tool to analyse multi-variate data, efficient ways to compute these modules are still lacking in the available topological data analysis toolboxes. Other issues…
Let $\mathscr{P}$ be a poset and $\mathcal{S}$ a sequence of $n$ finite substes of $\mathscr{P}$. The Jordan type of a $\mathscr{P}$-persistence module $M$ at $\mathcal{S}$, denoted by $\mathsf{J}_{\mathcal{S}}(M) \in \mathbb{N}^n$, is…