English
Related papers

Related papers: The Nitsche--Hopf conjecture for minimal graphs

200 papers

Graph kernels are conventional methods for computing graph similarities. However, the existing R-convolution graph kernels cannot resolve both of the two challenges: 1) Comparing graphs at multiple different scales, and 2) Considering the…

Machine Learning · Computer Science 2024-05-14 Wei Ye , Hao Tian , Qijun Chen

Curvature is a fundamental geometric characteristic of smooth spaces. In recent years different notions of curvature have been developed for combinatorial discrete objects such as graphs. However, the connections between such discrete…

Probability · Mathematics 2023-11-09 Pim van der Hoorn , Gabor Lippner , Carlo Trugenberger , Dmitri Krioukov

We consider a family of non-compact manifolds $X_\eps$ (``graph-like manifolds'') approaching a metric graph $X_0$ and establish convergence results of the related natural operators, namely the (Neumann) Laplacian $\laplacian {X_\eps}$ and…

Mathematical Physics · Physics 2009-11-11 Olaf Post

We establish new Strichartz estimates for orthonormal systems on compact Riemannian manifolds in the non-sharp admissible region of exponents, covering wave, Klein-Gordon, and fractional Schr\"odinger equations. Our approach combines the…

Classical Analysis and ODEs · Mathematics 2026-05-12 Hongzhou Ji , Liping Xu , An Zhang

Let $(M,g)$ be a compact Ricci-flat 4-manifold. For $p \in M$ let $K_{max}(p)$ (respectively $K_{min}(p)$) denote the maximum (respectively the minimum) of sectional curvatures at $p$. We prove that if $$K_{max} (p) \le \ -c K_{min}(p)$$…

Differential Geometry · Mathematics 2012-10-30 Atreyee Bhattacharya , Harish Seshadri

The well-known Schwarz-Pick lemma states that any analytic mapping $\phi$ of the unit disk $U$ into itself satisfies the inequality $$|\phi'(z)|\leq \frac{1-|\phi(z)|^2}{1-|z|^2}, \quad z\in U.$$ This estimate remains the same if we…

Complex Variables · Mathematics 2007-05-23 J. Milne Anderson , Alexander Vasil'ev

A beautiful conjecture of Erd\H{o}s-Simonovits and Sidorenko states that if H is a bipartite graph, then the random graph with edge density p has in expectation asymptotically the minimum number of copies of H over all graphs of the same…

Combinatorics · Mathematics 2010-06-09 David Conlon , Jacob Fox , Benny Sudakov

In a disk graph, every vertex corresponds to a disk in $\mathbb{R}^2$ and two vertices are connected by an edge whenever the two corresponding disks intersect. Disk graphs form an important class of geometric intersection graphs, which…

Data Structures and Algorithms · Computer Science 2024-07-15 Daniel Lokshtanov , Fahad Panolan , Saket Saurabh , Jie Xue , Meirav Zehavi

This paper gives a complete selfcontained proof of our result announced in hep-th/9909126 showing that renormalization in quantum field theory is a special instance of a general mathematical procedure of extraction of finite values based on…

High Energy Physics - Theory · Physics 2009-10-31 Alain Connes , Dirk Kreimer

We prove a pointwise ergodic theorem for quasi-probability-measure-preserving (quasi-pmp) locally countable measurable graphs, equivalently, Schreier graphs of quasi-pmp actions of countable groups. For ergodic graphs, the theorem gives an…

Dynamical Systems · Mathematics 2023-08-29 Anush Tserunyan

Motivated by a recent work of Chen-Zheng [8] on Strominger space forms, we prove that a compact Hermitian surface with pointwise constant holomorphic sectional curvature with respect to a Gauduchon connection $\nabla^t $ is either K\"ahler,…

Differential Geometry · Mathematics 2022-02-15 Haojie Chen , Xiaolan Nie

In this note, we revisit the recursive random contraction algorithm of Karger and Stein for finding a minimum cut in a graph. Our revisit is occasioned by a paper of Fox, Panigrahi, and Zhang which gives an extension of the Karger-Stein…

Data Structures and Algorithms · Computer Science 2020-10-30 David R. Karger , David P. Williamson

The size of the smallest $k$-regular graph of girth at least $g$ is denoted by the well-studied function $n(k,g)$. We introduce an analogous function $n(H,g)$, defined as the smallest size graph of girth at least $g$ that is a lift (or…

Combinatorics · Mathematics 2025-12-25 Shlomo Hoory

In this article I present a simple Newtonian heuristic for deriving a weak-field approximation for the spacetime geometry of a point particle. The heuristic is based on Newtonian gravity, the notion of local inertial frames [the Einstein…

General Relativity and Quantum Cosmology · Physics 2015-06-25 Matt Visser

For an $n$-vertex graph $G$, let $h(G)$ denote the smallest size of a subset of $V(G)$ such that it intersects every maximum independent set of $G$. A conjecture posed by Bollob\'{a}s, Erd\H{o}s and Tuza in early 90s remains widely open,…

Combinatorics · Mathematics 2024-12-06 Xinbu Cheng , Xinqi Huang , Mingyuan Rong , Zixiang Xu

We study graphs with nonnegative Bakry-\'Emery curvature or Ollivier curvature outside a finite subset. For such a graph, via introducing the discrete Gromov-Hausdorff convergence we prove that the space of bounded harmonic functions is…

Differential Geometry · Mathematics 2022-10-04 Bobo Hua , Florentin Münch

In this paper, we prove a new gradient estimate for minimal graphs defined on domains of a complete manifold with Ricci curvature bounded from below. In particular, we show that positive, entire minimal graphs on manifolds with non-negative…

Differential Geometry · Mathematics 2024-01-17 Giulio Colombo , Marco Magliaro , Luciano Mari , Marco Rigoli

We show that if $(X,d,m)$ is an RCD(K,N) space and $u \in W^{1,1}_{loc}(X)$ is a solution of the minimal surface equation, then $u$ is harmonic on its graph (which has a natural metric measure space structure). If K=0 this allows to obtain…

Differential Geometry · Mathematics 2025-03-12 Alessandro Cucinotta

Graph sampling is the problem of choosing a node subset via sampling matrix $\mathbf{H} \in \{0,1\}^{K \times N}$ to collect samples $\mathbf{y} = \mathbf{H} \mathbf{x} \in \mathbb{R}^K$, $K < N$, so that the target signal $\mathbf{x} \in…

Signal Processing · Electrical Eng. & Systems 2022-10-27 Yuejiang Li , Hong Vicky Zhao , Gene Cheung

In this paper, we consider high-dimensional Gaussian graphical models where the true underlying graph is decomposable. A hierarchical $G$-Wishart prior is proposed to conduct a Bayesian inference for the precision matrix and its graph…

Statistics Theory · Mathematics 2021-02-18 Kyoungjae Lee , Xuan Cao