10 citations · 56 across the 26 of their papers we have counts for
34 papers
Convergence Rates of Ordering, Testing and Estimation Procedures for Graphons With Fast Boundary Decay Rates
Jeannette Janssen, Na Lin, Aaron Smith
In latent-position random graph models (LPMs), latent vertex positions are sampled from some distribution on a latent space , then edges of an observed grap…
The Zero Forcing Number of Twisted Hypercubes
Peter Collier, Jeannette Janssen
Twisted hypercubes are graphs that generalize the structure of the hypercube by relaxing the symmetry constraint while maintaining degree-regularity and connectivity. We study the…
Unified Fourier transform on graphs sampled from stochastic block models
Mahya Ghandehari, Jeannette Janssen, Silo Murphy
Recently, an approach to graph signal processing based on graphons was proposed. Here we show how such a graphon-driven approach to the Fourier transform can be used on graphs samp…
An approximation algorithm for zero forcing
Ben Cameron, Jeannette Janssen, Rogers Matthew +1
We give an algorithm that finds a zero forcing set which approximates the optimal size by a factor of , where is the pathwidth of . Starting from…
Signal processing on large networks with group symmetries
Kathryn Beck, Mahya Ghandehari, Jeannette Janssen +1
Current methods of graph signal processing rely heavily on the specific structure of the underlying network: the shift operator and the graph Fourier transform are both derived dir…
Orthogonal Colourings of Random Geometric Graphs
Jeannette Janssen, Kyle MacKeigan
In this paper, we study orthogonal colourings of random geometric graphs. Two colourings of a graph are orthogonal if they have the property that when two vertices receive the same…