Related papers: Generalized Lorenz dominance orders
We prove well-posedness for some abstract differential equations of the first order. Our result covers the usual case of Lipschitz composition operators. It also contains the case of some integro-differential operators acting on spaces with…
We study the evolution of a random walker on a conservative dynamic random environment composed of independent particles performing simple symmetric random walks, generalizing results of [16] to higher dimensions and more general transition…
Employing Morse theory for the global control of monodromy and the method of analytic discs for local extension, we establish a version of the global Hartogs extension theorem in a singular setting: for every domain D of an (n-1)-complete…
Proper regularization is critical for speeding up training, improving generalization performance, and learning compact models that are cost efficient. We propose and analyze regularized gradient descent algorithms for learning shallow…
We study the evolution of networks when the creation and decay of links are based on the position of nodes in the network measured by their centrality. We show that the same network dynamics arises under various centrality measures, and…
Motivated by team semantics and existential second-order logic, we develop a model-theoretic framework for studying second-order objects such as sets and relations. We introduce a notion of abstract elementary team categories that…
We establish a purely geometric form of the concentration theorem (also called localization theorem) for actions of a linearly reductive group $G$ on an affine scheme $X$ over an affine base scheme $S$. It asserts the existence of a…
We study transfinite extensions of Japaridze's provability logic GLP and the well-founded relations that naturally occur within them. Every ordinal induces a partial order over the class of "words," which are iterated consistency statements…
Regularization is a well studied problem in the context of neural networks. It is usually used to improve the generalization performance when the number of input samples is relatively small or heavily contaminated with noise. The…
Double ramification loci parametrise marked curves where a weighted sum of the markings is linearly trivial; higher-rank loci are obtained by imposing several such conditions simultaneously. We obtain closed formulae for the orbifold Euler…
In this paper, we introduce new concepts of domination and packing functions in graphs, which generalize, respectively, the labelled dominating and packing functions defined by Lee and Chang in 2008, and Hinrichsen et al. in 2019. These…
Hadar and Russell (1974) and Levy and Paroush (1974) presented sufficient conditions for multivariate stochastic dominance when the distributions involved are continuous with compact support. Further generalizations involved either…
Quantification, i.e., the task of training predictors of the class prevalence values in sets of unlabeled data items, has received increased attention in recent years. However, most quantification research has concentrated on developing…
From physical perspective, derivatives can be viewed as mathematical idealizations of the linear growth. The linear growth condition has special properties, which make it preferred. The manuscript investigates the general properties of the…
A parameterisation of generalised network clustering, in the form of four-motif prevalences, is presented. This involves three real parameters that are conditional on one- two- and three-motif prevalences. Interpretations of these real…
The Generalized Central Limit Theorem is a remarkable generalization of the Central Limit Theorem, showing that the sum of a large number of independent, identically-distributed (i.i.d) random variables with infinite variance may converge…
We establish a form of the Gotzmann representation of the Hilbert polynomial based on rank and generating degrees of a module, which allow for a generalization of Gotzmann's Regularity Theorem. Under an additional assumption on the…
A first-order theory has the Schroder-Bernstein property if any two of its models that are elementarily bi-embeddable are isomorphic. We prove that if a countable theory T has the Schroder-Bernstein property then it is classifiable (it is…
We investigate the behavior of the higher-order degrees, db_n, of a finitely presented group G. These db_n are functions from H^1(G;Z) to Z whose values are the degrees certain higher-order Alexander polynomials. We show that if def(G) is…
The evolution of the degenerate complex curve associated with the ensemble at a generic critical point is related to the finite time singularities of Laplacian Growth. It is shown that the scaling behavior at a critical point of singular…