Related papers: Measure preserving homomorphisms and independent s…
We find new upper bounds on the size of a minimum totally dominating set for random regular graphs and for regular graphs with large girth. These bounds are obtained through the analysis of a local algorithm using a method due to Hoppen and…
Extremal graphical models encode the conditional independence structure of multivariate extremes. Key statistics for learning extremal graphical structures are empirical extremal variograms, for which we prove non-asymptotic concentration…
We study periodic points and finitely supported invariant measures for continuous semigroup actions. Introducing suitable notions of periodicity in both topological and measure-theoretical contexts, we analyze the space of invariant Borel…
The maximum likelihood threshold of a graph is the smallest number of data points that guarantees that maximum likelihood estimates exist almost surely in the Gaussian graphical model associated to the graph. We show that this graph…
We study the topological persistence of the (path) configuration spaces and the (path) independence complexes for digraphs as well as their underlying graphs. We construct some canonical embeddings from the (path) independence complexes of…
We introduce a novel evolutionary formulation of the problem of finding a maximum independent set of a graph. The new formulation is based on the relationship that exists between a graph's independence number and its acyclic orientations.…
Partition functions arise in statistical physics and probability theory as the normalizing constant of Gibbs measures and in combinatorics and graph theory as graph polynomials. For instance the partition functions of the hard-core model…
In this paper, we defined three kinds of measures depending on the given finite directed graphs. For the given finite directed graph, we can construct the free semigroupoid, the diagram set and the reduced diagram set, as algebraic…
This paper generalizes and unifies the existing spectral bounds on the $k$-independence number of a graph, which is the maximum size of a set of vertices at pairwise distance greater than $k$. The previous bounds known in the literature…
We introduce a new measure of instability of area-preserving twist diffeomorphisms, which generalizes the notions of angle of splitting of separatrices, and flux through a gap of a Cantori. As an example of application, we establish a sharp…
The independence number of a hypergraph H is the size of a largest set of vertices containing no edge of H. In this paper, we prove new sharp bounds on the independence number of n-vertex (r+1)-uniform hypergraphs in which every r-element…
In this work we give precise asymptotic expressions on the probability of the existence of fixed-size components at the threshold of connectivity for random geometric graphs.
In this paper, we study the graph classification problem from the graph homomorphism perspective. We consider the homomorphisms from $F$ to $G$, where $G$ is a graph of interest (e.g. molecules or social networks) and $F$ belongs to some…
The article presents a new perspective on the isomorphism problem for non-ergodic measure-preserving dynamical systems with discrete spectrum which is based on the connection between ergodic theory and topological dynamics constituted by…
In this paper we examine the use of topological methods for multivariate statistics. Using persistent homology from computational algebraic topology, a random sample is used to construct estimators of persistent homology. This estimation…
The residue of a graph is the number of zeros left after iteratively applying the Havel-Hakimi algorithm to its degree sequence. Favaron, Mah\'{e}o, and Sacl\'{e} showed that the residue is a lower bound on the independence number. The…
We discuss a link between graph theory and geometry that arises when considering graph dynamical systems with odd interactions. The equilibrium set in such systems is not a collection of isolated points, but rather a union of manifolds,…
We introduce the notion of order-preserving multi-homogeneous mapping which allows to study Perron-Frobenius type theorems and nonnegative tensors in unified fashion. We prove a weak and strong Perron-Frobenius theorem for these maps and…
Gaussian graphical models have become a well-recognized tool for the analysis of conditional independencies within a set of continuous random variables. From an inferential point of view, it is important to realize that they are composite…
We present an upper bound on the exponent of the asymptotic behaviour of the tensor rank of a family of tensors defined by the complete graph on $k$ vertices. For $k\geq4$, we show that the exponent per edge is at most 0.77, outperforming…