English
Related papers

Related papers: Graphs at infinity: Liouville theorems, Recurrence…

200 papers

Laplacian operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. An infinite series of trace formulae is obtained which link together two…

Spectral Theory · Mathematics 2014-11-06 Yulia Ershova , Irina I. Karpenko , Alexander V. Kiselev

In finite graphs, finite-order tangles offer an abstract description of highly connected substructures. In infinite graphs, infinite-order tangles compactify the graphs in the same way the ends compactify connected locally finite graphs.…

Combinatorics · Mathematics 2019-08-28 Jan Kurkofka

We study harmonic functions on general weighted graphs which allow for a compatible intrinsic metric. We prove an $L^{p}$ Liouville type theorem which is a quantitative integral $L^{p}$ estimate of harmonic functions analogous to Karp's…

Metric Geometry · Mathematics 2013-09-18 Bobo Hua , Matthias Keller

We introduce a new graph invariant of finite groups that provides a complete characterization of the splitting types of unramified prime ideals in normal number field extensions entirely in terms of the Galois group. In particular, each…

Number Theory · Mathematics 2007-05-23 Fusun Akman

Normalized Laplacian matrices of graphs have recently been studied in the context of quantum mechanics as density matrices of quantum systems. Of particular interest is the relationship between quantum physical properties of the density…

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

The thesis studies linear and semilinear Dirichlet problems driven by different fractional Laplacians. The boundary data can be smooth functions or also Radon measures. The goal is to classify the solutions which have a singularity on the…

Analysis of PDEs · Mathematics 2015-11-03 Nicola Abatangelo

In this paper, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result…

Combinatorics · Mathematics 2012-03-01 Iain Moffatt

We survey some recent regularity results for fractional p-Laplacian elliptic equations, especially focusing on pure and weighted boundary H\"older continuity of the solutions of related Dirichlet problems. Then, we present some applications…

Analysis of PDEs · Mathematics 2024-12-02 Antonio Iannizzotto

We give bounds on the L(2,1)-labeling number of a simple graph in terms of its order and its maximum degree. We also describe an infinite class of graphs of which the elements have the highest L(2,1)-labeling numbers in terms of their…

Combinatorics · Mathematics 2013-11-08 Cole Franks

Dynamic graph theory is a novel, growing area that deals with graphs that change over time and is of great utility in modelling modern wireless, mobile and dynamic environments. As a graph evolves, possibly arbitrarily, it is challenging to…

Computational Complexity · Computer Science 2012-05-28 Bernard Mans , Luke Mathieson

On finite metric graphs we consider Laplace operators, subject to various classes of non-self-adjoint boundary conditions imposed at graph vertices. We investigate spectral properties, existence of a Riesz basis of projectors and similarity…

Spectral Theory · Mathematics 2021-03-30 Amru Hussein , David Krejcirik , Petr Siegl

In this paper, we use the theory of Riordan matrices to introduce the notion of a Riordan graph. The Riordan graphs are a far-reaching generalization of the well known and well studied Pascal graphs and Toeplitz graphs, and also some other…

Combinatorics · Mathematics 2019-04-16 Gi-Sang Cheon , Ji-Hwan Jung , Sergey Kitaev , Seyed Ahmad Mojallal

Due to their elegant and simple nature, unitary Cayley graphs have been an active research topic in the literature. These graphs are naturally connected to several branches of mathematics, including number theory, finite algebra,…

Combinatorics · Mathematics 2024-09-04 Ján Mináč , Tung T. Nguyen , Nguyen Duy Tân

We observe that the Laplacian of a random graph G on N vertices represents and explicitly solvable model in the limit of infinitely increasing N. Namely, we derive recurrent relations for the limiting averaged moments of the adjacency…

Mathematical Physics · Physics 2007-05-23 A. Khorunzhy , V. Vengerovsky

We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…

Combinatorics · Mathematics 2024-06-25 Graham Farr , Kerri Morgan

We consider the class of simple graphs with large algebraic connectivity (the second-smallest eigenvalue of the Laplacian matrix). For this class of graphs we determine the asymptotic behavior of the number of Eulerian orientations. In…

Combinatorics · Mathematics 2013-06-10 Mikhail Isaev

We discuss Neumann problems for self-adjoint Laplacians on (possibly infinite) graphs. Under the assumption that the heat semigroup is ultracontractive we discuss the unique solvability for non-empty subgraphs with respect to the vertex…

Analysis of PDEs · Mathematics 2018-03-26 Michael Hinz , Michael Schwarz

These are lecture notes for the Current Developments in Mathematics conference at Harvard, November, 2011. We discuss topological, probabilistic and combinatorial aspects of the Laplacian on a graph embedded on a surface. The three main…

Probability · Mathematics 2012-03-07 Richard Kenyon

We study diffusions, variational principles and associated boundary value problems on directed graphs with natural weightings. Using random walks and exit times, we associate to certain subgraphs (domains) a pair of sequences, each of which…

Spectral Theory · Mathematics 2007-05-23 Patrick McDonald , Robert Meyers

We present simple graph-theoretic characterizations of Cayley graphs for left-cancellative monoids, groups, left-quasigroups and quasigroups. We show that these characterizations are effective for the end-regular graphs of finite degree.

Discrete Mathematics · Computer Science 2018-03-26 Didier Caucal