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

Trend · papers per month

68135203270 · Jun 202019922001200920172026
48 results for Random Check-in

The location-based social network, Foursquare, reflects the human activities of a city. The mobility dynamics inferred from Foursquare helps us understanding urban social events like crime In this paper, we propose a directed graph from the aggregated movement between regions using Foursquare data. We derive region ris…

2019-07-25abs ↗pdf ↗

For each k > 0 we find an explicit function f_k such that the topology of S inside the ball B(p,r) is `bounded' by f_k(r) for every complete Riemannian surface (compact or noncompact) with K\geq -k^2, every point p on the surface, and every r. Using this result, we obtain a characterization (simple to check in practica…

2010-09-20abs ↗pdf ↗

We use tropical curves and toric degeneration techniques to construct closed embedded Lagrangian rational homology spheres in a lot of Calabi-Yau threefolds. We apply this construction to the tropical curves obtained from the 2875 lines on the quintic Calabi-Yau threefold. Each admissible tropical curve gives a Lagrang…

2019-04-26abs ↗pdf ↗

Which area in NYC is the most similar to Lower East Side? What about the NoHo Arts District in Los Angeles? Traditionally this task utilizes information about the type of places located within the areas and some popularity/quality metric. We take a different approach. In particular, urban dwellers' time-variant mobilit…

2019-07-17abs ↗pdf ↗

We argue that the relevant higher gauge group for the non-abelian generalization of the self-dual string equation is the string 2-group. We then derive the corresponding equations of motion and discuss their properties. The underlying geometric picture is a string structure, i.e. a categorified principal bundle with co…

2017-05-05abs ↗pdf ↗

Study combines SEM, OLS, and DML for robustness checks in survey-based research.

problem Stability of SEM findings under alternative estimation frameworks.
method Staged robustness analysis framework connecting SEM, OLS, and DML.
result Identifies stable and unstable relationships across SEM, OLS, and DML checks.

A new Gaussian mechanism for differential privacy in the shuffle model is introduced.

problem Improving differential privacy in distributed learning environments.
method Characterization and upper-bounding of Rényi differential privacy (RDP) for the shuffle Gaussian mechanism.
result The shuffle Gaussian mechanism provides improved privacy guarantees compared to existing methods.

AI agents on social networks rarely engage in extended conversations.

problem Understanding the persistence of interactions in AI-agent social networks.
method Analysis of Moltbook, a social network of AI agents, using interaction half-life and spectral tests.
result Most comments on Moltbook receive a direct reply within seconds, indicating a ``fast response or silence'' regime.

The purpose of this paper is to revisit the Bianchi identities existing for the Riemann and Weyl tensors in the combined framework of the formal theory of systems of partial differential equations (Spencer cohomology, differential systems, formal integrability) and Algebraic Analysis (homological algebra, differential …

2016-03-16abs ↗pdf ↗

Proposes a copula-based filter for diabetes risk prediction.

problem Feature selection for robust and interpretable predictive modeling in medicine, especially for extreme patient strata.
method Copula-based supervised filter using Gumbel-copula implied upper-tail concordance score (lambda U).
result The proposed filter outperforms standard filters and provides clinically coherent predictors.

This paper studies closed 3-manifolds which are the attractors of a system of finitely many affine contractions that tile R3\mathbb{R}^3. Such attractors are called self-affine tiles. Effective characterization and recognition theorems for these 3-manifolds as well as theoretical generalizations of these results to hig…

2014-02-12abs ↗pdf ↗

We introduce trading fees into AMM models and analyze their impact on swap rates and profits.

problem The impact of trading fees on AMM models and users' trading strategies.
method We extend a foundational AMM model by introducing a trading fee parameter and analyze the model using economic and mathematical rigor.
result Trading fees affect the additivity of swap rates and can lead to greater profits from larger trades.

This paper surveys various methods for dimensionality reduction and nearest neighbor search.

problem Efficiently reducing high-dimensional data to lower dimensions while preserving essential information.
method Linear and nonlinear random projections, including sparse random projections, random Fourier Features, and Random Kitchen Sinks.
result Various methods for dimensionality reduction and nearest neighbor search are explained and compared.

The paper studies how norms of random vectors are preserved by random projections.

problem Understanding how random matrix affects norms of random vectors.
method Proved the distribution of the norm of random vector is preserved by random projection.
result Random matrix preserves the distribution of the norm of random vectors with i.i.d. entries.

Orthogonal random features approximate a Bessel kernel, offering sharper bounds than random Fourier features.

problem Approximating Gaussian kernel efficiently for large datasets.
method Use of Haar orthogonal matrices to construct orthogonal random features and analyze their bias and variance.
result Orthogonal random features approximate a Bessel kernel, not the Gaussian kernel, with sharper bounds.

New methods improve prediction performance and reduce computation time in boosting and random forest models.

problem Improving prediction performance and reducing computation time in boosting and random forest models.
method Random tree depth injection approach for Boosting and Random Forests.
result The new methods can improve prediction performance and reduce computation time by up to 40%.

Enhances random forest performance with exogenous randomness.

problem Improving random forest performance through exogenous randomness.
method Developed non-asymptotic MSE expansions for individual trees and forests, identified two types of randomness, and conducted simulations.
result Exogenous randomness, particularly feature subsampling, reduces both bias and variance of random forests.

New random forest method provides optimal rates and confidence bands.

problem Improving random forest regression rates and constructing confidence bands.
method Proposed Ehrenfest centered purely random forests achieve optimal rates; used Gaussian approximation for supremum of empirical processes.
result Explicit asymptotic uniform confidence bands constructed for both random forest types.

Much is known about random right-angled Coxeter groups (i.e., right-angled Coxeter groups whose defining graphs are random graphs under the Erdös-Rényi model). In this paper, we extend this model to study random general Coxeter groups and give some results about random Coxeter groups, including some information about t…

2017-11-13abs ↗pdf ↗

This work estimates edge weights of edge-reinforced random walks using observed data.

problem Statistical estimation of edge weights in edge-reinforced random walks.
method Proposes an estimator based on the generalized method of moments using the magic formula and hyperbolic Gaussian structure.
result Analyzes the sample complexity of the proposed estimator.

Paper proposes diagnostics for error and variance estimation in randomized matrix computations.

problem Safe use of randomized matrix algorithms in applications.
method Leave-one-out error estimator and jackknife resampling method.
result Provides rapid diagnostics to assess quality of randomized matrix computations.

Random forests reduce bias and variance, especially in low SNR settings.

problem Reducing bias and variance in machine learning models, particularly in low SNR scenarios.
method Empirical study of random forests and bagging ensembles, focusing on the importance of mtrymtry tuning.
result Random forests reduce both bias and variance, outperforming bagging ensembles in high SNR settings.

Study finds no significant difference in neural network weights with quantum random numbers.

problem Effects of biased quantum random numbers on neural network initialization.
method Empirical study using quantum hardware and classical pseudo-random numbers.
result No statistically significant difference found between quantum random numbers and other types.