DeepAI AI Chat
Log In Sign Up

Consistency of Spectral Seriation

by   Amine Natik, et al.
Université de Montréal

Consider a random graph G of size N constructed according to a graphon w : [0,1]^2↦ [0,1] as follows. First embed N vertices V = {v_1, v_2, …, v_N} into the interval [0,1], then for each i < j add an edge between v_i, v_j with probability w(v_i, v_j). Given only the adjacency matrix of the graph, we might expect to be able to approximately reconstruct the permutation σ for which v_σ(1) < … < v_σ(N) if w satisfies the following linear embedding property introduced in [Janssen 2019]: for each x, w(x,y) decreases as y moves away from x. For a large and non-parametric family of graphons, we show that (i) the popular spectral seriation algorithm [Atkins 1998] provides a consistent estimator σ̂ of σ, and (ii) a small amount of post-processing results in an estimate σ̃ that converges to σ at a nearly-optimal rate, both as N →∞.


page 1

page 2

page 3

page 4


Reconstruction of Line-Embeddings of Graphons

Consider a random graph process with n vertices corresponding to points ...

Efficient Estimation for Random Dot Product Graphs via a One-step Procedure

We propose a one-step procedure to efficiently estimate the latent posit...

Learning random points from geometric graphs or orderings

Suppose that there is a family of n random points X_v for v ∈ V, indepen...

Out-of-sample extension of graph adjacency spectral embedding

Many popular dimensionality reduction procedures have out-of-sample exte...

Joint estimation of parameters in Ising model

We study joint estimation of the inverse temperature and magnetization p...

Graph Encoder Embedding

In this paper we propose a lightning fast graph embedding method called ...

The Four Point Permutation Test for Latent Block Structure in Incidence Matrices

Transactional data may be represented as a bipartite graph G:=(L ∪ R, E)...