Related papers: Relational exchangeability
We investigate certain structural properties of random interdependent networks. We start by studying a property known as $r$-robustness, which is a strong indicator of the ability of a network to tolerate structural perturbations and…
If $L$ is a relational language, then an $L$-structure ${\mathbb X}=\langle X,\bar \rho \rangle$ is reversible iff there is no interpretation $\bar \sigma \varsubsetneq \bar \rho$ such that the structures $\langle X,\bar \sigma \rangle$ and…
In this paper we collect a few results about exchangeability systems in which crossing cumulants vanish, which we call noncrossing exchangeability systems. The main result is a free version of De Finetti's theorem, characterising…
Given well-shuffled data, can we determine whether the data items are statistically (in)dependent? Formally, we consider the problem of testing whether a set of exchangeable random variables are independent. We will show that this is…
We consider two families of planar self-similar tilings of different nature: the tilings consisting of translated copies of the fractal sets defined by an iterated function system, and the tilings obtained as a geometrical realization of a…
For any Legendrian knot or link in $\mathbb{R}^3$, we construct an $L_\infty$ algebra that can be viewed as an extension of the Chekanov-Eliashberg differential graded algebra. The $L_\infty$ structure incorporates information from rational…
Link residual closeness is a newly proposed measure for network vulnerability. In this model, vertices are perfectly reliable and the links fail independently of each other. It measures the vulnerability even when the removal of links does…
A graph is a data structure composed of dots (i.e. vertices) and lines (i.e. edges). The dots and lines of a graph can be organized into intricate arrangements. The ability for a graph to denote objects and their relationships to one…
In this paper, we introduce a novel generalization of the classical property of algebras known as "being alternative," which we term "partially alternative." This new concept broadens the scope of alternative algebras, offering a fresh…
When analysing quantum information processing protocols one has to deal with large entangled systems, each consisting of many subsystems. To make this analysis feasible, it is often necessary to identify some additional structure. de…
It is taken for granted that bound systems are made of massive constituents that interact through particle exchanges (charged particles interacting via photon exchanges, quarks in elementary particles interacting via gluon exchanges, and…
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…
Let L contain only the equality symbol and let L^+ be an arbitrary finite symmetric relational language containing L . Suppose probabilities are defined on finite L^+ structures with ''edge probability'' n^{- alpha}. By T^alpha, the almost…
We define a new structure on a space endowed with convexities, and call it a fractoconvex structure (or, a space with fractoconvexity). We introduce two operations on a set of fractoconvexities and in a special case we show that they…
For each positive integer $n$, we define the divisibility relation graph $D_n$ whose vertex set is the set of divisors of $n$, and in which two vertices are adjacent if one is a divisor of the other. This type of graph is a special case of…
An interval in a combinatorial structure S is a set I of points which relate to every point from S I in the same way. A structure is simple if it has no proper intervals. Every combinatorial structure can be expressed as an inflation of a…
Cumulants linearize convolution of measures. We use a formula of Good to define noncommutative cumulants in a very general setting.It turns out that the essential property needed is exchangeability of random variables. Roughly speaking the…
The random reversal graph offers new perspectives, allowing to study the connectivity of genomes as well as their most likely distance as a function of the reversal rate. Our main result shows that the structure of the random reversal graph…
An association scheme is called amorphic if every possible fusion of relations gives rise to another association scheme. In earlier work, we showed that if an association scheme has at most one relation that is neither strongly regular of…
We associate at each link a connectivity space which describes its splittability properties. Then, the notion of order for finite connectivity spaces results in the definition of a new numerical invariant for links, their connectivity…