Related papers: Surjectively rigid chains
Neural networks achieve outstanding accuracy in classification and regression tasks. However, understanding their behavior still remains an open challenge that requires questions to be addressed on the robustness, explainability and…
We investigate multivariate regular variation in the context of time-homogeneous Markov chains on general vector spaces and in random coefficient linear models. In the first part, we show that the regular variation of the stationary…
In this note, we present a characterization of sets definable in Skolem arithmetic, i.e., the first-order theory of natural numbers with multiplication. This characterization allows us to prove the decidability of the theory. The idea is…
We give a combinatorial characterization of generic minimally rigid reflection frameworks. The main new idea is to study a pair of direction networks on the same graph such that one admits faithful realizations and the other has only…
We work in set-theory without choice $\ZF$. Given a closed subset $F$ of $[0,1]^I$ which is a bounded subset of $\ell^1(I)$ ({\em resp.} such that $F \subseteq \ell^0(I)$), we show that the countable axiom of choice for finite subsets of…
Randomized Neural Networks explore the behavior of neural systems where the majority of connections are fixed, either in a stochastic or a deterministic fashion. Typical examples of such systems consist of multi-layered neural network…
We study the asymptotic behavior of the cardinality of the fixed point set of iterates of an endomorphism of a complex torus. We show that there are precisely three types of behavior of this function: it is either an exponentially growing…
In robust optimization one seeks to make a decision under uncertainty, where the goal is to find the solution with the best worst-case performance. The set of possible realizations of the uncertain data is described by a so-called…
Measure rigidity is a branch of ergodic theory that has recently contributed to the solution of some fundamental problems in number theory and mathematical physics. Examples are proofs of quantitative versions of the Oppenheim conjecture,…
In this paper, we consider the problem of exploring structural regularities of networks by dividing the nodes of a network into groups such that the members of each group have similar patterns of connections to other groups. Specifically,…
We define the rigid homology. The trace morphism in rigid cohomology define by duality the cycle class in rigid homology. We verify the compatibility of this classes with rationnal equivalence and intersection theory. We deduce some formal…
Random graphs are more and more used for modeling real world networks such as evolutionary networks of proteins. For this purpose we look at two different models and analyze how properties like connectedness and degree distributions are…
We study the join-semilattice of constructibility real degrees in the side-by-side Sacks model, the model of set theory obtained by forcing with a countable-support product of infinitely many Sacks forcings over the constructible universe.…
We examine properties of generic automorphisms of the random poset, with the goal of explicitly characterizing them. We associate to each automorphism an auxiliary first-order structure, consisting of the random poset equipped with an…
We present several theorems on strict and strong convexity, and higher order differential formulae for sandwiched quasi-relative entropy (a parametrised version of the classical fidelity). These are crucial for establishing global linear…
A rigidity theory is developed for bar-joint frameworks in $\mathbb{R}^{d+1}$ whose vertices are constrained to lie on concentric $d$-spheres with independently variable radii. In particular, combinatorial characterisations are established…
In this paper we will explore two different proposals for the action for causal sets: the Benincasa-Dowker action and a modified version of the chain action. We propose a variational principle for two-dimensional causal sets and use it for…
In a dynamical system $(X,f)$, with $X$ a compact metric space, the chain components, the fundamental building blocks in the Conley decomposition of dynamics, have a natural partial order induced by the chain relation between points.…
For a given stable recurrent neural network (RNN) that is trained to perform a classification task using sequential inputs, we quantify explicit robustness bounds as a function of trainable weight matrices. The sequential inputs can be…
We define and study certain linear orders on chainable continua. Those orders depend on a sequence of chains obtained from definition of chainability and on a fixed non-principal ultrafilter on the set of natural numbers. An alternative…