Zobrazeno 1 - 10
of 169
pro vyhledávání: '"Janssen, Jeannette"'
We consider a recently proposed approach to graph signal processing based on graphons. We show how the graphon-based approach to GSP applies to graphs sampled from a stochastic block model. We obtain a basis for the graphon Fourier transform on such
Externí odkaz:
http://arxiv.org/abs/2406.06306
We give an algorithm that finds a zero forcing set which approximates the optimal size by a factor of $\text{pw}(G)+1$, where $\text{pw}(G)$ is the pathwidth of $G$. Starting from a path decomposition, the algorithm runs in $O(nm)$ time, where $n$ an
Externí odkaz:
http://arxiv.org/abs/2402.08866
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 directly from a specific graph. In many cases, the network is subject to
Externí odkaz:
http://arxiv.org/abs/2303.17065
Autor:
Janssen, Jeannette, MacKeigan, Kyle
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 colour in one colouring, then those vertices receive distinct colours
Externí odkaz:
http://arxiv.org/abs/2303.08211
Publikováno v:
Applied and Computational Harmonic Analysis 61, pp.121-131 (2022)
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 graphs of similar structure may be represented by a graphon. Theoretica
Externí odkaz:
http://arxiv.org/abs/2109.08646
Autor:
Janssen, Jeannette, Zhang, Zhiyuan
A Robinson similarity matrix is a symmetric matrix where the entry values on all rows and columns increase toward the diagonal. Decompose the Robinson matrix into the sum of k {0, 1}-matrices, then these k {0, 1}-matrices are the adjacency matrices o
Externí odkaz:
http://arxiv.org/abs/2105.09197
Autor:
Ghandehari, Mahya, Janssen, Jeannette
Publikováno v:
In European Journal of Combinatorics February 2024 116
Autor:
Janssen, Jeannette, Smith, Aaron
Publikováno v:
Electronic J. Statistics 16(1): 331-407 (2022)
Consider a random graph process with $n$ vertices corresponding to points $v_{i} \sim {Unif}[0,1]$ embedded randomly in the interval, and where edges are inserted between $v_{i}, v_{j}$ independently with probability given by the graphon $w(v_{i},v_{
Externí odkaz:
http://arxiv.org/abs/2007.06444
Autor:
Ghandehari, Mahya, Janssen, Jeannette
Publikováno v:
European Journal of Combinatorics, 2024, 103859
The function $\Gamma$ on the space of graphons, introduced in [CGH$^+$15], aims to measure the extent to which a graphon $w$ exhibits the Robinson property: for all $x
Externí odkaz:
http://arxiv.org/abs/2005.05253
Autor:
MacKeigan, Kyle, Janssen, Jeannette
Two colourings of a graph are orthogonal if they have the property that when two vertices are coloured with the same colour in one colouring, then those vertices receive distinct colours in the other colouring. In this paper, orthogonal colourings of
Externí odkaz:
http://arxiv.org/abs/1910.14454