We show that if a graph G has the property that all subsets of vertices of size n/4 contain the "correct" number of triangles one would expect to find in a random graph ...
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely...
In a previous paper, we have given an algebraic model to the set of intervals. Here, we apply this model in a linear frame. For example, we define a notion of diagonalization of s...
Undirected graphs are often used to describe high dimensional distributions. Under sparsity conditions, the graph can be estimated using 1 penalization methods. However, current m...
Shuheng Zhou, John D. Lafferty, Larry A. Wasserman
The median and mean graph are basic building blocks for statistical graph analysis and unsupervised pattern recognition methods such as central clustering and graph quantization. ...