相关论文: Graphs at infinity: Liouville theorems, Recurrence…

The purpose of this paper is to develop a "calculus" on graphs that allows graph theory to have new connections to analysis. For example, our framework gives rise to many new partial differential equations on graphs, most notably a new…

We introduce the notion of recurrence and transience for graphs over non-Archimedean ordered field. To do so we relate these graphs to random walks of directed graphs over the reals. In particular, we give a characterization of the real…

In this paper we are concerned with various graph invariants (girth, diameter, expansion constants, eigenvalues of the Laplacian, tree number) and their analogs for weighted graphs -- weighing the graph changes a combinatorial problem to…

In this paper we study the Kato' inequality on locally finite graph. We also study the application of Kato inequality to Ginzburg-Landau equations on such graphs. Interesting properties of Schrodinger equation and a Liouville type theorem…

We discuss the connections tying Laplacian matrices to abstract duality and planarity of graphs.

We investigate the validity of the Liouville property for a class of elliptic equations with a potential, posed on infinite graphs. Under suitable assumptions on the graph and on the potential, we prove that the unique bounded solution is…

We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.

This work is devoted to the study of the relationships between graph theory and the qualitative analysis of ordinary differential equations, with a special focus on two-dimensional systems. In particular, we reinterpret classical results…

We study the physical Laplacian and the corresponding heat flow on an infinite, locally finite graph with possibly unbounded valence.

The Dirichlet problem and Dirichlet to Neumann map are analyzed for elliptic equations on a large collection of infinite quantum graphs. For a dense set of continuous functions on the graph boundary, the Dirichlet to Neumann map has values…

We give inequalities relating the eigenvalues of the adjacency matrix and the Laplacian of a graph, and its minimum and maximum degrees. The results are applied to derive new conditions for quasi-randomness of graphs.

We study the limit theory of large threshold graphs and apply this to a variety of models for random threshold graphs. The results give a nice set of examples for the emerging theory of graph limits.

We study the first eigenvalue of the $p-$Laplacian (with $1<p<\infty$) on a quantum graph with Dirichlet or Kirchoff boundary conditions on the nodes. We find lower and upper bounds for this eigenvalue when we prescribe the total sum of the…

For a finite not necessarily compact metric graph, one considers the differential expression $-\frac{d^2}{d x^2}$ on each edge. The boundary conditions at the vertices of the graph yielding quasi-m-accretive as well as m-accretive operators…

We consider the spectral structure of indefinite second order boundary-value problems on graphs. A variational formulation for such boundary-value problems on graphs is given and we obtain both full and half-range completeness results. This…

We study a special class of graphs with a strong transience feature called uniform transience. We characterize uniform transience via a Feller-type property and via validity of an isoperimetric inequality. We then give a further…

We develop the theory of torsional rigidity -- a quantity routinely considered for Dirichlet Laplacians on bounded planar domains -- for Laplacians on metric graphs with at least one Dirichlet vertex. Using a variational characterization…

We consider the large-scale regularity of solutions to second-order linear elliptic equations with random coefficient fields. In contrast to previous works on regularity theory for random elliptic operators, our interest is in the…

A new algebraic Cayley graph is constructed using finite fields. Its connectedness and diameter bound are studied via Weil's estimate for character sums. These graphs provide a new source of expander graphs, extending classical results of…

We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a…