Related papers: Monotonicity of Steklov eigenvalues on graphs and …
We consider how the geometry and topology of a compact $n$-dimensional Riemannian orbifold with boundary relates to its Steklov spectrum. In two dimensions, motivated by work of A. Girouard, L. Parnovski, I. Polterovich and D. Sher in the…
The paper is concerned with the doubling estimates and vanishing order of the Steklov eigenfunction on the boundary of a smooth boundary domain $\mathbb R^n$. The eigenfunction is given by a Dirichlet-to-Neumann map. We improve the doubling…
In this paper, inequalities among eigenvalues of different self-adjoint discrete Sturm-Liouville problems are established. For a fixed discrete Sturm-Liouville equation, inequalities among eigenvalues for different boundary conditions are…
In this article, we investigate the weighted Steklov eigenvalue problem and the weighted Schr\"odinger--Steklov eigenvalue problem in outward cuspidal domains. We prove the solvability of these spectral problems in both linear and…
In this paper we revisit an approach pioneered by Auchmuty to approximate solutions of the Laplace- Robin boundary value problem. We demonstrate the efficacy of this approach on a large class of non-tensorial domains, in contrast with other…
Weight-equitable partitions of graphs, which are a natural extension of the well-known equitable partitions, have been shown to be a powerful tool to weaken the regularity assumption in several well-known eigenvalue bounds. In this work we…
Trigraph list homomorphism problems (also known as list matrix partition problems) have generated recent interest, partly because there are concrete problems that are not known to be polynomial time solvable or NP-complete. Thus while…
We give an elementary, self-contained, and purely combinatorial proof of the Rayleigh monotonicity property of graphs.
Persistent homology, a technique from computational topology, has recently shown strong empirical performance in the context of graph classification. Being able to capture long range graph properties via higher-order topological features,…
The Steklov problem on a compact Lipschitz domain is to find harmonic functions on the interior whose outward normal derivative on the boundary is some multiple (eigenvalue) of its trace on the boundary. These eigenvalues form the Steklov…
We survey some of the known results on eigenvalues of Cayley graphs and their applications, together with related results on eigenvalues of Cayley digraphs and generalizations of Cayley graphs.
Let $d \geq 3$ be a fixed integer. We give an asympotic formula for the expected number of spanning trees in a uniformly random $d$-regular graph with $n$ vertices. (The asymptotics are as $n\to\infty$, restricted to even $n$ if $d$ is…
We study the optimization of Steklov eigenvalues with respect to a boundary density function $\rho$ on a bounded Lipschitz domain $\Omega \subset \mathbb{R}^N$. We investigate the minimization and maximization of $\lambda_k(\rho)$, the…
We work out the theory of fractional isomorphism of graphons as a generalization to the classical theory of fractional isomorphism of finite graphs. The generalization is given in terms of homomorphism densities of finite trees and it is…
We provide explicit upper bounds for the eigenvalues of the Laplacian on a finite metric tree subject to standard vertex conditions. The results include estimates depending on the average length of the edges or the diameter. In particular,…
In this paper, we analyze an optimization problem for the first (nonlinear) Steklov eigenvalue plus a boundary potential with respect to the potential function which is assumed to be uniformly bounded and with fixed $L^1$-norm.
We derive eigenvalue bounds for the $t$-distance chromatic number of a graph, which is a generalization of the classical chromatic number. We apply such bounds to hypercube graphs, providing alternative spectral proofs for results by Ngo,…
In this paper, we study large and moderate deviation principles for stochastic partial differential equations (SPDEs) on metric graphs and their associated multiscale models via the weak convergence approach, providing a refined…
We investigate the mean-field dynamics of stochastic McKean differential equations with heterogeneous particle interactions described by large network structures. To express a wide range of graphs, from dense to sparse structures, we…
We study solutions of uniformly elliptic PDE with Lipschitz leading coefficients and bounded lower order coefficients. We extend previous results of A. Logunov concerning nodal sets of harmonic functions and, in particular, prove polynomial…