Related papers: Self-Correlation and Maximum Independence in Finit…
Continuing with the authors concept (and results) of defining independence for columns of a boolean and superboolean matrix, we apply this theory to finite lattices and finite posets, introducing boolean and superboolean matrix…
We describe a family of conservative statistical tests for independence of two autocorrelated time series. The series may take values in any sets, and one of them must be stationary. A user-specified function quantifying the association of…
This thesis is devoted to studying two tasks: refrigeration and the creation of correlations. In the refrigeration part, two different paradigms of cooling, namely coherent and incoherent, are defined. The connection that these paradigms…
Let $G$ be an acylic directed graph. For each vertex $g \in G$, we define an involution on the independent sets of $G$. We call these involutions flips, and use them to define a new partial order on independent sets of $G$. Trim lattices…
An independent set in a graph is a set of pairwise non-adjacent vertices, and alpha(G) is the size of a maximum independent set in the graph G. A matching is a set of non-incident edges, while mu(G) is the cardinality of a maximum matching.…
This text is devoted to the following result, stemming out works of Bombieri, Masser, Zannier, and Maurin: Let $X$ be an complex algebraic (projective, connected) curve and let us consider $n$ rational functions $f_1,...,f_n$ on $X$ which…
Max-stable processes are natural models for spatial extremes because they provide suitable asymptotic approximations to the distribution of maxima of random fields. In the recent past, several parametric families of stationary max-stable…
In the paper we present a description of complex systems in terms of self-organization processes of prime integer relations. A prime integer relation is an indivisible element made up of integers as the basic constituents following a single…
By Brook's Theorem, every n-vertex graph of maximum degree at most Delta >= 3 and clique number at most Delta is Delta-colorable, and thus it has an independent set of size at least n/Delta. We give an approximate characterization of graphs…
The hard core model in statistical physics is a probability distribution on independent sets in a graph in which the weight of any independent set I is proportional to lambda^(|I|), where lambda > 0 is the vertex activity. We show that…
A \textit{distinguishing partition} of a group $X$ with automorphism group ${aut}(X)$ is a partition of $X$ that is fixed by no nontrivial element of ${aut}(X)$. In the event that $X$ is a complete multipartite graph with its automorphism…
Clustering is a fundamental task in unsupervised learning. The focus of this paper is the Correlation Clustering functional which combines positive and negative affinities between the data points. The contribution of this paper is two fold:…
We explain how to compute correlation functions at zero temperature within the framework of the quantum version of the Separation of Variables (SoV) in the case of a simple model: the XXX Heisenberg chain of spin 1/2 with twisted…
It is well known that while the independence of random variables implies zero correlation, the opposite is not true. Namely, uncorrelated random variables are not necessarily independent. In this note we show that the implication could be…
Given a bipartite system, correlations between its subsystems can be understood as information that each one carries about the other. In order to give a model-independent description of secure information disposal, we propose the paradigm…
We consider the correlations and the hydrodynamic description of random walkers with a general finite memory moving on a $d$ dimensional hypercubic lattice. We derive a drift-diffusion equation and identify a memory-dependent critical…
The independence number $\alpha(G)$ and the dissociation number ${\rm diss}(G)$ of a graph $G$ are the largest orders of induced subgraphs of $G$ of maximum degree at most $0$ and at most $1$, respectively. We consider possible improvements…
This work investigates the intersection property of conditional independence. It states that for random variables $A,B,C$ and $X$ we have that $X$ independent of $A$ given $B,C$ and $X$ independent of $B$ given $A,C$ implies $X$ independent…
We construct an example of a real-valued continuous non-constant function $f$ defined on a connected complete metric space $X$ such that every point of $X$ is a point of local minimum or local maximum for $f$. The space $X$ is connected but…
We consider near-critical two-dimensional statistical systems with boundary conditions inducing phase separation on the strip. By exploiting low-energy properties of two-dimensional field theories, we compute arbitrary $n$-point correlation…