Inverse Fiedler vector problem of a graph

Inverse Fiedler vector problem of a graph

Given a graph and one of its weighted Laplacian matrix, a Fiedler vector is an eigenvector with respect to the second smallest eigenvalue. The Fiedler vectors have been used widely for graph partitioning, graph drawing, spectral clustering, and finding the characteristic set. This paper studies how...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Lin, Jephian C. -H, Shirazi, Mahsa N
Format: Artikel
Sprache:eng
Schlagworte:
Mathematics - Combinatorics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Lin, Jephian C. -H
Shirazi, Mahsa N
description Given a graph and one of its weighted Laplacian matrix, a Fiedler vector is an eigenvector with respect to the second smallest eigenvalue. The Fiedler vectors have been used widely for graph partitioning, graph drawing, spectral clustering, and finding the characteristic set. This paper studies how the graph structure can control the possible Fiedler vectors for different weighted Laplacian matrices. For a given tree, we characterize all possible Fiedler vectors among its weighted Laplacian matrix. As an application, the characteristic set can be anywhere on a tree, except for the set containing a single leaf. For a given cycle, we characterize all possible eigenvectors corresponding to the second or the third smallest eigenvalue.
doi_str_mv 10.48550/arxiv.2410.09736
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2410_09736</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2410_09736</sourcerecordid><originalsourceid>FETCH-arxiv_primary_2410_097363</originalsourceid><addsrcrecordid>eNpjYJA0NNAzsTA1NdBPLKrILNMzMgEKGFiaG5txMmh65pWlFhWnKrhlpqbkpBYplKUml-QXKRQU5SflpOYq5KcpJCqkFyUWZPAwsKYl5hSn8kJpbgZ5N9cQZw9dsKHxBUWZuYlFlfEgw-PBhhsTVgEAsC0t4A</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Inverse Fiedler vector problem of a graph</title><source>arXiv.org</source><creator>Lin, Jephian C. -H ; Shirazi, Mahsa N</creator><creatorcontrib>Lin, Jephian C. -H ; Shirazi, Mahsa N</creatorcontrib><description>Given a graph and one of its weighted Laplacian matrix, a Fiedler vector is an eigenvector with respect to the second smallest eigenvalue. The Fiedler vectors have been used widely for graph partitioning, graph drawing, spectral clustering, and finding the characteristic set. This paper studies how the graph structure can control the possible Fiedler vectors for different weighted Laplacian matrices. For a given tree, we characterize all possible Fiedler vectors among its weighted Laplacian matrix. As an application, the characteristic set can be anywhere on a tree, except for the set containing a single leaf. For a given cycle, we characterize all possible eigenvectors corresponding to the second or the third smallest eigenvalue.</description><identifier>DOI: 10.48550/arxiv.2410.09736</identifier><language>eng</language><subject>Mathematics - Combinatorics</subject><creationdate>2024-10</creationdate><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2410.09736$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2410.09736$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Lin, Jephian C. -H</creatorcontrib><creatorcontrib>Shirazi, Mahsa N</creatorcontrib><title>Inverse Fiedler vector problem of a graph</title><description>Given a graph and one of its weighted Laplacian matrix, a Fiedler vector is an eigenvector with respect to the second smallest eigenvalue. The Fiedler vectors have been used widely for graph partitioning, graph drawing, spectral clustering, and finding the characteristic set. This paper studies how the graph structure can control the possible Fiedler vectors for different weighted Laplacian matrices. For a given tree, we characterize all possible Fiedler vectors among its weighted Laplacian matrix. As an application, the characteristic set can be anywhere on a tree, except for the set containing a single leaf. For a given cycle, we characterize all possible eigenvectors corresponding to the second or the third smallest eigenvalue.</description><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNpjYJA0NNAzsTA1NdBPLKrILNMzMgEKGFiaG5txMmh65pWlFhWnKrhlpqbkpBYplKUml-QXKRQU5SflpOYq5KcpJCqkFyUWZPAwsKYl5hSn8kJpbgZ5N9cQZw9dsKHxBUWZuYlFlfEgw-PBhhsTVgEAsC0t4A</recordid><startdate>20241013</startdate><enddate>20241013</enddate><creator>Lin, Jephian C. -H</creator><creator>Shirazi, Mahsa N</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20241013</creationdate><title>Inverse Fiedler vector problem of a graph</title><author>Lin, Jephian C. -H ; Shirazi, Mahsa N</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-arxiv_primary_2410_097363</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Lin, Jephian C. -H</creatorcontrib><creatorcontrib>Shirazi, Mahsa N</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Lin, Jephian C. -H</au><au>Shirazi, Mahsa N</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Inverse Fiedler vector problem of a graph</atitle><date>2024-10-13</date><risdate>2024</risdate><abstract>Given a graph and one of its weighted Laplacian matrix, a Fiedler vector is an eigenvector with respect to the second smallest eigenvalue. The Fiedler vectors have been used widely for graph partitioning, graph drawing, spectral clustering, and finding the characteristic set. This paper studies how the graph structure can control the possible Fiedler vectors for different weighted Laplacian matrices. For a given tree, we characterize all possible Fiedler vectors among its weighted Laplacian matrix. As an application, the characteristic set can be anywhere on a tree, except for the set containing a single leaf. For a given cycle, we characterize all possible eigenvectors corresponding to the second or the third smallest eigenvalue.</abstract><doi>10.48550/arxiv.2410.09736</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2410.09736
ispartof
issn
language eng
recordid cdi_arxiv_primary_2410_09736
source arXiv.org
subjects Mathematics - Combinatorics
title Inverse Fiedler vector problem of a graph
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-14T10%3A12%3A28IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Inverse%20Fiedler%20vector%20problem%20of%20a%20graph&rft.au=Lin,%20Jephian%20C.%20-H&rft.date=2024-10-13&rft_id=info:doi/10.48550/arxiv.2410.09736&rft_dat=%3Carxiv_GOX%3E2410_09736%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true