Related papers: Association schemes on triples over few vertices
In this paper we propose a unified framework to simultaneously discover the number of clusters and group the data points into them using subspace clustering. Real data distributed in a high-dimensional space can be disentangled into a union…
We introduce the concept of linked systems of symmetric group divisible designs. The connection with association schemes is established, and as a consequence we obtain an upper bound on the number of symmetric group divisible designs which…
A simple-triangle graph is the intersection graph of triangles that are defined by a point on a horizontal line and an interval on another horizontal line. The time complexity of the recognition problem for simple-triangle graphs was a…
Bipartite graphs model the relationship between two disjoint sets of objects. They have a wide range of applications and are often visualized as a 2-layered drawing, where each set of objects is visualized as a set of vertices (points) on…
Distributed abstract programs are a novel class of distributed optimization problems where (i) the number of variables is much smaller than the number of constraints and (ii) each constraint is associated to a network node. Abstract…
We study the enumeration of alternating links and tangles, considered up to topological (flype) equivalences. A weight $n$ is given to each connected component, and in particular the limit $n\to 0$ yields information about (alternating)…
Visualization of the adjacency matrix enables us to capture macroscopic features of a network when the matrix elements are aligned properly. Community structure, a network consisting of several densely connected components, is a…
Correlation clustering provides a method for separating the vertices of a signed graph into the optimum number of clusters without specifying that number in advance. The main goal in this type of clustering is to minimize the number of…
In this work we present a new simple but efficient scheme - Subsquares approach - for development of algorithms for enclosing the solution set of overdetermined interval linear systems. We are going to show two algorithms based on this…
In this work, we propose a novel representation of complex multi-relational networks, which is compact and allows very efficient network analysis. Multi-relational networks capture complex data relationships and have a variety of…
Let $(X,\mathcal{R})$ be a commutative association scheme and let $\Gamma=(X,R\cup R^\top)$ be a connected undirected graph where $R\in \mathcal{R}$. Godsil (resp., Brouwer) conjectured that the edge connectivity (resp., vertex…
Let $\mathbf{B}$ be a basis for an $r$-dimensional algebra $A$ over a field or commutative ring with unity. The semifusions of $\mathbf{B}$ are the partitions of $\mathbf{B}$ whose characteristic functions form the basis of a subalgebra of…
There are many ideas for developing shock-capturing schemes and their extension for all-speed flow. The representatives of them are Roe, HLL and AUSM families. In this paper, a uniform algorithm is proposed, which expresses three families…
The aim of this work is to enumerate alternating sign matrices (ASM) that are quasi-invariant under a quarter-turn. The enumeration formula (conjectured by Duchon) involves, as a product of three terms, the number of unrestricted ASM's and…
In this paper we show that for any fusion $\mathcal{B}$ of an association scheme $\mathcal{A}$, the generalized Hamming scheme $H(n,\mathcal{B})$ is a nontrivial fusion of $H(n,\mathcal{A})$. We analyze the case where $\mathcal{A}$ is the…
We study Thurston equivalence classes of quadratic post-critically finite branched coverings. For these maps, we introduce and study invariant spanning trees. We give a computational procedure for searching for invariant spanning trees.…
People organize in groups and contagions spread across them. A simple stochastic process, yet complex to model due to dynamical correlations within and between groups. Moreover, groups can evolve if agents join or leave in response to…
We apply methods of nonstandard mathematics in order to regard analytic geometry in a very different way. For example, complex spaces are seen to be the "standard part" of certain algebraic nonstandard schemes. We construct a category of…
We consider the generalised friendship paradox, focussing on the number of triangles at a vertex as the relevant attribute. We show that, contrary to the setting where the attribute is the number of edges at a vertex or the number of wedges…
This is the first paper in a general program to automate skein theoretic arguments. In this paper, we study skein theoretic invariants of planar trivalent graphs. Equivalently, we classify trivalent categories, which are nondegenerate…