Related papers: Bochner formula and Bernstein type estimates on lo…

We apply model theoretic methods to the problem of existence of countable universal graphs with finitely many forbidden connected subgraphs. We show that to a large extent the question reduces to one of local finiteness of an…

Using Wegner-Houghton equation, within the Local Potential Approximation, we study critical properties of O(N) vector models. Fixed Points, together with their critical exponents and eigenoperators, are obtained for a large set of values of…

We study ancient solutions to discrete heat equations on some weighted graphs. On a graph of the form of a product with $\bb Z,$ we show that there are no non-trivial ancient solutions with polynomial growth. This result is parallel to the…

We consider the inverse scattering problems for two types of Schr\"odinger operators on locally perturbed periodic lattices. For the discrete Hamiltonian, the knowledge of the S-matrix for all energies determines the graph structure and the…

We systematically study a natural problem in extremal graph theory, to minimize the number of edges in a graph with a fixed number of vertices, subject to a certain local condition: each vertex must be in a copy of a fixed graph $H$. We…

We introduce the weighted graph Laplacian and the notion of Schr\"odinger operator on a locally finite weighted graph . Concerning essential self-adjointness, we extend Wojciechowski's and Dodziuk's results for graphs with vertex constant…

In the local gluing one glues local neighborhoods around the critical point of the stable and unstable manifolds to gradient flow lines defined on a finite time interval $[-T,T]$ for large $T$. If the Riemannian metric around the critical…

In this paper we design and analyze an explicit partitioned procedure for a 2D dynamic local-to-nonlocal (LtN) coupling problem, based on a new nonlocal Robin-type transmission condition. The nonlocal subproblem is modeled by the nonlocal…

We analyze the heat kernel associated to the Laplacian on a compact metric graph, with standard Kirchoff-Neumann vertex conditions. An explicit formula for the heat kernel as a sum over loops, developed by Roth and Kostrykin, Potthoff, and…

In this paper, we establish a simple formula for computing the Lin-Lu-Yau Ricci curvature on graphs. For any edge $xy$ in a simple locally finite graph $G$, the curvature $\kappa(x,y)$ can be expressed as a cost function of an optimal…

We consider a priori estimates of possibly sign-changing solutions to superlinear parabolic problems and their applications (blow-up rates, energy blow-up, continuity of blow-up time, existence of nontrivial steady states etc). Our…

The graph burning problem is an NP-hard combinatorial optimization problem that helps quantify the vulnerability of a graph to contagion. This paper introduces a simple farthest-first traversal-based approximation algorithm for this problem…

We develop a Logvinenko--Sereda theory for one-dimensional vector-valued self-adjoint operators. We thus deliver upper bounds on $L^2$-norms of eigenfunctions -- and linear combinations thereof -- in terms of their $L^2$- and…

We generalize two embedding theorems and investigate the existence and multiplicity of nontrivial solutions for a $(p,q)$-Laplacian coupled system with perturbations and two parameters $\lambda_1$ and $\lambda_2$ on locally finite graph. By…

Let $G=(V,E)$ be a finite or locally finite connected weighted graph, $\Delta$ be the usual graph Laplacian. Using heat kernel estimate, we prove the existence and nonexistence of global solutions for the following semilinear heat equation…

Based on methods of structural convergence we provide a unifying view of local-global convergence, fitting to model theory and analysis. The general approach outlined here provides a possibility to extend the theory of local-global…

The method of types presented by Csiszar and Korner is a central tool used to develop and analyze the basic properties and constraints on sequences of data over finite alphabets. A central problem considered using these tools is that of…

In classical potential theory, one can solve the Dirichlet problem on unbounded domains such as the upper half plane. These domains have two types of boundary points; the usual finite boundary points and another point at infinity. W. Woess…

We construct models of many-particle quantum graphs with singular two-particle contact interactions, which can be either hardcore- or delta-interactions. Self-adjoint realisations of the two-particle Laplacian including such interactions…

In this note we elaborate on some notions of surface area for discrete graphs which are closely related to the inverse degree. These notions then naturally lead to associated connectivity measures of graphs and to the definition of a…