Related papers: Proxy principles in combinatorial set theory
We provide a framework for modeling social network formation through conditional multinomial logit models from discrete choice and random utility theory, in which each new edge is viewed as a "choice" made by a node to connect to another…
We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…
This paper introduces new parameterizations of equilibrium neural networks, i.e. networks defined by implicit equations. This model class includes standard multilayer and residual networks as special cases. The new parameterization admits a…
With ever-increasing dataset sizes, subset selection techniques are becoming increasingly important for a plethora of tasks. It is often necessary to guide the subset selection to achieve certain desiderata, which includes focusing or…
Flum and Grohe define a parameter (parameterization) as a function $\kappa$ which maps words over a given alphabet to natural numbers. They require such functions to be polynomial-time computable. We show how this technical restriction can…
Based on laboratory based growth of plant-like structures from inorganic materials, we present new theory for the emergence of plant structure at a range of scales dictated by levels of ionization (charge density), which can be traced…
We generalize the diamond principle and its variants using the notion of stationarity in trees introduced by Brodsky in [Brodsky, A. M., A theory of stationary trees and the balanced Baumgartner--Hajnal--Todorcevic theorem for trees. The…
We show that it is possible to add $\kappa^+-$Cohen subsets to $\kappa$ with a Prikry forcing over $\kappa$. This answers a question from \cite{HayutBenhanouGitik}. A strengthening of non-Galvin property is introduced. It is shown to be…
We present a new approach to classification that combines data and knowledge. In this approach, data mining is used to derive association rules (possibly with negations) from data. Those rules are leveraged to increase the predictive…
Over extended systems of finite type arithmetic, we utilize a formal representation of the outer measure to define a translation which allows for the systematic formalization of probabilistic statements. As a main result, this translation…
A new tree model is introduced based on ordered trees, by distinguishing exactly one child of each node that \emph{has} children. The basic enumeration leads to a cubic equation of the generating function. The extraction of its coefficients…
Proximal causal inference is a recently proposed framework for evaluating causal effects in the presence of unmeasured confounding. For point identification of causal effects, it leverages a pair of so-called treatment and outcome…
This paper develops new limit theory for data that are generated by networks or more generally display cross-sectional dependence structures that are governed by observable and unobservable characteristics. Strategic network formation…
The classical matrix-tree theorem relates the determinant of the combinatorial Laplacian on a graph to the number of spanning trees. We generalize this result to Laplacians on one- and two-dimensional vector bundles, giving a combinatorial…
A Supertree synthesizes the topologies of a set of phylogenetic trees carrying overlapping taxa set. In process, conflicts in the tree topologies are aimed to be resolved with the consensus clades. Such a problem is proved to be NP-hard.…
In many modern applications, including analysis of gene expression and text documents, the data are noisy, high-dimensional, and unordered--with no particular meaning to the given order of the variables. Yet, successful learning is often…
Boundary constraints in physical, environmental and engineering models restrict smooth states such as temperature to follow known physical laws at the edges of their spatio-temporal domain. Examples include fixed-state or fixed-derivative…
A new set of elementary symplectic elements is described, It is shown that these also generate the elementary symplectic group {\rm ESp}$_{2n}(R)$. These generators are more symmetrical than the usual ones, and are useful to study the…
At the beginning of 1950's Erd\H os and Rado suggested the investigation of the Ramsey-type results where the number of colors is not finite. This marked the birth of the so-called canonizing Ramsey theory. In 1985 Pr\"omel and Voigt made…
This article investigates combinatorial properties of non-ambiguous trees. These objects we define may be seen either as binary trees drawn on a grid with some constraints, or as a subset of the tree-like tableaux previously defined by…