Related papers: Uniqueness of exterior differentiation on locally …

This paper is devoted to study a characterization of (strong) local maximal monotonicity in terms of a property involving the graphical derivative of a set-valued mapping defined on a Hilbert space. As a consequence, a second-order…

This paper is intended as an introductory survey of a newly emerging field: a topological approach to the study of locally finite graphs that crucially incorporates their ends. Topological arcs and circles, which may pass through ends,…

We characterize all permutations which realize as the $z$-monodromies of faces in connected simple finite graphs embedded in surfaces whose duals are also simple.

We prove that every locally finite vertex-transitive graph $G$ admits a non-constant Lipschitz harmonic function.

In this note, finite type epimorphisms of rings are characterized.

This article introduces a new approach to discrete curvature based on the concept of effective resistances. We propose a curvature on the nodes and links of a graph and present the evidence for their interpretation as a curvature. Notably,…

We prove the following result: If $G$ be a connected graph on $n \ge 6$ vertices, then there exists a set of vertices $D$ with $|D| \le \frac{n}{3}$ and such that $V(G) \setminus N[D]$ is an independent set, where $N[D]$ is the closed…

We prove that a strictly stable minimal $C^2_h$ intrinsic graph G is locally area-minimizing, i.e. given any $C^1_h$ graph $S$ with the same boundary, $\text{Area}(G)<\text{Area}(S)$ unless $G=S$. As a consequence we show the existence and…

In this article, local limit theorems for sequences of simple random walks on graphs are established. The results formulated are motivated by a variety of random graph models, and explanations are provided as to how they apply to…

We establish a threshold for the connectivity of certain random graphs whose (dependent) edges are determined by the uniform distributions on generalized Orlicz balls, crucially using their negative correlation properties. We also show the…

The vertices of a finite state system are usually a subset of the natural numbers. Most algorithms relative to these systems only use this fact to select vertices. For infinite state systems, however, the situation is different: in…

We show that the deficiency indices of the minimal Gaffney Laplacian on an infinite locally finite metric graph are equal to the number of finite volume graph ends. Moreover, we provide criteria, formulated in terms of finite volume graph…

We prove that a functional with Lipschitzian derivative, when restricted to suitable spheres centered at a noncritical point, has a unique maximum.

In this note, we consider connected graphs with exactly two main eigenvalues. We will give several constructions for them, and as a consequence we show a family of those graphs with an unbounded number of distinct valencies.

Let $\mathbf G$ be a graphing, that is a Borel graph defined by $d$ measure preserving involutions. We prove that if $\mathbf G$ is {\em treeable} then it arises as the local limit of some sequence $(G_n)_{n\in\mathbb{N}}$ of graphs with…

Let $\Gamma$ be a locally finite graph, $L$ the normalized Laplacian of $\Gamma$. If $\Gamma$ is uniformy locally finite, i.e. if each vertex has no more than $d$ adjacent vertices, then the matrix of $L$ (with respect to the standard…

We study cohomology for $p$-local finite groups with non-constant coefficient systems. In particular we show that under certain restrictions there exists a cohomology transfer map in this context, and deduce the standard consequences.

We give a short, self-contained, and easily verifiable proof that determining the outerthickness of a general graph is NP-hard. This resolves a long-standing open problem on the computational complexity of outerthickness. Moreover, our…

We study the discrete Gel'fand's inverse boundary spectral problem of determining a finite weighted graph. Suppose that the set of vertices of the graph is a union of two disjoint sets: $X=B\cup G$, where $B$ is called the set of the…

We give elementary proofs of the following two theorems on automorphisms of a finite group G: (1) An automorphism of G is inner if and only if it extends to an automorphism of every finite group containing G. (2) There exists a finite…