Related papers: Convex and subharmonic functions on graphs
We define convexity canonically in the setting of monoids. We show that many classical results from convex analysis hold for functions defined on such groups and semigroups, rather than only on vector spaces. Some examples and…
Graphs are naturally sparse objects that are used to study many problems involving networks, for example, distributed learning and graph signal processing. In some cases, the graph is not given, but must be learned from the problem and…
We will prove that a function u(x,y) defined on a domain of RpxRq that is subharmonic in one variable and harmonic in the other is (jointly) subharmonic. This solves a long-standing open problem.
In this paper we show how the superquadratic functions can be used as a tool for researching other types of convex functions like $\phi $-convexity, strong-convexity and uniform convexity. We show how to use inequalities satisfied by…
Graph convexity has been used as an important tool to better understand the structure of classes of graphs. Many studies are devoted to determine if a graph equipped with a convexity is a {\em convex geometry}. In this work we survey…
We consider the problem of finding a subgraph of a given graph minimizing the sum of given functions at vertices evaluated at their subgraph degrees. While the problem is NP-hard already for bipartite graphs when the functions are convex on…
We analyze and characterize maximal monotonicity of linear relations (set-valued operators with linear graphs). An important tool in our study are Fitzpatrick functions. The results obtained partially extend work on linear and at most…
It is established that general s-convex functions are a new class of generalized convex functions. In a similar vein, a new class of general s-convex sets is introduced, which are generalizations of s-convex sets. Additionally, certain…
The purpose of this paper is to generalize the convexity of Mabuchi's functional to the conic setting. We first established a frame to study conic cscK metrics, and then the conic Mabuchi functional was introduced in such a way that conic…
For the minimal graph with strict convex level sets, we find an auxiliary function to study the Gaussian curvature of the level sets. We prove that this curvature function is a concave function with respect to the height of the minimal…
Functions with uniform level sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used, e.g., in multicriteria optimization, decision theory, mathematical…
A key idea in convex optimization theory is to use well-structured affine functions to approximate general functions, leading to impactful developments in conjugate functions and convex duality theory. This raises the question: what are the…
We prove that, in general, given a $p$-harmonic map $F:M\to N$ and a convex function $H:N\to\mathbb{R}$, the composition $H\circ F$ is not $p$-subharmonic. By assuming some rotational symmetry on manifolds and functions, we reduce the…
There has been a great deal of attention recently to graphs whose vertex set is a group, defined using the group structure. (The commuting graph, where two elements are joined if they commute, is the oldest and most famous example.) The…
In this paper, we introduce a new subclass of close-to-convex harmonic functions. We present a sufficient coefficient condition for a function to be a member of this class. Furthermore, we establish a distortion theorem. These results lay…
Graph is an abstract representation commonly used to model networked systems and structure. In problems across various fields, including computer vision and pattern recognition, and neuroscience, graphs are often brought into comparison (a…
In this paper some concepts of convex analysis on hyperbolic space are studied. We first study properties of the intrinsic distance, for instance, we present the spectral decomposition of its Hessian. Next, we study the concept of convex…
First, we give the definition for quasi-nearly subharmonic functions, now for general, not necessarily nonnegative functions, unlike previously. We point out that our function class incudes, among others, quasisubharmonic functions, nearly…
We consider sets and maps defined over an o-minimal structure over the reals, such as real semi-algebraic or subanalytic sets. A {\em monotone map} is a multi-dimensional generalization of a usual univariate monotone function, while the…
Functions with uniform sublevel sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used in multicriteria optimization, decision theory, mathematical…