相关论文: n-localization property

Most of modern neural machine translation (NMT) models are based on an encoder-decoder framework with an attention mechanism. While they perform well on standard datasets, they can have trouble in translation of long inputs that are rare or…

We consider existentially closed fields with several orderings, valuations, and $p$-valuations. We show that these structures are NTP$_2$ of finite burden, but usually have the independence property. Moreover, forking agrees with dividing,…

We obtain a relatively simple criterion for when a forcing has the ${<}\,\delta$-approximation property, generalizing a result of Unger. Afterwards we apply this criterion to construct variants of Mitchell Forcing in order to answer…

Consider a tree network T, where each edge acts as an independent copy of a given channel M, and information is propagated from the root. For which T and M does the configuration obtained at level n of T typically contain significant…

We consider a sequence $\mathbf{T} = (\mathcal{T}_n : n \in \mathbb{N}^+)$ of trees $\mathcal{T}_n$ where, for some $\Delta \in \mathbb{N}^+$ every $\mathcal{T}_n$ has height at most $\Delta$ and as $n \to \infty$ the minimal number of…

Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on…

Let $\tau$n be a random tree distributed as a Galton-Watson tree with geometric offspring distribution conditioned on {Zn = an} where Zn is the size of the n-th generation and (an, n $\in$ N *) is a deterministic positive sequence. We study…

Transient faults corrupt the content and organization of data structures. A recovery technique dealing with such faults is stabilization, which guarantees, following some number of operations on the data structure, that content of the data…

In many applications of clustering (for example, ontologies or clusterings of animal or plant species), hierarchical clusterings are more descriptive than a flat clustering. A hierarchical clustering over $n$ elements is represented by a…

Let $G$ be a countable graph containing a copy of the countable random graph (Erd\H{o}s-R\'enyi graph, Rado graph), $Emb (G)$ the monoid of its self-embeddings, ${\mathbb P} (G)=\{f[G]: f\in Emb (G)\}$ the set of copies of $G$ contained in…

Given a non-negative $n \times n$ matrix viewed as a set of distances between $n$ points, we consider the property testing problem of deciding if it is a metric. We also consider the same problem for two special classes of metrics, tree…

In this paper, we investigate the herdability property, namely the capability of a system to be driven towards the (interior of the) positive orthant, for linear time-invariant state-space models. Herdability of certain matrix pairs (A,B),…

In this paper the work done by Newelski and Roslanowski is revisited to solve a question done by Blass about one of the possible evasion and prediction numbers. This led to define a variation of the $k$-localization property (the…

The space of phylogenetic trees arises naturally in tropical geometry as the tropical Grassmannian. Tropical geometry therefore suggests a natural notion of a tropical path between two trees, given by a tropical line segment in the tropical…

Recent efforts at explaining the interplay of memorization and generalization in deep overparametrized networks have posited that neural networks $\textit{memorize}$ "hard" examples in the final few layers of the model. Memorization refers…

Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…

We prove that if a tree $T$ has $n$ vertices and maximum degree at most $\Delta$, then a copy of $T$ can almost surely be found in the random graph $\mathcal{G}(n,\Delta\log^5 n/n)$.

A conjecture by Bollob\'as from 1995 (which is a weakenning of the famous Tree Packing Conjecture by Gy\'arf\'as from 1976) states that any set of $k$ trees $T_n,T_{n-1},\dots,T_{n-k+1}$, such that $T_{n-i}$ has $n-i$ vertices, pack into…

Neural networks can implement arbitrary functions. But, mechanistically, what are the tools at their disposal to construct the target? For classification tasks, the network must transform the data classes into a linearly separable…

We consider Galton-Watson trees associated with a critical offspring distribution and conditioned to have exactly $n$ vertices. These trees are embedded in the real line by affecting spatial positions to the vertices, in such a way that the…