Related papers: Monotonicity of Steklov eigenvalues on graphs and …
Positive dependencies have been compared in the literature under rather strong assumptions such as equality of conditional distributions, exchangeability, or stationarity. We establish supermodular ordering results for distributions that…
In this article, we study the mixed Steklov--Neumann eigenvalue problem on doubly connected domains. First, we show that among all doubly connected domains in $\mathbb{R}^n$ of the form $B_{R_2}\setminus \overline{B_{R_1}}$, where $B_{R_1}$…
In this note we establish an expression for the Steklov spectrum of warped products in terms of auxiliary Steklov problems for drift Laplacians with weight induced by the warping factor. As an application, we show that a compact manifold…
In this note we study the eigenvalue growth of infinite graphs with discrete spectrum. We assume that the corresponding Dirichlet forms satisfy certain Sobolev-type inequalities and that the total measure is finite. In this sense, the…
In recent work on equiangular lines, Jiang, Tidor, Yuan, Zhang, and Zhao showed that a connected bounded degree graph has sublinear second eigenvalue multiplicity. More generally they show that there cannot be too many eigenvalues near the…
This paper is devoted to the analysis of Steklov eigenvalues and Steklov eigenfunctions on a class of warped product Riemannian manifolds $(M,g)$ whose boundary $\partial M$ consists in two distinct connected components $\Gamma_0$ and…
In this paper we mainly investigate the strong and weak well-posedness of a class of McKean-Vlasov stochastic (partial) differential equations. The main existence and uniqueness results state that we only need to impose some local…
We define a new graph invariant called the scramble number. We show that the scramble number of a graph is a lower bound for the gonality and an upper bound for the treewidth. Unlike the treewidth, the scramble number is not minor monotone,…
Interest in inverse dynamical, spectral and scattering problems for differential equations on graphs is motivated by possible applications to nano-electronics and quantum waveguides and by a variety of other classical and quantum…
We introduce and study Laplacians on a finite metric graph endowed with generalized densities, that is, measures of finite mass. One important motivation is that this setting provides a common framework for several interesting classes of…
We establish maximal trees and graphs for the difference of average distance and proximity proving thus the corresponding conjecture posed in [4]. We also establish maximal trees for the difference of average eccentricity and remoteness and…
Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given `far away' observations. Several theoretical results (and simple algorithms) are available when…
We find sharp conditions on the growth of a rooted regular metric tree such that the Neumann Laplacian on the tree satisfies a Hardy inequality. In particular, we consider homogeneous metric trees. Moreover, we show that a non-trivial…
We construct measures invariant with respect to equivalence relations which are graphed by horospheric products of trees. The construction is based on using conformal systems of boundary measures on treed equivalence relations. The…
We introduce three biharmonic Steklov problems on differential forms with Neumann boundary conditions and show that they are elliptic. We prove the existence of a discrete spectrum for each of those problems and give associated variational…
We investigate a notion of $\times$-homotopy of graph maps that is based on the internal hom associated to the categorical product in the category of graphs. It is shown that graph $\times$-homotopy is characterized by the topological…
This is a survey of known results on estimating the principal Lyapunov exponent of a time-dependent linear differential equation possessing some monotonicity properties. Equations considered are mainly strongly cooperative systems of…
We prove that the Steklov eigenfunctions on convex domains of $\mathbb R^n$ are $H^2$ regular by adapting a classical argument combined with the Rellich-Pohozaev identity.
We consider combinatorial problems that can be solved in polynomial time for graphs of bounded treewidth but where the order of the polynomial that bounds the running time is expected to depend on the treewidth bound. First we review some…
The strip entropy is studied in this article. We prove that the strip entropy approximation is valid for every ray of a golden-mean tree. This result extends the previous result of [Petersen-Salama, Discrete \& Continuous Dynamical Systems,…