Perturbation of Fiedler vector: interest for graph measures and shape analysis

06/07/2023
by   Julien Lefèvre, et al.
0

In this paper we investigate some properties of the Fiedler vector, the so-called first non-trivial eigenvector of the Laplacian matrix of a graph. There are important results about the Fiedler vector to identify spectral cuts in graphs but far less is known about its extreme values and points. We propose a few results and conjectures in this direction. We also bring two concrete contributions, i) by defining a new measure for graphs that can be interpreted in terms of extremality (inverse of centrality), ii) by applying a small perturbation to the Fiedler vector of cerebral shapes such as the corpus callosum to robustify their parameterization.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/03/2018

Measuring the Robustness of Graph Properties

In this paper, we propose a perturbation framework to measure the robust...
research
09/08/2017

Obstructions to a small hyperbolicity in Helly graphs

It is known that for every graph G there exists the smallest Helly graph...
research
11/27/2022

Dynamic Kernel Sparsifiers

A geometric graph associated with a set of points P= {x_1, x_2, ⋯, x_n }...
research
11/04/2020

Algorithms and Hardness for Linear Algebra on Geometric Graphs

For a function 𝖪 : ℝ^d×ℝ^d→ℝ_≥ 0, and a set P = { x_1, …, x_n}⊂ℝ^d of n ...
research
04/16/2020

Convergence of Eigenvector Continuation

Eigenvector continuation is a computational method that finds the extrem...
research
12/02/2016

SyncSpecCNN: Synchronized Spectral CNN for 3D Shape Segmentation

In this paper, we study the problem of semantic annotation on 3D models ...
research
12/18/2019

Extreme Values of the Fiedler Vector on Trees

Let G be a connected tree on n vertices and let L = D-A denote the Lapla...

Please sign up or login with your details

Forgot password? Click here to reset