Permutation Inequalities for Walks in Graphs

03/26/2023
by   Nadja Willenborg, et al.
0

Using spectral graph theory, we show how to obtain inequalities for the number of walks in graphs from nonnegative polynomials and present a new family of such inequalities.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/21/2022

Hoffmann-Jørgensen Inequalities for Random Walks on the Cone of Positive Definite Matrices

We consider random walks on the cone of m × m positive definite matrices...
research
10/14/2019

Negative closed walks in signed graphs: A note

Recently Naserasr, Sopena, and Zaslavsky [R. Naserasr, É. Sopena, T. Zas...
research
09/13/2021

Entropy inequalities for random walks and permutations

We consider a new functional inequality controlling the rate of relative...
research
12/17/2018

Combinatorics of nondeterministic walks of the Dyck and Motzkin type

This paper introduces nondeterministic walks, a new variant of one-dimen...
research
02/25/2017

The natural algorithmic approach of mixed trigonometric-polynomial problems

The aim of this paper is to present a new algorithm for proving mixed tr...
research
10/29/2021

Sampling low-spectrum signals on graphs via cluster-concentrated modes: examples

We establish frame inequalities for signals in Paley–Wiener spaces on tw...
research
05/22/2020

Graph Degree Heterogeneity Facilitates Random Walker Meetings

Various graph algorithms have been developed with multiple random walks,...

Please sign up or login with your details

Forgot password? Click here to reset