Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

4997146194 · May 202619922001200920172026
48 results for asymptotically round

Study shows smooth convergence of round surfaces in flat space-time models.

problem Volume preserving mean curvature flow of round surfaces in asymptotically flat spaces.
method Volume preserving mean curvature flow in asymptotically flat 3-manifolds.
result The flow converges smoothly to a stable CMC surface.

In this short article, we prove the existence of ancient solutions of the mean curvature flow that for t -> 0 collapse to a round point, but for t -> -infinity become more and more oval: near the center they have asymptotic shrinkers modeled on round cylinders S^j x R^n-j and near the tips they have asymptotic translat…

2013-08-19abs ↗pdf ↗

New flow expands hypersurfaces in hyperbolic space, showing round limiting shape for certain powers.

problem Understanding the limiting shape of hypersurfaces expanding in hyperbolic space.
method Introduced shifted inverse curvature flow with positive power pp for a smooth curvature function.
result For 0<p10<p\leq 1, limiting shape is always round as maximal existence time is approached.

The paper studies the free elastic flow of closed curves and finds their asymptotic shape converges to a circle.

problem Challenges in studying the asymptotic behavior of the free elastic flow for closed curves.
method Analysis of the free elastic flow as an L2L^2-gradient flow for Euler's elastic energy.
result An appropriate rescaling of initial curves geometrically close to circles converges to a unique round circle.

New algorithm achieves near-optimal performance in dueling bandit problem.

problem Optimizing decision-making in dueling bandit problems with limited adaptive rounds.
method Developed a batched algorithm that matches the asymptotic regret bounds of sequential algorithms under the Condorcet condition.
result Asymptotic regret of O(K2log2(K))+O(Klog(T))O(K^2\log^2(K)) + O(K\log(T)) in O(log(T))O(\log(T)) rounds.

We study how the round-off (or discretization) error changes the statistical properties of a Gaussian long memory process. We show that the autocovariance and the spectral density of the discretized process are asymptotically rescaled by a factor smaller than one, and we compute exactly this scaling factor. Consequentl…

2011-07-22abs ↗pdf ↗

Study on self-consuming generative models with diverse human curation, focusing on convergence and stability.

problem Analyzing self-consuming generative models with heterogeneous human curation.
method Investigates the asymptotic behavior of retraining dynamics using nonlinear Perron--Frobenius theory and Banach contraction mapping.
result Improves convergence results and provides stability and non-stability analyses for the model.

For two disjoint rectifiable star-shaped Jordan curves (including round circles) in the asymptotic boundary of hyperbolic 3-space, if the distance (see Definition 1.8) between these two Jordan curves are bounded from above by some constant, then there exists an annulus-type area minimizing (or equivalently least area) …

2020-01-26abs ↗pdf ↗

Unique steady and expanding solitons with spherical links identified.

problem Characterizing steady and expanding Ricci solitons with specific asymptotic symmetries.
method Symmetry principle applied to asymptotically cylindrical and conical GRSs, proving uniqueness for Bryant solitons.
result Bryant steady and expanding solitons are the unique asymptotically cylindrical and conical GRSs with spherical links under certain conditions.

In this paper, we study self-expanding solutions to a large class of parabolic inverse curvature flows by homogeneous symmetric functions of principal curvatures in Euclidean spaces. These flows include the inverse mean curvature flow and many nonlinear flows in the literature. We first show that the only compact self-…

2017-01-15abs ↗pdf ↗

The article extends previous work on contracting convex hypersurfaces by nonhomogeneous curvature functions.

problem Contraction of convex hypersurfaces by nonhomogeneous functions of curvature.
method Extending previous results to various cases, showing convergence to asymptotically round points under pinching conditions.
result Convergence to asymptotically round points under suitable rescaling and pinching conditions.

The paper mainly concerns the structure at infinity for complete gradient shrinking Ricci solitons. It is shown that for such a soliton with bounded curvature, if the round cylinder R×Sn1/Γ\mathbb{R}\times \mathbb{S}^{n-1}/Γ occurs as a limit for a sequence of points going to infinity along an end, then the end is asymptoti…

2016-06-06abs ↗pdf ↗

Mechanism designs for unknown agent values in stochastic bandit settings.

problem Designing truthful mechanisms for maximizing social welfare in settings with unknown agent values and stochastic feedback.
method Developed a VCG-like mechanism with regret bounds for multi-round allocations, balancing agent and seller welfare.
result Achieved an $Ω(T^{ rac{2}{3}})$ lower bound for the maximum of welfare, agent utilities, and mechanism utility after TT rounds.

We study an extension of the classic stochastic multi-armed bandit problem which involves multiple plays and Markovian rewards in the rested bandits setting. In order to tackle this problem we consider an adaptive allocation rule which at each stage combines the information from the sample means of all the arms, with t…

2020-01-30abs ↗pdf ↗

The paper proves smoothness of mean curvature flow for generic initial data in 3D and 4D.

problem Smoothness of mean curvature flow for generic initial data.
method Long-time existence and uniqueness result for ancient mean curvature flows.
result Smooth mean curvature flow until disappearance in a round point for low-entropy hypersurfaces in 4D.

In this paper we describe a new algorithm called Fast Adaptive Sequencing Technique (FAST) for maximizing a monotone submodular function under a cardinality constraint kk whose approximation ratio is arbitrarily close to 11/e1-1/e, is O(log(n)log2(logk))O(\log(n) \log^2(\log k)) adaptive, and uses a total of O(nloglog(k))O(n \log\log(k)) queries. …

2019-07-14abs ↗pdf ↗

Study of Brown--York mass for four-dimensional asymptotically flat manifolds.

problem Calculating mass for hypersurfaces in four-dimensional asymptotically flat manifolds.
method Intrinsic definition of mean curvature, expansion analysis for large uniformly convex hypersurfaces.
result Shape-dependent correction to ADM mass for nearly round surfaces vanishes under certain conditions.

Smooth solutions and classification of Dirac-Einstein equations on 3-manifolds.

problem Analyzing solutions of Dirac-Einstein equations on R3\mathbb{R}^3.
method Proving smoothness and asymptotic behavior, classifying ground state solutions.
result Scalar part is given by Aubin-Talenti functions, spinorial part is conformal image of 12-\frac{1}{2}-Killing spinors on S3\mathbb{S}^3.

The paper proves the stability of a flow in Schwarzschild space.

problem Stability of area preserving mean curvature flow in asymptotic Schwarzschild space.
method Demonstrates existence and exponential convergence of the flow for all time.
result The flow converges to a round sphere or a constant mean curvature surface.

In this paper we prove that a conformally compact Einstein manifold with the round sphere as its conformal infinity has to be the hyperbolic space. We do not assume the manifolds to be spin, but our approach relies on the positive mass theorem for asymptotic flat manifolds. The proof is based on understanding of positi…

2003-05-06abs ↗pdf ↗

We study "warped Berger" solutions $\big(\mc S^1\times\mc S^3,G(t)\big)$ of Ricci flow: generalized warped products with the metric induced on each fiber {s}×SU(2)\{s\}\times\mathrm{SU}(2) a left-invariant Berger metric. We prove that this structure is preserved by the flow, that these solutions develop finite-time neckpinch …

2013-12-10abs ↗pdf ↗

In this paper we provide a framework for the study of isoperimetric problems in finitely generated group, through a combinatorial study of universal covers of compact simplicial complexes. We show that, when estimating filling functions, one can restrict to simplicial spheres of particular shapes, called "round" and "u…

2015-07-06abs ↗pdf ↗

We prove a Chern-Lashof type formula computing the expected number of critical points of smooth function on a smooth manifold MM randomly chosen from a finite dimensional subspace VC(M)V\subset C^\infty(M) equipped with a Gaussian probability measure. We then use this formula this formula to find the asymptotics of the e…

2010-08-30abs ↗pdf ↗

FedRD improves risk difference estimation in federated learning for clinical outcomes.

problem Privacy-preserving model co-training in medical research is hindered by server-dependent architectures and focus on relative effect measures.
method FedRD is a server-independent, communication-efficient framework for federated risk difference estimation in distributed survival data.
result FedRD provides valid confidence intervals and hypothesis testing, and is asymptotically equivalent to pooled individual-level analysis.

New algorithm achieves online calibration in polynomial time for high-dimensional problems.

problem Online calibration of high-dimensional probability distributions over many days.
method Randomly selects among sub-forecasters, each predicting empirical outcome frequency over recent time windows.
result Achieves asymptotically calibrated strategies after polynomial number of rounds, resolving open questions.

Study optimizes identifying the best arm with fixed rounds and Gaussian outcomes.

problem Designing efficient experiments to identify the best arm with fixed rounds and Gaussian outcomes.
method Developed worst-case lower bounds and the GNA-EBA strategy for optimal identification.
result GNA-EBA strategy is asymptotically worst-case optimal.

Develops methods to learn centre groupings from summary statistics in multi-centre studies.

problem Violation of homogeneity of parameters across centres in multi-centre studies.
method Clusters-of-Centres (CoC) algorithm that merges centres based on multivariate Cochran-type tests.
result Golden-partition recovery as the number of rounds grows with sample size.