We study the problem of testing properties of hypergraphs. The goal of property testing is to distinguish between the case whether a given object has a certain property or is “far away” from the property. We prove that the fundamental problem of -colorability of k-uniform hypergraphs can be tested in time independent of the size of the hypergraph.We present a testing algorithm that examines onl...

Recently,manyworks have focused on the characterization of nonlinear dimensionality reductionmethods obtained by quantizing linear embeddings, e.g. to reach fast processing time, efficient data compression procedures, novel geometry-preserving embeddings or to estimate the information/bits stored in this reduced data representation. In this work, we prove that many linear maps known to respect ...

Dynamic networks are characterized by topologies that varywith time and are represented by time-graphs. The notion of connectivity in time-graphs is fundamentally different from that in static graphs. End-to-end connectivity is achieved opportunistically by the store–carry-forward paradigm if the network is so sparse that source–destination pairs are usually not connected by complete paths. In ...