Related papers: Extensive embeddings into Fra\"iss\'e structures a…
In this paper we show that a countable structure admitting a finite monomorphic decomposition has finite big Ramsey degrees if and only if so does every monomorphic part in its minimal monomorphic decomposition. The necessary prerequisite…
Balogh, Bollob\'{a}s and Morris (2006) have described a threshold phenomenon in the behavior of the profile of hereditary classes of ordered graphs. In this paper, we give an other look at their result based on the notion of monomorphic…
Highly connected and yet sparse graphs (such as expanders or graphs of high treewidth) are fundamental, widely applicable and extensively studied combinatorial objects. We initiate the study of such highly connected graphs that are, in…
We show that in algebraically locally finite countable homogeneous structures with a free stationary independence relation the small index property implies the strong small index property. We use this and the main result of [15] to deduce…
The impact of inhomogeneous arrangement of nodes in space on network organization cannot be neglected in most of real-world scale-free networks. Here, we wish to suggest a model for a geographical network with nodes embedded in a fractal…
We extend the notion of a tree graph to sequences of prime graphs which are cycles and edges and name these non-chordal graphs hollow trees. These structures are especially attractive for palindromic Ising models, which mimic a symmetry of…
We study random relational structures that are \emph{relatively exchangeable}---that is, whose distributions are invariant under the automorphisms of a reference structure $\mathfrak{M}$. When $\mathfrak{M}$ has {\em trivial definable…
We develop the theory of Fra\"iss\'e limits for classes of finite-dimensional multi-seminormed spaces, which are defined to be vector spaces equipped with a finite sequence of seminorms. We define a notion of a Fra\"iss\'e Fr\'echet space…
Let L be a countable language. We say that a countable infinite L-structure M admits an invariant measure when there is a probability measure on the space of L-structures with the same underlying set as M that is invariant under…
We first review an approach that had been developed in the past years to introduce concepts of "bivariate ageing" for exchangeable lifetimes and to analyze mutual relations among stochastic dependence, univariate ageing, and bivariate…
Although species longevity is subject to a diverse range of selective forces, the mortality curves of a wide variety of organisms are rather similar. We argue that aging and its universal characteristics may have evolved by means of a…
In this paper, we investigate the connection between infinite permutation monoids and bimorphism monoids of first-order structures. Taking our lead from the study of automorphism groups of structures as infinite permutation groups and the…
The current understanding of aging phenomena is mainly confined to the study of systems with short-ranged interactions. Little is known about the aging of long-ranged systems. Here, the aging in the phase-ordering kinetics of the…
Continuing with the study of Approximately ultrahomogeneous and Fra\"iss\'e Banach spaces introduced by V. Ferenczi, J. L\'opez-Abad, B. Mbombo and S. Todorcevic, we define formally weaker and in some aspects more natural properties of…
We study the independence structure of finitely exchangeable distributions over random vectors and random networks. In particular, we provide necessary and sufficient conditions for an exchangeable vector so that its elements are completely…
The kinetics of domain growth and aging in conserved order parameter systems, in the presence of short-range interaction, is widely studied. Due to technical difficulties and lack of resources, regarding computation, the dynamics is still…
The number of spanning trees in the giant component of the random graph $\G(n, c/n)$ ($c>1$) grows like $\exp\big\{m\big(f(c)+o(1)\big)\big\}$ as $n\to\infty$, where $m$ is the number of vertices in the giant component. The function $f$ is…
We define the continuous modeling property for first-order structures and show that a first-order structure has the continuous modelling property if and only if its age has the embedding Ramsey property. We use generalized indiscernible…
We investigate a special case of hereditary property in graphs, referred to as {\em robustness}. A property (or structure) is called robust in a graph $G$ if it is inherited by all the connected spanning subgraphs of $G$. We motivate this…
One of the motivations to state HRT conjecture on the linear independence of finite Gabor systems was the fact that there are linearly dependent Finite Wavelet Systems (FWS). Meanwhile, there are also many examples of linearly independent…