Related papers: Characterizing the Lovasz theta function via walk …
Chinta, Jorgenson and Karlsson introduced a generalized version of the determinant formula for the Ihara zeta function associated to finite or infinite regular graphs. On the other hand, Konno and Sato obtained a formula of the…
For $k\ge 1$, the $k$-independence number $\alpha_k$ of a graph is the maximum number of vertices that are mutually at distance greater than $k$. The well-known inertia and ratio bounds for the (1-)independence number $\alpha(=\alpha_1)$ of…
In this paper, following the recent paper on Walk/Zeta Correspondence by the first author and his coworkers, we compute the zeta function for the three- and four-state quantum walk and correlated random walk, and the multi-state random walk…
We study the relationship between unit-distance representations and Lovasz theta number of graphs, originally established by Lovasz. We derive and prove min-max theorems. This framework allows us to derive a weighted version of the…
We consider the behaviour of holomorphic functions on a bounded open subset of the plane, satisfying a Lipschitz condition with exponent $\alpha$, with $0<\alpha<1$, in the vicinity of an exceptional boundary point where all such functions…
The paper is devoted to an invariance principle for Kemperman's model of oscillating random walk on $\mathbb{Z}$. This result appears as an extension of the invariance principal theorem for classical random walks on $\mathbb{Z}$ or…
We study a random walk problem on the hierarchical network which is a scale-free network grown deterministically. The random walk problem is mapped onto a dynamical Ising spin chain system in one dimension with a nonlocal spin update rule,…
Given integers $n > k > 0$, and a set of integers $L \subset [0, k-1]$, an \emph{$L$-system} is a family of sets $\mathcal{F} \subset \binom{[n]}{k}$ such that $|F \cap F'| \in L$ for distinct $F, F'\in \mathcal{F}$. $L$-systems correspond…
In this work, we explore a link between an unbounded spin system given by a system of stochastic differential equations and a random walk. This allows us to study the decay of the (co)variance of functions with respect to time. We extend…
We propose new bounds on the domination number and on the independence number of a graph and show that our bounds compare favorably to recent ones. Our bounds are obtained by using the Bhatia-Davis inequality linking the variance, the…
Two classical upper bounds on the Shannon capacity of graphs are the $\vartheta$-function due to Lov\'asz and the minrank parameter due to Haemers. We provide several explicit constructions of $n$-vertex graphs with a constant…
In this paper, we analyze the eigenfunctions of the edge-based Laplacian on a graph and the relationship of these functions to random walks on the graph. We commence by discussing the set of eigenfunctions supported at the vertices, and…
We develop a complete theory for the combinatorics of walk-counting on a directed graph in the case where each backtracking step is downweighted by a given factor. By deriving expressions for the associated generating functions, we also…
We develop a new approach to recurrence and the existence of non-constant harmonic functions on infinite weighted graphs. The approach is based on the capacity of subsets of metric boundaries with respect to intrinsic metrics. The main tool…
The main purpose of this thesis is to study the interplay between geometric properties of infinite graphs and analytic and probabilistic objects such as transition operators, harmonic functions and random walks on these graphs. For a…
Two graphs are isomorphic exactly when they admit the same number of homomorphisms from every graph. Hence, a graph is recognized up to isomorphism by homomorphism counts over the class of all graphs. Restricting to a specific graph class…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
We give a closed formula for Lovasz theta number of the powers of cycle graphs and of their complements, the circular complete graphs. As a consequence, we establish that the circular chromatic number of a circular perfect graph is…
In this short note we prove a lower bound for the MaxCut of a graph in terms of the Lov\'asz theta function of its complement. We combine this with known bounds on the Lov\'asz theta function of complements of $H$-free graphs to recover…
The number of walks of $k$ steps from the node $\mathsf{0}$ to the node $\lambda$ on the representation graph (McKay quiver) determined by a finite group $\mathsf{G}$ and a $\mathsf{G}$-module $\mathsf{V}$ is the multiplicity of the…