Related papers: New 2--critical sets in the abelian 2--group
We have recently introduced a multistep extension of the greedy algorithm for modularity optimization. The extension is based on the idea that merging l pairs of communities (l>1) at each iteration prevents premature condensation into few…
Random intersection graphs model networks with communities, assuming an underlying bipartite structure of groups and individuals, where these groups may overlap. Group memberships are generated through the bipartite configuration model.…
The random greedy algorithm for finding a maximal independent set in a graph constructs a maximal independent set by inspecting the graph's vertices in a random order, adding the current vertex to the independent set if it is not adjacent…
In this article, we present two new greedy algorithms for the computation of the lowest eigenvalue (and an associated eigenvector) of a high-dimensional eigenvalue problem, and prove some convergence results for these algorithms and their…
We consider the task of simultaneous clustering of the two node sets involved in a bipartite network. The approach we adopt is based on use of the exact integrated complete likelihood for the latent block model. Using this allows one to…
We use topological methods to study the maximal subgroups of the free idempotent generated semigroup on a biordered set. We use these to give an example of a free idempotent generated semigroup with maximal subgroup isomorphic to the free…
We present new convergence estimates of generalized empirical interpolation methods in terms of the entropy numbers of the parametrized function class. Our analysis is transparent and leads to sharper convergence rates than the classical…
Greedy algorithms have long been a workhorse for learning graphical models, and more broadly for learning statistical models with sparse structure. In the context of learning directed acyclic graphs, greedy algorithms are popular despite…
In this paper we study a new class of bases, weaker than quasi-greedy bases, which retain their unconditionality properties and can provide the same optimality for the thresholding greedy algorithm. We measure how far these bases are from…
This paper defines a generalized column subset selection problem which is concerned with the selection of a few columns from a source matrix A that best approximate the span of a target matrix B. The paper then proposes a fast greedy…
The autocorrelation values of two classes of binary sequences are shown to be good in [6]. We study the 2-adic complexity of these sequences. Our results show that the 2-adic complexity of such sequences is large enough to resist the attack…
This paper focuses on the development of novel greedy techniques for distributed learning under sparsity constraints. Greedy techniques have widely been used in centralized systems due to their low computational requirements and at the same…
We consider the critical group of a hypothetical Moore graph of diameter $2$ and valency $57$. Determining this group is equivalent to finding the Smith normal form of the Laplacian matrix of such a graph. We show that all of the Sylow…
In this article we analyze the structure of $2$-categories of symmetric projective bimodules over a finite dimensional algebra with respect to the action of a finite abelian group. We determine under which condition the resulting…
Motivated by applications in online dating and kidney exchange, the stochastic matching problem was introduced by Chen, Immorlica, Karlin, Mahdian and Rudra (2009). They have proven a 4-approximation of a simple greedy strategy, but…
The greed package implements the general and flexible framework of arXiv:2002.11577 for model-based clustering in the R language. Based on the direct maximization of the exact Integrated Classification Likelihood with respect to the…
The critical behavior of many physical systems involves two competing $n^{}_1-$ and $n^{}_2-$component order-parameters, ${\bf S}^{}_1$ and ${\bf S}^{}_2$, respectively, with $n=n^{}_1+n^{}_2$. Varying an external control parameter $g$,…
We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense,…
The performance of acquisition functions for Bayesian optimisation to locate the global optimum of continuous functions is investigated in terms of the Pareto front between exploration and exploitation. We show that Expected Improvement…
A strong clique in a graph is a clique intersecting every maximal independent set. We study the computational complexity of six algorithmic decision problems related to strong cliques in graphs and almost completely determine their…