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.

169,341 papers · 148 categories

Trend · papers per month

12253749 · May 202619922001200920182026
48 results for fractional vertices

This paper explores how rational numbers on the Stern-Brocot diagram map to lines when terms are extended.

problem Understanding the geometry of rational numbers on the Stern-Brocot diagram.
method Analyzing continued fraction expansions and their geometric implications on the diagram.
result Vertices of the Stern-Brocot diagram corresponding to extended rational numbers lie on two Euclidean lines.

New conjectures link SU(r) Vafa-Witten invariants to Ramanujan's continued fractions.

problem Exploring new expressions for SU(r) Vafa-Witten partition functions.
method Combining S-duality, Gholampour-Thomas's theory, and Ramanujan's continued fractions.
result Conjectural expressions for SU(r) Vafa-Witten invariants in terms of theta functions and Seiberg-Witten invariants.

Paper analyzes misclassification in binary stochastic block model with correlated degrees.

problem Sharp recovery thresholds for cluster recovery in degree-correlated stochastic block model.
method Connects cluster recovery to tree reconstruction problems, analyzes density evolution of belief propagation on Gaussian approximated trees.
result Minimum fraction of misclassified vertices on average is given by Q(v)Q(\sqrt{v^*}) where vv^* is a fixed point of a specific equation.

Statistical framework for inexact graph matching with errorfully observed graphs.

problem Finding a correspondence between graphs with errors.
method Introducing a corrupting channel model and using maximum likelihood estimation.
result Maximum likelihood estimation is a solution to the inexact graph matching problem.

New algorithm detects communities even with corrupted data, reaching Kesten-Stigum threshold.

problem Robust community detection in stochastic block model with node corruptions.
method Polynomial-time algorithm using Grothendieck norm of principal submatrices.
result First algorithm to achieve weak recovery at Kesten-Stigum threshold with node corruptions.

This paper resolves the all-or-nothing phase transition in graph matching.

problem Recovering vertex correspondence between edge-correlated random graphs.
method Analysis of mutual information, truncated second-moment computation, and maximum likelihood estimator.
result Sharp thresholds for correct matching in both dense and sparse graphs.

This paper sets thresholds for recovering vertex correspondences in partially correlated graphs.

problem Recovering hidden vertex correspondences in partially correlated graphs.
method Proposed partially correlated Erdős-Rényi graphs model; information-theoretic thresholds; correlated functional digraphs.
result Optimal rates for partial and exact recovery of vertex correspondences.

Adversarial inference on tree models is possible with limited corruption, improving on Kesten-Stigum threshold.

problem Posterior inference on tree-structured graphical models in the presence of adversarial corruption.
method Dynamic programming via belief propagation, constrained adversarial corruption.
result Belief propagation can perform accurate inference with limited adversarial corruption.

Geometrical spines are defined for 3-manifolds with natural metrics, in particular, for lens manifolds. We show that any spine of L(p,q) close enough to its geometrical spine (i.e., to the cut locus with respect to the standard metric) contains at least E(p,q)-3 vertices, which is exactly the conjectured value for Matv…

2005-02-16abs ↗pdf ↗

Paper tackles graph matching with partially correct seeds, improving performance guarantees.

problem Graph matching with partially correct seeds.
method Proposes algorithms for matching vertices based on 1-hop and 2-hop neighborhoods, analyzing their performance guarantees.
result New 2-hop algorithm requires fewer correct seeds than the 1-hop algorithm, especially for sparse graphs.

Combines classifiers from different types to improve ensemble accuracy.

problem Improving ensemble accuracy by combining classifiers of different types.
method Builds heterogeneous ensembles by pooling classifiers from multiple homogeneous ensembles, using cross-validation or out-of-bag data for optimal composition.
result Optimal heterogeneous ensemble compositions can be determined using cross-validation or out-of-bag data.

Spectral algorithm recovers community structure in sparse hypergraphs.

problem Community detection in sparse random hypergraphs with community structure and higher-order interactions.
method Spectral algorithm with three steps: hyperedge selection, spectral partition, and correction/merging.
result Weak consistency achieved for weak signal-to-noise ratio.

Legendrian surgery describes canonical contact structures and calculates Gompf's θ-invariant.

problem Understanding canonical contact structures and their properties.
method Legendrian surgery and explicit formulas for Gompf's θ-invariant.
result Explicit description and closed-form formula for Gompf's θ-invariant.

Efficient algorithm for graph matching in correlated stochastic block models.

problem Graph matching in correlated stochastic block models with balanced communities.
method Extends previous work on centered subgraph counts to handle estimation errors and edge correlation.
result First efficient algorithm for graph matching in the logarithmic average degree regime, matching all but a vanishing fraction of vertices with high probability.

A geodesic net with 4 boundary vertices and 25 balanced vertices is constructed.

problem Constructing geodesic nets with specific vertex types and properties.
method Novel approach to increase the number of balanced vertices from 16 to 25.
result First net with four boundary vertices and 25 balanced vertices, including non-symmetric balanced vertices.

In this work we present a new approach on studying dynamical systems. Combining the two ways of expressing the uncertainty, using probabilistic theory and credibility theory, we have research the generalized fractional hybrid equations. We have introduced the concepts of generalized fractional Wiener process, generaliz…

2009-09-15abs ↗pdf ↗

Classifies intrinsically linked tournaments by their score sequences.

problem Classifying intrinsically linked tournaments using their score sequences.
method Examining the score sequences of tournaments and identifying linkless sequences.
result The vast majority of score sequences for 8-vertex tournaments are linkless.

Introduces fractional k-dimensional measure bridging fractional length and area.

problem Defining fractional measures for dimensions between 0 and n-1.
method Introduces a parameterized fractional measure σσ that converges to Hausdorff measure.
result Fractional measure converges to Hausdorff measure with a known constant factor.

The theory of derivative of noninteger order goes back to Leibniz, Liouville and Riemann. Derivatives of fractional order have found many applications in recent studies in mechanics, physics, economics. In this paper we define the fractional tangent bundle on a manifold, using a method of Radu Miron. The fractional Lei…

2007-09-15abs ↗pdf ↗

Let SgS_g be a closed orientable surface of genus g2g \geq 2 and CC a simple closed nonseparating curve in FF. Let tCt_C denote a left handed Dehn twist about CC. A \textit{fractional power} of tCt_C of \textit{exponent} $\fraction{\ell}{n}$ is an $h \in \Mod(S_g)$ such that hn=tCh^n = t_C^{\ell}. Unlike a root of a $t…

2012-07-16abs ↗pdf ↗

We formulate the fractional Ricci flow theory for (pseudo) Riemannian geometries enabled with nonholonomic distributions defining fractional integro-differential structures, for non-integer dimensions. There are constructed fractional analogs of Perelman's functionals and derived the corresponding fractional evolution …

2010-04-05abs ↗pdf ↗

Develops Poisson structures on weak Sobolev loop spaces for integrable systems.

problem Analyzing integrable systems on low regularity loop spaces.
method Extending Mokhov's constructions to weak Sobolev spaces, constructing presymplectic and Poisson structures.
result Valid Poisson structures and deformations for weak Sobolev loops, extending Hamiltonian formalisms.

The study proves fractional-order differences and equations are key to modeling long and short memory in economics.

problem Modeling long and short memory in economic processes with discrete fractional differencing and integration.
method Proved discrete fractional differencing and integration are Grunwald-Letnikov fractional differences of non-integer order d. ARIMA and ARFIMA models are fractional-order difference equations. Proved exact fractional-order differences are needed for power law memory.
result Fractional differential equations are necessary for modeling continuous time long and short memory with power law.

Introduces fractional length and nonlocal curvature for smooth curves.

problem Defining curvature for curves of fractional length.
method Introduces fractional length and derives nonlocal curvature using fractional perimeter analogy.
result Fractional length converges to traditional length with a multiplicative constant.

The paper corrects the Black-Scholes formula for fractional stochastic volatility.

problem Empirical evidence shows that volatility has fractional power decay correlations.
method Develops a fractional Ornstein-Uhlenbeck process for stochastic volatility.
result Implied volatility exhibits a term structure with maturity to a fractional power.

Modeling financial markets with memory using fractional calculus and Brownian motion.

problem Capturing memory effects in financial markets using stochastic models.
method Fractional Langevin equation with colored noise generated by fractional Brownian motion.
result Anomalous marginal glass phase observed in some regions of the system.

Study smooth solutions to fractional mean curvature flow, proving uniqueness and finite extinction time.

problem Understanding evolution of surfaces with fractional mean curvature.
method Established a comparison principle and evolutions equations for fractional geometric quantities.
result Proved uniqueness and finite extinction time for compact solutions.

Extends fractional LpL^p uncertainty principles with extremizers and stability results.

problem Investigating uncertainty principles in fractional LpL^p settings.
method Analyzing the fractional Schrödinger equation to find extremal functions and sharp constants.
result Proves stability of extremizers for fractional uncertainty inequalities.