There are two core challenges we faced with in furthering our understanding of ecological networks across space, particularly at macro-ecologically relevant scales (e.g. Trøjelsgaard & Olesen, 2016). First, within a location difficult to sample properly (Jordano, 2016a, 2016b), resulting widespread ‘Eltonian shortfall’ (Hortal et al., 2015), that is lack knowledge about inter- and intraspecific...

Subspace clustering refers to the problem of segmenting a set of data points approximately drawn from a union of multiple linear subspaces. Aiming at the subspace clustering problem, various subspace clustering algorithms have been proposed and low rank representation based subspace clustering is a very promising and efficient subspace clustering algorithm. Low rank representation method seeks ...

We prove that the filling order is quadratic for a large class of solvable groups and asymptotically quadratic for all Q-rank one lattices in semisimple groups of R-rank at least 3. As a byproduct of auxiliary results we give a shorter proof of the theorem on the nondistorsion of horospheres providing also an estimate of a nondistorsion

The problem of fitting a union of subspaces to a collection of data points drawn from multiple subspaces is considered in this paper. In the traditional low rank representation model, the dictionary used to represent the data points is chosen as the data points themselves and thus the dictionary is corrupted with noise. This problem is solved in the low rank subspace clustering model which deco...