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

4285127169 · May 202619922001200920172026
48 results for Fractal geometry

Study on topological order on fractal geometries, proving no-go theorem and fault-tolerant gates.

problem Investigating topological order on fractal geometries embedded in n dimensions.
method Using quantum error-correcting codes and systolic geometry to diagnose topological order.
result Proves no-go theorem for topological order on 2D fractals, survival on higher dimensions, and construction of fault-tolerant gates.

New framework links fractal complexity to separation dimension.

problem Quantifying the complexity of fractal partitions.
method Introducing Separation Dimension ($\sepdim$) and Geometrically Regular Partitions (GRPs).
result Sharp upper bound for chromatic number of fractal partitions.

The paper examines Bitcoin's nature using fractal geometry and finds it highly persistent, affecting predictability and decentralization.

problem Understanding the nature and predictability of Bitcoin prices.
method Statistical analysis of Bitcoin returns using fractal geometry.
result Bitcoin exhibits high persistence in prices, reducing efficiency but increasing predictability.

This paper introduces Hausdorff measure and its applications in fractal geometry.

problem Defining and applying Hausdorff measure to fractal geometry.
method Definition of Hausdorff outer measure, Caratheodory's criterion, construction of Hausdorff measure, and introduction of Hausdorff dimension.
result Demonstrates the Hausdorff dimension of the Cantor ternary set.

We present a general theory of fractal transformations and show how it leads to a new type of method for filtering and transforming digital images. This work substantially generalizes earlier work on fractal tops. The approach involves fractal geometry, chaotic dynamics, and an interplay between discrete and continuous…

2011-02-15abs ↗pdf ↗

This paper evaluates fractal dimension and persistent homology for neural network generalization.

problem Bounding and predicting the generalization gap of neural networks.
method Empirical evaluation of fractal dimension and persistent homology as generalization measures.
result Fractal dimension and persistent homology fail to predict generalization of models trained from poor initializations.

This talk reviews some mathematical and physical ideas related to the notion of dimension. After a brief historical introduction, various modern constructions from fractal geometry, noncommutative geometry, and theoretical physics are invoked and compared.

2005-02-01abs ↗pdf ↗

J. Kigami has laid the foundations of what is now known as analysis on fractals, by allowing the construction of an operator of the same nature of the Laplacian, defined locally, on graphs having a fractal character. The Sierpinski gasket stands out of the best known example. It has, since then, been taken up, develope…

2017-04-14abs ↗pdf ↗

In this paper we use fractal geometry to investigate boundary aspects of the first homology group for finite coverings of the modular surface. We obtain a complete description of algebraically invisible parts of this homology group. More precisely, we first show that for any modular subgroup the geodesic forward dynami…

2006-11-02abs ↗pdf ↗

Smooth fractal trees via analytic generators, preserving combinatorial and geometric properties.

problem Constructing smooth fractal trees from discrete models.
method Using analytic generator fields to integrate smooth vector fields in an internal state space, generating geometric curves as projections of generator trajectories.
result Analytic generators can represent any discrete tree specification and preserve the asymptotic limit geometry.

This work proves generalization bounds for neural networks without Lipschitz assumptions.

problem Proving generalization guarantees for neural networks without Lipschitz continuity.
method Introduces a data-dependent fractal dimension and uses it to prove generalization bounds.
result Generalization bounds are proven without requiring Lipschitz continuity.

We give a brief overview of the theory of complex dimensions of real (archimedean) fractal strings via an illustrative example, the ordinary Cantor string, and a detailed survey of the theory of p-adic (nonarchimedean) fractal strings and their complex dimensions. Moreover, we present an explicit volume formula for the…

2011-05-15abs ↗pdf ↗

We develop tools to study the topology and geometry of self-affine fractals in dimension three and higher. We use the self-affine structure and obtain rather detailed information about the connectedness of interior and boundary sets, and on the dimensions and intersections of boundary sets. As an application, we descri…

2010-02-03abs ↗pdf ↗

Study on heat content for domains with fractal boundaries.

problem Analyzing short-time asymptotics of heat content for domains with fractal boundaries.
method Developing mathematical analysis on de Gennes' hypothesis and exploring fractal curvatures.
result Fractal curvatures and their scaling exponents may emerge in the short-time heat content asymptotics of domains with fractal boundaries.

Labyrinth fractals are self-similar dendrites in the unit square that are defined with the help of a labyrinth set or a labyrinth pattern. In the case when the fractal is generated by a horizontally and vertically blocked pattern, the arc between any two points in the fractal has infinite length [Cristea\&Steinsky 2009…

2018-10-03abs ↗pdf ↗

Paper proves existence of area-minimizing submanifolds on almost any manifold with fractal singular sets.

problem Existence of area-minimizing submanifolds with fractal singular sets.
method Constructing and proving existence on almost any smooth manifold.
result Existence of area-minimizing submanifolds with fractal singular sets on almost any smooth manifold.

The paper proves prevalent existence and partially determines moduli space of area-minimizing surfaces with fractal singular sets.

problem Existence and moduli space of area-minimizing surfaces with fractal singular sets.
method Proof of prevalent existence, determination of moduli space, refinement of strata.
result Sharp results on moduli space and refinement of strata, showing fractal singularities do not completely dissolve under generic perturbations.

Study links fractal structure to generalization in stochastic optimization.

problem Understanding generalization in stochastic optimization algorithms.
method Represented stochastic optimization algorithms as random iterated function systems (IFS) and used dynamical systems theory.
result Proved that generalization error can be bounded based on fractal structure of invariant measure.

Labyrinth fractals are dendrites in the unit square. They were introduced and studied in the last decade first in the self-similar case [Cristea & Steinsky (2009,2011)], then in the mixed case [Cristea & Steinsky (2017), Cristea & Leobacher (2017)]. Supermixed fractals constitute a significant generalisation of mixed l…

2018-02-15abs ↗pdf ↗

We present an Expectation-Maximization algorithm for the fractal inverse problem: the problem of fitting a fractal model to data. In our setting the fractals are Iterated Function Systems (IFS), with similitudes as the family of transformations. The data is a point cloud in RH{\mathbb R}^H with arbitrary dimension HH.…

2017-06-09abs ↗pdf ↗

New framework constructs holographic tensor networks using hyperbolic buildings.

problem Building holographic tensor networks for non-integer dimensions and fractal spaces.
method Introducing a unifying framework based on hyperbolic buildings and dualities.
result Constructs a family of bulk regions satisfying complementary recovery and Ryu-Takayanagi formula.

Many 0/1 datasets have a very large number of variables; on the other hand, they are sparse and the dependency structure of the variables is simpler than the number of variables would suggest. Defining the effective dimensionality of such a dataset is a nontrivial problem. We consider the problem of defining a robust m…

2019-02-04abs ↗pdf ↗

In this pre-print we explore the multi-fractal properties of 1 minute traded volume of the equities which compose the Dow Jones 30. We also evaluate the weights of linear and non-linear dependences in the multi-fractal structure of the observable. Our results show that the multi-fractal nature of traded volume comes es…

2005-12-24abs ↗pdf ↗

We consider (locally) energy finite coordinates associated with a strongly local regular Dirichlet form on a metric measure space. We give coordinate formulas for substitutes of tangent spaces, for gradient and divergence operators and for the infinitesimal generator. As examples we discuss Euclidean spaces, Riemannian…

2015-01-19abs ↗pdf ↗

Estimates box dimension of fractal interpolation surfaces using oscillation vectors.

problem Estimating the complexity of fractal interpolation surfaces.
method Defined vertical scaling matrices and used them to relate oscillation vectors of different levels.
result Obtained the box dimension of generalized affine fractal interpolation surfaces.

This work is an analytical and numerical study of the composition of several fractals into one and of the relation between the composite dimension and the dimensions of the component fractals. In the case of composition of standard IFS with segments of equal size, the composite dimension can be expressed as a function …

2014-07-10abs ↗pdf ↗

This study analyzes how the Indian stock market reacts to budget announcements using fractal methods.

problem Understanding the impact of Union Budget announcements on the Indian stock market.
method Utilizes fractal interpolation function and fractal dimensional analysis to study the NIFTY50 index over -15 to +15 days post-budget day.
result The budget announcements significantly affect the Indian stock market, as evidenced by average abnormal return and cumulative abnormal return.

Fractal Flow enhances normalizing flows with interpretable latent space and hierarchical modeling.

problem High-dimensional density estimation and generative modeling challenges.
method Integrates topic modeling (LDA) and fractal strategy into normalizing flows.
result Achieves latent clustering, controllable generation, and superior estimation accuracy.

Fractal Lipschitz-Killing curvature measures C^f_k(F,.), k = 0, ..., d, are determined for a large class of self-similar sets F in R^d. They arise as weak limits of the appropriately rescaled classical Lipschitz-Killing curvature measures C_k(F_r,.) from geometric measure theory of parallel sets F_r for small distances…

2010-07-05abs ↗pdf ↗

eDCF estimates intrinsic dimension using local connectivity.

problem Challenges in estimating intrinsic dimension due to scale dependence.
method eDCF: a novel, scalable, and parallelizable method based on Connectivity Factor (CF).
result eDCF consistently matches leading estimators with comparable MAE and higher exact intrinsic dimension match rates.