Related papers: Discrete Poincar\'e inequalities and universal app…

Random graph matching refers to recovering the underlying vertex correspondence between two random graphs with correlated edges; a prominent example is when the two random graphs are given by Erd\H{o}s-R\'{e}nyi graphs $G(n,\frac{d}{n})$.…

Steinerberger proposed a notion of curvature on graphs involving the graph distance matrix (J. Graph Theory, 2023). We show that nonnegative curvature is almost preserved under three graph operations. We characterize the distance matrix and…

F.-H. Lin studied minimal graphs of the Dirichlet problem in the hyperbolic space and proved that any such minimal graph has the same global regularity as the boundary if the dimension of the minimal graph is even and that there is an…

Using recent results on string on $AdS_{3}\times N^d$, where N is a d-dimensional compact manifold, we re-examine the derivation of the non trivial extension of the (1+2) dimensional-Poincar\'e algebra obtained by Rausch de Traubenberg and…

Let P_{n,d,D} denote the graph taken uniformly at random from the set of all labelled planar graphs on {1,2,...,n} with minimum degree at least d(n) and maximum degree at most D(n). We use counting arguments to investigate the probability…

We present a method for the resolution of (oscillatory) nonlinear problems. It is based on the application of the Linear Delta Expansion to the Lindstedt-Poincar\'e method. By applying it to the Duffing equation, we show that our method…

Given a multigraph $G$, the all-terminal reliability $R(G,p)$ is the probability that $G$ remains connected under percolation with parameter $p$. Fixing the number of vertices $n$ and edges $m$, we investigate which graphs maximize $R(G,p)$…

We study a natural discrete Bochner-type inequality on graphs, and explore its merit as a notion of curvature in discrete spaces. An appealing feature of this discrete version seems to be that it is fairly straightforward to compute this…

In the paper, we investigate Poincare type inequalities for the functions having zero mean value on the whole boundary of a Lipschitz domain or on a measurable part of the boundary. We derive exact and easily computable constants for some…

In two earlier papers, we designed a distributed deterministic asynchronous algorithm for minimizing the sum of subdifferentiable and proximable functions and a regularizing quadratic on time-varying graphs based on Dykstra's algorithm, or…

This work contributes to nonlocal vector calculus as an indispensable mathematical tool for the study of nonlocal models that arises in a variety of applications. We define the nonlocal half-ball gradient, divergence and curl operators with…

The first nonzero eigenvalue of the Neumann Laplacian is shown to be minimal for the degenerate acute isosceles triangle, among all triangles of given diameter. Hence an optimal Poincar\'{e} inequality for triangles is derived. The proof…

The densest subgraph problem, introduced in the 80s by Picard and Queyranne as well as Goldberg, is a classic problem in combinatorial optimization with a wide range of applications. The lowest outdegree orientation problem is known to be…

Consider a proper geodesic metric space $(X,d)$ equipped with a Borel measure $\mu.$ We establish a family of uniform Poincar\'e inequalities on $(X,d,\mu)$ if it satisfies a local Poincar\'e inequality ($P_{loc}$) and a condition on growth…

We introduce and develop equivalent spectral graph theory for several fundamental graph cut problems including maxcut, mincut, Cheeger cut, anti-Cheeger cut, dual Cheeger problem and their useful variants. A specified strategy for achieving…

In the minimum planarization problem, given some $n$-vertex graph, the goal is to find a set of vertices of minimum cardinality whose removal leaves a planar graph. This is a fundamental problem in topological graph theory. We present a…

We present a novel efficient theoretical and numerical framework for solving global non-convex polynomial optimization problems. We analytically demonstrate that such problems can be efficiently reformulated using a non-linear objective…

We approach the problem of uniformization of general Riemann surfaces through consideration of the curvature equation, and in particular the problem of constructing Poincar\'e metrics (i.e., complete metrics of constant negative curvature)…

In the numerical linear algebra community, it was suggested that to obtain nearly optimal bounds for various problems such as rank computation, finding a maximal linearly independent subset of columns (a basis), regression, or low-rank…

A generalization of the celebrated Falconer distance problem asks for a graph $G=(\mathcal{V},\mathcal{E})$, with vertex set $\mathcal{V}$ and edge set $\mathcal{E}$, how large the Hausdorff dimension of a compact set $E\subset…