Quotient graphs and stochastic matrices

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Cançado, Frederico, Coutinho, Gabriel
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866912118486335488
author Cançado, Frederico
Coutinho, Gabriel
author_facet Cançado, Frederico
Coutinho, Gabriel
contents Whenever graphs admit equitable partitions, their quotient graphs highlight the structure evidenced by the partition. It is therefore very natural to ask what can be said about two graphs that have the same quotient according to certain equitable partitions. This question has been connected to the theory of fractional isomorphisms and covers of graphs in well-known results that we briefly survey in this paper. We then depart to develop theory of what happens when the two graphs have the same symmetrized quotient, proving a structural result connecting this with the existence of certain doubly stochastic matrices. We apply this theorem to derive a new characterization of when two graphs have the same combinatorial quotient, and we also study graphs with weighted vertices and the related concept of pseudo-equitable partitions. Our results connect to known old and recent results, and are naturally applicable to study quantum walks.
format Preprint
id arxiv_https___arxiv_org_abs_2411_09157
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Quotient graphs and stochastic matrices
Cançado, Frederico
Coutinho, Gabriel
Combinatorics
05C69 (Primary), 15B51 (Secondary)
Whenever graphs admit equitable partitions, their quotient graphs highlight the structure evidenced by the partition. It is therefore very natural to ask what can be said about two graphs that have the same quotient according to certain equitable partitions. This question has been connected to the theory of fractional isomorphisms and covers of graphs in well-known results that we briefly survey in this paper. We then depart to develop theory of what happens when the two graphs have the same symmetrized quotient, proving a structural result connecting this with the existence of certain doubly stochastic matrices. We apply this theorem to derive a new characterization of when two graphs have the same combinatorial quotient, and we also study graphs with weighted vertices and the related concept of pseudo-equitable partitions. Our results connect to known old and recent results, and are naturally applicable to study quantum walks.
title Quotient graphs and stochastic matrices
topic Combinatorics
05C69 (Primary), 15B51 (Secondary)
url https://arxiv.org/abs/2411.09157