English
Related papers

Related papers: A note on Neumann problems on graphs

200 papers

We study the sets of inertias achieved by Laplacian matrices of weighted signed graphs. First we characterize signed graphs with a unique Laplacian inertia. Then we show that there is a sufficiently small perturbation of the nonzero weights…

Spectral Theory · Mathematics 2019-12-10 Keivan Hassani Monfared , Gary MacGillivray , Dale D. Olesky , Pauline van den Driessche

We show that a wide range of overdetermined boundary problems for semilinear equations with position-dependent nonlinearities admits nontrivial solutions. The result holds true both on the Euclidean space and on compact Riemannian…

Analysis of PDEs · Mathematics 2017-11-27 Miguel Dominguez-Vazquez , Alberto Enciso , Daniel Peralta-Salas

We develop estimates for the solutions and derive existence and uniqueness results of various local boundary value problems for Dirac equations that improve all relevant results known in the literature. With these estimates at hand, we…

Differential Geometry · Mathematics 2017-07-12 Qun Chen , Jürgen Jost , Linlin Sun , Miaomiao Zhu

The graph partition problem is the problem of partitioning the vertex set of a graph into a fixed number of sets of given sizes such that the sum of weights of edges joining different sets is optimized. In this paper we simplify a known…

Optimization and Control · Mathematics 2015-11-25 Edwin R. van Dam , Renata Sotirov

We consider a family of non-compact manifolds $X_\eps$ (``graph-like manifolds'') approaching a metric graph $X_0$ and establish convergence results of the related natural operators, namely the (Neumann) Laplacian $\laplacian {X_\eps}$ and…

Mathematical Physics · Physics 2009-11-11 Olaf Post

In this work, we prove the existence of a family of solutions of the Allen-Cahn equation with nonlinear Neumann boundary condition under some constraints, whose nodal sets concentrate asymptotically to a given volume nondegenerate capillary…

Differential Geometry · Mathematics 2019-03-19 Eduardo Hitomi

Recently, Braunstein et al. [1] introduced normalized Laplacian matrices of graphs as density matrices in quantum mechanics and studied the relationships between quantum physical properties and graph theoretical properties of the underlying…

Quantum Physics · Physics 2011-11-15 Chai Wah Wu

In this paper we consider an initial-boundary value problem related to some network dynamics where the underlying graph has unbounded edges. We show that there exists a C0-semigroup for this problem using a general result from the…

Dynamical Systems · Mathematics 2024-09-19 Adam Błoch

We establish explicit operator norm bounds and essential self-adjointness criteria for discrete Hodge Laplacians on weighted graphs and simplicial complexes. For unweighted $d$-regular graphs we prove the universal estimate…

Spectral Theory · Mathematics 2025-10-22 Marwa Ennaceur , Amel Jadlaoui

Elek and Lippner (2010) showed that the convergence of a sequence of bounded-degree graphs implies the existence of a limit for the proportion of vertices covered by a maximum matching. We provide a characterization of the limiting…

Probability · Mathematics 2012-04-12 Charles Bordenave , Marc Lelarge , Justin Salez

Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the submanifold. The graph Laplacian of such a graph is used in…

Statistics Theory · Mathematics 2007-06-27 Matthias Hein , Jean-Yves Audibert , Ulrike von Luxburg

We prove an abstract criterion on spectral instability of nonnegative selfadjoint extensions of a symmetric operator and apply this to self-adjoint Neumann Laplacians on bounded Lipschitz domains, intervals, and graphs. Our results can be…

Spectral Theory · Mathematics 2024-10-16 Jussi Behrndt , Fritz Gesztesy , Henk de Snoo

The vector Riemann-Hilbert problem is analyzed when the entries of its matrix coefficient are meromorphic and almost periodic functions. Three cases for the meromorphic functions, when they have (i) a finite number of poles and zeros…

Mathematical Physics · Physics 2016-02-17 Yuri A. Antipov

This paper develops analityc methods for investigating uniform hypergraphs. Its starting point is the spectral theory of 2-graphs, in particular, the largest and the smallest eigenvalues of 2-graphs. On the one hand, this simple setup is…

Combinatorics · Mathematics 2013-08-14 Vladimir Nikiforov

In this paper, we introduce isocapacitary constants for the $p$-Laplacian on graphs and apply them to derive estimates for the first eigenvalues of the Dirichlet $p$-Laplacian, the Neumann $p$-Laplacian, and the $p$-Steklov problem.

Analysis of PDEs · Mathematics 2025-11-07 Bobo Hua , Lili Wang

We use the combination of ideas and results from the theory of graph limits and nonlinear evolution equations to provide a rigorous mathematical justification for taking continuum limit for certain nonlocally coupled networks and to extend…

Adaptation and Self-Organizing Systems · Physics 2013-11-25 Georgi S. Medvedev

We show subellipticity of the d-bar Neumann problem on domains with Lipschitz boundary in the presence of plurisubharmonic functions with Hessians of algebraic growth. In particular, a subelliptic estimate holds near a point where the…

Complex Variables · Mathematics 2008-02-03 Emil J. Straube

In this paper we extend to non-compact Riemannian manifolds with boundary the use of two important tools in the geometric analysis of compact spaces, namely, the weak maximum principle for subharmonic functions and the integration by parts.…

Differential Geometry · Mathematics 2013-04-10 Debora Impera , Stefano Pigola , Alberto G. Setti

We build a one-parameter family of S^{1}-invariant metrics on the unit disc with fixed total area for which the second eigenvalue of the Laplace operator in the case of both Neumann and Dirichlet boundary conditions is simple and has an…

Spectral Theory · Mathematics 2007-05-23 P. Freitas

We study some properties of graphs (or, rather, graph sequences) defined by demanding that the number of subgraphs of a given type, with vertices in subsets of given sizes, approximatively equals the number expected in a random graph. It…

Combinatorics · Mathematics 2014-05-28 Svante Janson , Vera T. Sós