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,742 papers · 148 categories

Trend · papers per month

53105158210 · May 202619922001200920172026
48 results for relative centrality

This paper strengthens the central limit theorem for order statistics using relative entropy.

problem Establishing a stronger mode of convergence for central limit behavior of order statistics.
method Using relative entropy to ensure a stronger mode of convergence for central limit behavior of order statistics.
result An order O(1/n)O(1/\sqrt{n}) rate of convergence is established under mild conditions.

New algorithm detects cores in graphs with community structure, improving vertex selection for better clustering.

problem Understanding and detecting core-periphery structures in graphs with community structure.
method Introduces relative centrality to detect cores in graphs with community and core-periphery structures.
result Relative centrality solves bias issues in core detection, leading to better vertex selection and improved clustering performance.

Decentralized learning achieves centralized performance via Gibbs measures.

problem Achieving centralized performance in decentralized machine learning.
method ERM-RER learning framework with Gibbs measures and relative-entropy regularization.
result Achieving centralized performance with Gibbs measures and specific scaling of regularization factors.

The paper explores scaling symmetries in symplectic geometry and their applications to central configurations.

problem Understanding scaling symmetries and their impact on central configurations in symplectic geometry.
method Introducing conformally symplectic maps, conformally Hamiltonian systems, and generalized momentum maps.
result Relative equilibria of scaling symmetries are solutions to specific equations involving the conformal momentum map and primitive one-form.

Let DD be a 2-dimensional closed unit disk and Symp(D,0)rel\rm{Symp}(D,0)_{\rm{rel}} the group of symplectomorphisms preserving the origin and the boundary D\partial D pointwise. We consider the R\mathbb{R}-valued flux homomorphism on Symp(D,0)rel\rm{Symp}(D,0)_{\rm{rel}} and define the central R\mathbb{R}-extension called the $\mathb…

2019-05-20abs ↗pdf ↗

In this paper it is proved that relative hyperbolicity is an invariant of quasi-isometry. As a byproduct of the arguments, simplified definitions of relative hyperbolicity are obtained. In particular we obtain a new definition very similar to the one of hyperbolicity, relying on the existence for every quasi-geodesic t…

2006-05-08abs ↗pdf ↗

Considering mean-variance portfolio problems with uncertain model parameters, we contrast the classical absolute robust optimization approach with the relative robust approach based on a maximum regret function. Although the latter problems are NP-hard in general, we show that tractable inner and outer approximations e…

2013-05-01abs ↗pdf ↗

In this paper we characterize planar central configurations in terms of a sectional curvature value of the Jacobi-Maupertuis metric. This characterization works for the NN-body problem with general masses and any 1/rα1/r^α potential with α>0α> 0. We also observe dynamical consequences of these curvature values for relati…

2017-03-24abs ↗pdf ↗

Given a (smooth) complex analytic family of compact complex manifolds, we prove that the central fibre must be Moishezon if the other fibres are Moishezon. Using a "strongly Gauduchon metric" on the central fibre whose existence was proved in our previous work on limits of projective manifolds, we show that the irreduc…

2010-03-18abs ↗pdf ↗

Threshold found for hyperbolicity in random Coxeter groups.

problem Determining the hyperbolicity threshold in random Coxeter groups.
method Analyzing random right-angled Coxeter groups via Erdős-Rényi graphs and combinatorial properties.
result Threshold p=1/np=1/\sqrt{n} for relative hyperbolicity in random Coxeter groups.

We rigorously prove a central limit theorem for neural network models with a single hidden layer. The central limit theorem is proven in the asymptotic regime of simultaneously (A) large numbers of hidden units and (B) large numbers of stochastic gradient descent training iterations. Our result describes the neural net…

2018-08-28abs ↗pdf ↗

Researchers address the generation of differential invariants for geometric structures.

problem Finite generation of differential algebra of relative differential invariants.
method Investigation of algebraic and differential properties, localization, weight analysis.
result Localization on a finite set of relative invariants makes the differential algebra finitely generated.

We introduce the concept of singular values for the Riemann curvature tensor, a central mathematical tool in Einstein's theory of general relativity. We study the properties related to the singular values, and investigate five typical cases to show its relationship to the Ricci scalar and other invariants.

2018-07-23abs ↗pdf ↗

In this mostly survey paper, we investigate the resonance varieties, the lower central series ranks, and the Chen ranks, as well as the residual and formality properties of several families of braid-like groups: the pure braid groups PnP_n, the welded pure braid groups wPnwP_n, the virtual pure braid groups vPnvP_n, as w…

2016-02-17abs ↗pdf ↗

This paper gives an exposition of relative weight filtrations on completions of mapping class groups associated to a stable degeneration of marked genus g curves. These relative weight filtrations have been constructed using Galois theory (with Matsumoto) and Hodge theory (with Pearlstein and Terasoma). It is shown tha…

2008-02-06abs ↗pdf ↗

Study on when the lower central series stops for various groups, including braid groups.

problem Understanding when the lower central series stops for different groups.
method Various techniques applied to braid groups and related groups.
result Complete computation of the lower central series for most groups studied.

Study compares costs and arbitrage in CEXs vs DEXs, finding DEXs better for large trades.

problem Comparing transaction costs and arbitrage in crypto exchanges.
method Comprehensive dataset analysis of transaction costs and no-arbitrage deviations.
result Fixed gas fees in DEXs impose a significant burden on small trades, while CEXs offer more competitive costs for larger trades.

This paper extends rack and quandle covering theory using higher categorical Galois theory.

problem Developing a higher covering theory of racks and quandles.
method Applying techniques from higher categorical Galois theory to extend and clarify the foundations of rack and quandle coverings.
result Identification of meaningful higher-dimensional centrality conditions defining higher coverings of racks and quandles.

In this paper, we present our general results about traversing flows on manifolds with boundary in the context of the flows on surfaces with boundary. We take advantage of the relative simplicity of 2D2D-worlds to explain and popularize our approach to the Morse theory on smooth manifolds with boundary, in which the bo…

2015-11-10abs ↗pdf ↗

Agents cooperate to make decisions in multi-armed bandits over a graph.

problem Optimizing decisions in multi-agent multi-armed bandits with shared information.
method Designs consensus-based distributed estimation and cooperative algorithms for group decision-making.
result Achieves group performance close to centralized fusion center.

Develops an equilibrium model for securities pricing in a mixed cooperative and non-cooperative market.

problem Equilibrium pricing of securities in a market with cooperative and non-cooperative agents.
method Conditional extended mean-field control for cooperative agents, mean-field model for both cooperative and non-cooperative agents.
result Existence of a unique equilibrium for both finite-agent and mean-field models under certain conditions.

We present one-shot federated learning, where a central server learns a global model over a network of federated devices in a single round of communication. Our approach - drawing on ensemble learning and knowledge aggregation - achieves an average relative gain of 51.5% in AUC over local baselines and comes within 90.…

2019-02-28abs ↗pdf ↗

The paper analyzes variance reduction in stochastic gradient Langevin dynamics.

problem Reducing the variance of stochastic gradient estimators in Langevin dynamics.
method Central limit theorem and Poisson equation analysis for variance characterization.
result Anti-symmetric perturbations can reduce the variance of non-reversible Langevin dynamics.

In this paper, we show that along Q\mathbb Q-Fano fibration, when general fibres, base and central fiber (with at worst Kawamata log terminal singularities)are K-poly stable then there exists a relative Kähler-Einstein metric. We introduce the fiberwise Kähler-Einstein foliation and we mention that the main difficulty…

2017-09-16abs ↗pdf ↗

FSL-BDP models time-to-default without centralizing data, improving privacy mechanisms in federated settings.

problem Traditional credit risk models ignore default timing and violate data-protection rules.
method Federated Survival Learning with Bayesian Differential Privacy (FSL-BDP).
result FSL-BDP improves privacy mechanisms in federated settings, outperforming classical DP in most clients.

The paper strengthens the classical result of MLE convergence to a Gaussian distribution.

problem The classical result of MLE convergence to a Gaussian distribution.
method Sub-Gaussian concentration and entropic normality of the normalized MLE.
result Entropic central limit theorem for a smoothed version of the estimator.

We prove that for a relatively hyperbolic group G there is a sequence of relatively hyperbolic proper quotients such that their growth rates converge to the growth rate of G. Under natural assumptions, the same conclusion holds for the critical exponent of a cusp-uniform action of G on a hyperbolic metric space. As a c…

2013-08-28abs ↗pdf ↗

Finite subgroups of good groups correspond to their profinite completions.

problem Characterizing finite subgroups of profinite completions of good groups.
method Proving bijective correspondence between conjugacy classes of finite p-subgroups in GG and G^\hat{G}, and analyzing centralizers and normalizers.
result Bijective correspondence between conjugacy classes of finite p-subgroups in GG and G^\hat{G}.

Physicists believe, with some justification, that there should be a correspondence between familiar properties of Newtonian gravity and properties of solutions of the Einstein equations. The Positive Mass Theorem (PMT), first proved over twenty years ago \cite{SchoenYau79b,Witten81}, is a remarkable testament to this f…

2003-04-18abs ↗pdf ↗

This paper addresses privacy concerns in ratio statistics using differential privacy.

problem Privacy concerns in ratio statistics across machine learning areas.
method Develops a simple algorithm for differentially private ratio statistics, proving consistency and constructing confidence intervals.
result A simple algorithm can provide excellent privacy, sample accuracy, and bias properties in ratio statistics.

The following discourse is inspired by the works on hyperbolic groups of Epstein, and Neumann/Reeves. Epstein showed that geometrically finite hyperbolic groups are biautomatic. Neumann/Reeves showed that virtually central extensions of word hyperbolic groups are biautomatic. We prove the following generalisation: Theo…

2003-02-20abs ↗pdf ↗

The exploration-exploitation trade-off is among the central challenges of reinforcement learning. The optimal Bayesian solution is intractable in general. This paper studies to what extent analytic statements about optimal learning are possible if all beliefs are Gaussian processes. A first order approximation of learn…

2011-06-04abs ↗pdf ↗