中文
相关论文

相关论文: The Steiner distance problem for large vertex subs…

200 篇论文

This work investigates minimal parametric networks in hyperspaces of closed subsets of metric spaces endowed with the Hausdorff distance. It is shown that the problems of finding such networks are nontrivial only within finiteness classes,…

度量几何 · 数学 2026-05-11 Arsen Galstyan

We consider random walks $X,Y$ on a finite graph $G$ with respective lazinesses $\alpha, \beta \in [0,1]$. Let $\mu_k$ and $\nu_k$ be the $k$-step transition probability measures of $X$ and $Y$. In this paper, we study the Wasserstein…

组合数学 · 数学 2021-10-22 Sophia Benjamin , Arushi Mantri , Quinn Perian

We use Stein's method to bound the Wasserstein distance of order $2$ between a measure $\nu$ and the Gaussian measure using a stochastic process $(X_t)_{t \geq 0}$ such that $X_t$ is drawn from $\nu$ for any $t > 0$. If the stochastic…

概率论 · 数学 2020-05-12 Thomas Bonis

We prove a large deviation principle for the point process of large Poisson $k$-nearest neighbor balls in hyperbolic space. More precisely, we consider a stationary Poisson point process of unit intensity in a growing sampling window in…

概率论 · 数学 2023-04-19 Christian Hirsch , Moritz Otto , Takashi Owada , Christoph Thäle

The Steiner distance of a graph, introduced by Chartrand, Oellermann, Tian and Zou in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least $2$ and $S\subseteq V(G)$, the…

组合数学 · 数学 2015-11-06 Yaping Mao

A convenient framework for dealing with asymptotic limit problems of probabilistic nature is provided. These problems include questions such as finding the asymptotic proportion of terms of a sequence falling inside a given interval, or the…

历史与综述 · 数学 2024-04-08 Michaël Bensimhoun

We introduce the problem of determining if the mode of the output distribution of a quantum circuit (given as a black-box) is larger than a given threshold, named HighDist, and a similar problem based on the absolute values of the…

量子物理 · 物理学 2022-02-23 Debajyoti Bera , Tharrmashastha Sapv

The Wasserstein distance received a lot of attention recently in the community of machine learning, especially for its principled way of comparing distributions. It has found numerous applications in several hard problems, such as domain…

机器学习 · 统计学 2017-10-23 Nicolas Courty , Rémi Flamary , Mélanie Ducoffe

Using a characterizing equation for the Beta distribution, Stein's method is applied to obtain bounds of the optimal order for the Wasserstein distance between the distribution of the scaled number of white balls drawn from a…

概率论 · 数学 2013-01-03 Larry Goldstein , Gesine Reinert

We consider two types of problems: maximising, over subsets $S\subseteq \{0,1\}^n$, the density of $d$-subcubes $C$ in the $n$-hypercube graph that span a subgraph such that $S\cap C$ is i) isomorphic to the given configuration…

组合数学 · 数学 2025-10-08 Levente Bodnár , Oleg Pikhurko

We investigate the size of the distance set determined by two subsets of finite dimensional vector spaces over finite fields. A lower bound of the size is given explicitly in terms of cardinalities of the two subsets. As a result, we…

组合数学 · 数学 2013-04-22 Doowon Koh , Hae-Sang Sun

We present a microscopic approach to quantum dissipation and sketch the derivation of the kinetic equation describing the evolution of a simple quantum system in interaction with a complex quantum system. A typical quantum complex system is…

量子物理 · 物理学 2009-10-31 Aurel Bulgac , Giu Do Dand , Dimitri Kusnezov

This note will prove a discreteness criterion for groups of orientation-preserving isometries of the hyperbolic space which contain a parabolic element. It can be viewed as a generalization of the well-known results of Shimizu-Leutbecher…

几何拓扑 · 数学 2023-09-06 Viveka Erlandsson , Saeed Zakeri

We study the time complexity of the discrete $k$-center problem and related (exact) geometric set cover problems when $k$ or the size of the cover is small. We obtain a plethora of new results: - We give the first subquadratic algorithm for…

计算几何 · 计算机科学 2023-05-04 Timothy M. Chan , Qizheng He , Yuancheng Yu

By variational methods, for a kind of Webster scalar curvature problems on the CR sphere with cylindrically symmetric curvature, we construct some multi-peak solutions as the parameter is sufficiently small under certain assumptions. We…

偏微分方程分析 · 数学 2008-11-27 Daomin Cao , Shuangjie Peng , Shusen Yan

In this article we explore the relationship between the systole and the diameter of closed hyperbolic orientable surfaces. We show that they satisfy a certain inequality, which can be used to deduce that their ratio has a (genus dependent)…

几何拓扑 · 数学 2023-04-03 Florent Balacheff , Vincent Despré , Hugo Parlier

Uncertainty Quantification through stochastic spectral methods is rising in popularity. We derive a modification of the classical stochastic Galerkin method, that ensures the hyperbolicity of the underlying hyperbolic system of partial…

数值分析 · 数学 2018-09-26 Louisa Schlachter , Florian Schneider

A promising approach to investigating high-dimensional problems is to identify their intrinsically low-dimensional features, which can be achieved through recently developed techniques for effective low-dimensional representation of…

偏微分方程分析 · 数学 2025-06-02 Zeyu Jin , Ruo Li

We study a class of quadratic Wasserstein distances on spaces consisting of generalized dynamical systems on a von Neumann algebra. We emphasize how symmetry of such a Wasserstein distance arises, but also study the asymmetric case. This…

算子代数 · 数学 2024-11-05 Rocco Duvenhage

The aim of this work is to study how the asymptotic boundary of a minimal hypersurface in H^nxR determines the behavior of the hypersurface at finite points, in several geometric situations.

微分几何 · 数学 2012-11-13 Barbara Nelli , Ricardo Sa Earp , Eric Toubiana