17 citations · 66 across the 30 of their papers we have counts for
10 papers · 1 filter
Robust Recovery of Robinson Property in -Graphons: A Cut-Norm Approach
Mahya Ghandehari, Teddy Mishura
This paper investigates the Robinson graphon completion/recovery problem within the class of -graphons, focusing on the range . A graphon is Robinson if it…
A noncommutative approach to the graphon Fourier transform
Mahya Ghandehari, Jeannette Janssen, Nauzer Kalyaniwalla
Signal analysis on graphs relies heavily on the graph Fourier transform, which is defined as the projection of a signal onto an eigenbasis of the associated shift operator. Large g…
Graph sequences sampled from Robinson graphons
Mahya Ghandehari, Jeannette Janssen
The function on the space of graphons, introduced in [CGH15], aims to measure the extent to which a graphon exhibits the Robinson property: for all , $w(x,z)\leq…
An optimization parameter for seriation of noisy data
Jeannette Janssen, Mahya Ghandehari
A square symmetric matrix is a Robinson similarity matrix if entries in its rows and columns are non-decreasing when moving towards the diagonal. A Robinson similarity matrix can b…
Unavoidable subprojections in union-closed set systems of infinite breadth
Yemon Choi, Mahya Ghandehari, Hung Le Pham
We consider union-closed set systems with infinite breadth, focusing on three particular configurations , and ${\mathcal T}_{…
Uniform linear embeddings of graphons
Huda Chuangpishit, Mahya Ghandehari, Jeannette Janssen
Let be a symmetric function, and consider the random process , where vertices are chosen from uniformly at random, and governs the…