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

20405979 · May 202619922001200920172026
48 results for degree profiles

Efficiently matches random graphs with inhomogeneous edge probabilities.

problem Matching latent vertex correspondence between two correlated random graphs with inhomogeneous edge probabilities.
method Inspired by Ding et al. (2021), an efficient matching algorithm is developed with conditions on minimal average degree and minimal correlation.
result An efficient matching algorithm is obtained as long as the minimal average degree is at least Ω(log2n)Ω(\log^{2} n) and the minimal correlation is at least 1O(log2n)1 - O(\log^{-2} n).

Network data is prevalent in many contemporary big data applications in which a common interest is to unveil important latent links between different pairs of nodes. Yet a simple fundamental question of how to precisely quantify the statistical uncertainty associated with the identification of latent links still remain…

2019-10-03abs ↗pdf ↗

This paper creates a comprehensive BTC transaction network dataset spanning 15 years.

problem Lack of a full-history BTC graph and network property dataset.
method Thorough analysis of BTC transaction network, creating a dataset and investigating decentralization.
result First systematic investigation of BTC's asset decentralization and design of decentralization degrees.

Random graph matching refers to recovering the underlying vertex correspondence between two random graphs with correlated edges; a prominent example is when the two random graphs are given by Erdős-Rényi graphs G(n,dn)G(n,\frac{d}{n}). This can be viewed as an average-case and noisy version of the graph isomorphism problem.…

2018-11-19abs ↗pdf ↗

Study ridge regression for non-identically distributed data with varying variances.

problem Investigate high-dimensional regression with non-identical data variance.
method Propose a random effect model and use tools from random matrix theory.
result Highlight the double descent phenomenon in high-dimensional regression for certain variance profiles.

We argue that some classical local geometries are of infinity origin, i.e. their smooth formal germs are (homotopy) representations of cofibrant (di)operads in spaces concentrated in degree zero. In particular, they admit natural infinity generalizations when one considers homotopy representations of that (di)operads i…

2004-01-05abs ↗pdf ↗

The study quantifies topological expansion properties of complexes and their embeddings.

problem Understanding topological expansion properties of simplicial complexes.
method Quantifying topological expansion through sublinear functions and proving monotonicity under regular maps.
result Proves topological expanders contain graphical expanders and gives lower bounds for specific embeddings.

Machine learning detects subtle glucose changes for early diabetes diagnosis.

problem Challenging early-stage diabetes diagnosis due to subtle glucose changes.
method Applied machine learning to synthetic glucose profiles generated by a biophysical model.
result High accuracy (above 85%) in detecting insulin resistance using various neural networks.

Method selects number of communities in weighted networks.

problem Selecting the number of communities in weighted networks.
method Proposes a novel weighted DCSBM and uses a sequential testing framework with spectral clustering and matrix scaling.
result Method is consistent in estimating the true number of communities under mild conditions.

SIMPLE-RC method tests group membership profiles in large networks with weak signals.

problem Testing group membership profiles in large networks with weak signals.
method Random coupling technique to construct maximum SIMPLE tests for subsampled node pairs.
result Asymptotic distributions of SIMPLE-RC test are derived, enabling delicate analysis.

The vanishing of reduced 2\ell^2-cohomology for amenable groups can be traced to the work of Cheeger & Gromov. The subject matter here is reduced p\ell^p-cohomology for p]1,[p \in ]1,\infty[, particularly its vanishing. Results showing its triviality are obtained, for example: when p]1,2]p \in ]1,2] and GG is amenable; whe…

2013-03-17abs ↗pdf ↗

Elastic co-clustering improves clustering of single-cell genomic data.

problem Improving clustering performance of single-cell genomic datasets.
method Elastic coupled co-clustering in an unsupervised transfer learning framework.
result Our algorithm significantly improves clustering performance over traditional methods.

GCNs favor high-degree nodes, leading to biased performance; a new method mitigates this.

problem Degree-related biases in GCNs, especially for low-degree nodes.
method Developed a novel SL-DSGC that reduces model and data biases.
result SL-DSGC improves GCN accuracy significantly for low-degree nodes.

Prescribing σkσ_k curvature equations are fully nonlinear generalizations of the prescribing Gaussian or scalar curvature equations. Given a positive function KK to be prescribed on the 4-dimensional round sphere. We obtain asymptotic profile analysis for potentially blowing up solutions to the σ2σ_2 curvature equatio…

2009-11-02abs ↗pdf ↗

Method controls extrapolation in prediction profiles for statistical and machine learning models.

problem Avoiding invalid predictions due to extrapolation in prediction profiles.
method Genetic algorithm optimization over constrained factor regions.
result Optimal factor settings without constraint are often invalid and extrapolated.

We equip many non compact non simply connected surfaces with smooth Riemannian metrics whose isoperimetric profile is smooth, a highly non generic property. The computation of the profile is based on a calibration argument, a rearrangement argument, the Bol-Fiala curvature dependent inequality, together with new result…

2007-01-07abs ↗pdf ↗

We introduce a spectrum of monotone coarse invariants for metric measure spaces called Poincaré profiles. The two extremes of this spectrum determine the growth of the space, and the separation profile as defined by Benjamini--Schramm--Timár. In this paper we focus on properties of the Poincaré profiles of groups with …

2017-07-07abs ↗pdf ↗

Logarithmic separation profile in hyperbolic groups shows hierarchical structure.

problem Understanding hierarchical structure in hyperbolic groups with logarithmic separation.
method Proving groups with logarithmic separation split over cyclic groups and providing counterexamples.
result Not all groups with hierarchical structure have logarithmic separation profile.

Framework detects shape shifts in functional profiles using Fréchet mean and shape invariant model.

problem Detecting shape shifts in functional profiles.
method Combining Fréchet mean and shape invariant model for interpretable parameterization of profile deviations.
result Potential shifts in shape deformation process distinguished by significant shifts in amplitude and/or phase.

Study compares isoperimetric profiles on manifolds with integral Ricci curvature bounds.

problem Comparing isoperimetric profiles on manifolds with integral Ricci curvature bounds.
method Extending previous work, the study uses integral bounds on Ricci curvature to prove comparison results for isoperimetric profile functions.
result Comparison results for the Isoperimetric profile function in manifolds with integral bounds on Ricci curvature.

The paper models financial order books using geometric shears and directional liquidity.

problem Understanding the geometry and dynamics of financial order books.
method Structural framework modeling liquidity as emergent observables, geometric shears, and directional imbalances.
result The geometry of financial order books can be described by a rigid drift and geometric shear, leading to a gamma-like profile of projected liquidity.

Estimates lower bounds for isoperimetric profiles and improves on previous estimates for specific manifolds.

problem Estimating lower bounds for isoperimetric profiles of specific Riemannian manifolds.
method Explicit lower bounds for isoperimetric profiles of Riemannian product manifolds.
result Improved lower bounds for isoperimetric profiles and Yamabe constants.

This paper examines multifractal dynamics in cryptocurrencies using two methodologies.

problem Understanding the multifractal nature of cryptocurrencies and their stochastic processes.
method Two alternative multi-scaling methodologies applied to 84 cryptocurrencies.
result Cryptocurrencies exhibit different degrees of long-range dependence and stochastic processes.

In the context of sub-Riemannian Heisenberg groups Hn, n \geq 1, we shall study Isoperimetric Profiles, which are closed compact hypersurfaces having constant horizontal mean curvature, very similar to ellipsoids. Our main goal is to study the stability of Isoperimetric Profiles.

2011-10-04abs ↗pdf ↗

Paper describes profiles of multivariate normal distributions and novel estimators for mutual information.

problem Estimating mutual information for complex distributions.
method Analytical description of profiles, introduction of Bend and Mix Models, Monte Carlo estimation.
result Bend and Mix Models accurately estimate mutual information profiles and provide Bayesian estimates.

Quantum computing tackles non-convex portfolio optimization with cardinality constraints.

problem Non-convex portfolio optimization problems in asset management.
method Application of quantum annealing with non-linear cardinality constraints.
result Quantum portfolio optimization yields smaller, more profitable portfolios.

Random layer-wise pruning profiles are as effective as metric-based ones for various datasets.

problem Reduction of model size and computational resources in neural networks.
method Conducted baseline experiments, developed RL-based search algorithm for finding transferable layer-wise pruning profiles.
result RL-based layer-wise pruning profiles are as good or better than best profiles found on the original dataset via exhaustive search.

The paper develops methods to infer membership probabilities and rank network nodes using the DCMM model.

problem Understanding the latent structure of network data, especially in mixed-membership models.
method Degree-Corrected Mixed Membership (DCMM) model, novel finite-sample expansion, asymptotic distributions, confidence intervals, multiplier bootstrap method.
result Valid inference on membership probabilities and node rankings, quantifying uncertainty.

Graphs with non-negative Ollivier-Ricci curvature cannot be expanders.

problem Understanding the relationship between graph curvature and expansion properties.
method Proving an inequality linking isoperimetric profiles to total variation decay of random walks.
result Graphs with non-negative Ollivier-Ricci curvature cannot be expanders.

The study analyzes how large language models form and express investor risk profiles.

problem Understanding how large language models (LLMs) form and express investor risk profiles.
method Examined three LLMs (GPT, Gemini, and Llama) and assessed their responses to a standardized risk questionnaire under varying prompts.
result LLMs generally form long-term investment profiles, but they exhibit different risk tolerance levels.

A new framework for adaptive behavior using reusable value profiles.

problem Adaptive behavior in changing environments requires switching among value-control regimes, but maintaining separate parameters for each situation is impractical.
method Introduces value profiles: reusable bundles of parameters assigned to hidden states, allowing for state-conditional strategy recruitment without independent parameters for each context.
result Profile-based models outperform simpler alternatives in probabilistic reversal learning, suggesting belief-dependent control of adaptive behavior.

The hypercube's perimeter is significantly larger than expected near half volume.

problem Understanding the isoperimetric profile of the hypercube.
method Analytical proof of perimeter bounds and comparison to Gaussian isoperimetric profile.
result The isoperimetric profile of the hypercube does not converge to the Gaussian profile as dimension increases.

With the maturation of metabolomics science and proliferation of biobanks, clinical metabolic profiling is an increasingly opportunistic frontier for advancing translational clinical research. Automated Machine Learning (AutoML) approaches provide exciting opportunity to guide feature selection in agnostic metabolic pr…

2017-10-09abs ↗pdf ↗

We study the shape of inflated surfaces introduced in \cite{B1} and \cite{P1}. More precisely, we analyze profiles of surfaces obtained by inflating a convex polyhedron, or more generally an almost everywhere flat surface, with a symmetry plane. We show that such profiles are in a one-parameter family of curves which w…

2009-07-29abs ↗pdf ↗

Develops a method to disaggregate aerosol optical depth into vertical extinction profiles.

problem Uncertainty in measuring aerosol vertical distributions due to limited observations.
method Bayesian nonparametric Gaussian process modeling using meteorological predictors.
result Model reconstructs realistic extinction profiles with well-calibrated uncertainty, outperforming idealized baselines.