Searcharxiv⌕ Search

arXiv subjects

Sushovan Majhi

Publications and source records attributed to Sushovan Majhi.

At least 19 recordsLinked to original sources

Asymptotic Dimension of Persistence Modules of Bounded Presentation

We compute the asymptotic dimension of spaces of multiparameter persistence modules of bounded presentation under the interleaving distance. The $d$-parameter modules with at most $n$ generators and $m$ relations have asymptotic dimension, and Assouad-Nagata dimension, exactly $d(n+m)$, the number of coordinates of their generator and relation grades, over every field; for two parameters this is $2(n+m)$. The space has continuous moduli, already for two parameters and $n,m\ge2$: over an infinite field it contains, at every scale, infinite uniformly separated families of pairwise non-isomorphic modules with one fibered barcode, so it is not doubling even at a fixed fibered barcode; already for $m\ge1$ it is not coarsely equivalent to a proper metric space. The proof is an induction on the number of distinct grade coordinates: an interleaving small compared with the gaps between these coordinates moves each of them by at most twice its size and preserves the induced grid representation, so the continuous moduli are invisible at large scale. Each class of modules at finite distance therefore embeds coarsely into Hilbert space; for two parameters, $n,m\ge2$ and an uncountable field, a class containing such a family admits no coarse embedding into a separable Hilbert space. Under the two-parameter matching distance, on the space of rank invariants, the asymptotic dimension and the Assouad-Nagata dimension are again $2(n+m)$: slope-one slices pin the grid of grades, and over a grid only finitely many rank invariants occur; on a finite net of $S$ slices the asymptotic dimension is at most $2nS$.

math.MG↗

Coarse Embeddings Beyond Doubling: Persistence Diagrams and Multiparameter Modules

We study coarse embeddings into Hilbert space and the asymptotic dimension of spaces of persistence diagrams and multiparameter persistence modules. We build coarse embeddings from admissible tent covers of bounded multiplicity at every scale, which doubling spaces carry but which do not require doubling: stacking them across dyadic scales gives an explicit $1$-Lipschitz coarse embedding, with lower gauge $c\sqrt{τt}$, or nearly linear for slowly decaying weights, and the same covers bound the asymptotic dimension by the multiplicity. The spaces of persistence diagrams are not doubling but carry such covers, and for diagrams with at most $n$ points our covers improve the constant of the known landmark embedding by a factor exponential in $n$. Slice by slice, the construction embeds multiparameter modules with boundedly many bars per slice under the matching distance on any finite net of slices, a class that contains the modules with at most $n$ generators. Under the continuous distances, bounding bars or persistent Betti numbers does not suffice: two-parameter modules with one bar on every slice have infinite asymptotic dimension, and neither they nor the modules of bounded support and bounded rank admit a coarse embedding into Hilbert space, under the matching or the interleaving distance.

math.MG↗

Unsupervised Topological Characterization of Slug, Churn and Annular Flow in Small-Diameter Vertical Pipes Using Euler Characteristic Surfaces

Regime transitions in vertical gas-liquid flow are read from mechanistic models or assigned by eye, and for churn flow neither route has produced a settled criterion. We ask how much an unsupervised topological description of flow video can establish about them. The description is the Euler characteristic surface, a count of the connected gas and liquid regions in each frame across morphological scales. Kernels derived from it are combined by unsupervised multiple kernel learning, and the trials are divided into contiguous groups along gas velocity. For 37 air-water trials in 2-in. tubing at one liquid rate, with three viewing stations averaged, four groups are separated at 4.33, 7.51 and 11.70 m/s. Each division falls at or within one trial of a change in the visual evaluation of the same videos; cuts placed at random would match as closely in 12% of cases. The divisions move between viewing stations and under resampling, a kernel built on gas velocity divides any sampled range into roughly equal parts and cannot locate a transition, and the data do not support a revised transition criterion. On independent images from an annulus, churn shows about three times the across-scale variance of slug. Within the band the published criteria assign to churn, the two upper cuts fall at graded changes in the rankings, consistent with a progression within churn; if confirmed by further data, they would subdivide the churn region.

cs.LG↗

Mixup Barcodes for Topology-Aware Financial Decision Making

We present a topology-aware system based on mixup barcodes and persistent homology for financial decision making. The suggested approach uses topological summaries obtained from Takens delay embeddings of a univariate price series to quantify structural changes between reference and current market regimes. The 1-Wasserstein distance between persistence diagrams, a mixup barcode disruption index, and persistence entropy divergence are combined to provide a novel stress score. A Golden Cross trading method is dynamically modulated by this score, which transforms a binary buy/sell signal into a continuous position-sizing process. At embedding settings chosen by maximizing in-sample Sharpe over a 72-point grid, in-sample assessment on the S&P 500 and Bitcoin yields Sharpe ratios of 1.116 and 1.238, respectively, with much lower maximum drawdown compared with both Buy-and-Hold and the standard Golden Cross baseline. Our findings imply that topological summaries of market geometry include useful information that goes beyond traditional trend markers.

stat.AP↗

Where Do Two Populations of Persistence Diagrams Differ? Calibrated Local Inference at a Fixed Budget

Many two-sample tests for populations of persistence diagrams assess global differences without identifying the regions of the birth-death plane that contribute to them. We study simultaneous inference for local mean contrasts when the number of available diagrams is fixed. They are differences in expected weighted feature mass within $\ell_\infty$ neighborhoods at several centers and radii. We estimate these contrasts using additive landmark responses. A Gaussian multiplier bootstrap calibrates simultaneous confidence intervals while allowing unequal group covariances. The neighborhoods whose intervals exclude zero form a map with approximate family-wise error control, and selecting a subset of original intervals for display preserves their joint coverage guarantee. On the simultaneous coverage event, every reported neighborhood lies within twice its radius of the support of the mean-measure difference. A geometric result gives sufficient radius conditions for a displaced feature to produce a nonzero contrast. A comparison of sufficient detection thresholds quantifies the tradeoff between reducing the number of tested coordinates and reserving observations for an independent pilot. In simulations with 40 to 120 diagrams per class, the bands achieved 94%-98% simultaneous coverage under both the strict null and equal means with unequal covariances. In the latter setting, a permutation maximum and the pooled-t implementation of the two-stage persistence-image test of Moon and Lazar rejected in up to 32% and 26% of runs, respectively. In the fixed-budget simulations, spending a third of the observations on a pilot to choose landmarks or radii located changes less often than a prespecified grid at a single radius. On the MUTAG benchmark, the localized region concentrates on rings of fused-ring systems, an exploratory reading.

stat.ME↗

The Null Is the Hard Part: Exact Tests for Memorization in Generative Models

Memorization audits of generative models read similarity scores against thresholds, with no null distribution, and the conclusions they support can be wrong. By MemBench's rule, the benchmark's mitigations roughly halve Stable Diffusion's memorization; audited with false-discovery control, two thirds of the certified images are no longer detected under random prompt perturbations, five sixths under attention rescaling, and all of them under embedding optimization. The field's data-copying test, read against its own null, flags ten of twenty-four generators that reproduce nothing. We argue that for memorization the null is the hard part, and supply two. For a whole model, training and held-out images are exchangeable given its samples, and relabelling them is a permutation test, exact for any statistic when the held-out images are a random split; under it, a nearest-neighbour preference still fires on seven of those twenty-four, and a count restricted to the near-duplicate scale on none (McNemar p=0.016). For single images, the natural nulls fail twice, measurably: ranking an image among random images yields 596 false discoveries among 2,365 controls, and resampling independent generations makes the null three times too narrow. Calibrated against matched controls, the audit certifies 36 of 61 MemBench images at 5% false-discovery rate, held-out controls are certified in 0.01% of calibration splits, and on this benchmark two generations per image recover that count. A calibrated maximum, which reads occasional rather than typical copying, certifies 46. As the scale-restricted statistic we recommend the small-scale mass of the Intersection Euler Characteristic Profile, which also counts distinct images copied and tests whether two models copy the same ones.

cs.LG↗

A constant-factor approximation of the Gromov-Hausdorff distance in the plane

We give the first polynomial-time constant-factor approximation of the Gromov-Hausdorff distance d_GH between finite point sets in the Euclidean plane; in fixed Euclidean dimension such an approximation was previously known only on the line (Majhi, Vitter and Wenk, 2024). Global alignment cannot succeed: the classical dimension drop defeats alignment by isometries, a multiplicity gap defeats alignment by bijections, and a reflection barrier defeats sorting under any single global reflection pattern. The algorithm is therefore local. Guessing the images of one diameter pair pins every point's longitudinal coordinate to within O(d_GH). Heights are read in windows whose height spread is at most a fixed multiple of their length, where a chain argument makes every compatible match local in the plane. One reflection sign per window is then chosen by 2-SAT; at the right frame and guess, any solution yields a correspondence of distortion O(d_GH). For the bijective relative of d_GH, half the least additive distortion over bijections, the same scheme reduces the planar problem to a matching question that we leave open.

cs.CG↗

Certified Topological Interaction in Neural Representations: Exact Tests and the Statistic They Require

Class disentanglement--the separation of a representation's class-conditional point clouds along depth and over training--is measured by descriptive curves: the sentence such a study wants to write, layer l+1 is more disentangled than layer l, is an eyeball judgement with no null. We supply the inferential layer for a topological measurement of class overlap, the Intersection Euler Characteristic Profile: the Euler characteristic of the overlap of the clouds' ball unions as a function of scale, from one Alpha-complex sweep with no boundary-matrix reduction. Every number carries a test--exact permutation tests in both directions, a guarded separation certificate the invariant requires, and a paired sign-flip test for comparative claims. Building that test taught a lesson outliving this invariant: its statistic must be scale-free. On the raw profile mass, which has units of feature length, 12,375 paired tests return 5,633 significant steps of which every one at the first epoch points the wrong way, certifying feature-norm dynamics as disentanglement; the dimensionless statistic returns 2,707, with 2,026 decreases. Across 111 networks and 52,650 measurements, disentanglement is depth-graded and early, and interaction quotients rank class pairs by confusability (rho=0.83), on par with cheap separability statistics. In a 96-model factorial, augmentation is the one training choice that separates classes relative to chance; weight decay compresses the overlap without separating. Only a k-fold statistic can pose the structural question: the joint entanglement of a class triple sits below its strongest pair in 97% of triple-layer cells and 99.5% of deep cells, at median ratios far below a measured null floor, in vision encoders and frozen language models--a regularity, not a law. The unnormalized mass predicts test accuracy (R^2=0.94), the quotient does not, and neither beats a linear probe.

cs.LG↗

COMPLEX: A Closed-Form Certified Embedding of Multiparameter Persistence Modules

Every multiparameter persistence vectorization we know of carries a one-sided Lipschitz upper bound and nothing below it: without a lower gauge there is no sense in which the features are faithful, and no per-prediction guarantee can be built on them. This paper supplies the missing side. COMPLEX is a closed-form, training-free embedding of multiparameter modules -- slice the module along a fixed near-diagonal net, embed each slice barcode by the certified PLACE/PALACE landmark map, concatenate. Under a checkable witnessing-slice coherence condition, holding on 100% of audited pairs on Orbit5k, a single slice carries a closed-form lower gauge: separated modules stay separated in the embedding. With the standard upper bound this gives, to our knowledge, the first two-sided distortion bound for a multiparameter feature map, making faithfulness measurable. Measuring it, we find the floor tight within a small factor of realized distances yet operationally local: an RBF-SVM reaches 91% where 1-NN reaches 78% on the same features. Local per-prediction certification therefore fails for a structural reason common to every landmark embedding whose lower gauge is witnessed by one coordinate. With no learned embedding and no held-out calibration -- only a cross-validated SVM head -- COMPLEX sets the state of the art on both Orbit benchmarks (91.95% on Orbit5k, 92.98% on Orbit100k), level with or above Euler-characteristic surfaces and above transformers and graphcode. On graphs it exceeds GRIL on all four shared molecular benchmarks with one fixed configuration, including the only multiparameter method to clear COX2's majority baseline by more than three points. Closed-form selection -- of the landmark radius, the kernel (certificate-preserving), and the bifiltration set -- buys further accuracy; gradient-shaped adaptation buys none.

cs.LG↗

Statistical Inference for Persistence Diagrams via Landmark Embeddings: Minimax Theory and Finite Approximation

Hilbert-space embeddings enable inference for populations of persistence diagrams, but separation between individual diagrams need not survive population averaging. We develop a framework for inference on population mean embeddings, with particular attention to the additive landmark representations PLACE and PALACE. Treating each diagram as one independent observation, we apply Hilbert-space limit theory to obtain covariance estimators, two-sample tests, and confidence balls under suitable moment conditions, without requiring a lower-distortion bound. For additive embeddings, we identify the population mean as an embedding of the mean counting measure and show that geometric separation of these measures alone cannot guarantee uniform testing power. We then introduce a model with latent template diagrams, missing features, and location perturbations. Under common or feature-specific prevalence conditions, a diagram-level lower-distortion certificate yields explicit lower bounds on population mean separation. These margins provide finite-sample uniform power guarantees, and an additional information-divergence comparison gives matching sample-complexity bounds over restricted scale ranges. Confidence sets yield lower bounds on transport separation of population mean measures and exclusion guarantees for specified structured alternatives. We also quantify how orthogonal truncation changes the certified signal and the approximation allowance needed for confidence sets targeting the full embedding, relating sample size, retained coordinates, and template separation. Simulations examine calibration, power, and coverage, and an analysis of resting-state connectivity from the Autism Brain Imaging Data Exchange illustrates the procedures.

math.ST↗

The Intersection Euler Characteristic Profile: Euler Calculus and Stability for Topological Interaction of Ball Unions

The Intersection Euler Characteristic Profile (Intersection ECP) of $k$ colored point clouds $X_1, \ldots, X_k \subset \mathbb{R}^d$ is the Euler characteristic $χ(\bigcap_{i=1}^k \mathcal{U}(X_i; t_i))$ of the overlap of their ball unions---an integer-valued, multiparameter invariant of their topological interaction across scales. Its organizing framework is the Euler calculus on constructible functions: the profile is equally the Euler integral $\int \prod_{i=1}^k \mathbf{1}_{\mathcal{U}(X_i; t_i)} \, dχ$ of the product of the $k$ data-dependent offsets, and this identity---our Intersection Theorem---is a commuting square interchanging geometric intersection and algebraic product. The invariant is rigid-motion invariant, scale-equivariant, and $L^1$-stable, and it is canonical: among pointwise-Euler interaction profiles it is the one forced by separation and normalization, the top floor of a spectrum of descriptors graded by how many clouds meet. For $n$ points a single sorted Alpha-complex sweep computes it in $O(n^{\lceil d/2 \rceil} \log n)$ time with no persistence reduction, worst-case optimal in even dimensions. Where the Euler characteristic cancels, a relative-homology refinement resolves the finer interaction and is stable in the two-parameter interleaving distance. Finally, for increasingly dense samples the profile and its refinement are consistent, recovering the (relative) homology and Euler characteristic of the underlying shapes---in the inverse limit for compact sets, and, under positive reach, persistently and with explicit sample complexity.

math.AT↗

Vietoris--Rips Shadow for Euclidean Graph Reconstruction

The shadow of an abstract simplicial complex $K$ with vertices in $\mathbb{R}^N$ is a subset of $\mathbb{R}^N$ defined as the union of the convex hulls of simplices of $K$. The Vietoris--Rips complex of a metric space $(S,d)$ at scale $β$ is an abstract simplicial complex whose each $k$-simplex corresponds to $(k+1)$ points of $S$ within diameter $β$. In case $S\subset\mathbb R^2$ and $d(a,b)=\|a-b\|$ the standard Euclidean metric, the natural shadow projection of the Vietoris--Rips complex is already proved by Chambers et al. to induce isomorphisms on $π_0$ and $π_1$. We extend the result beyond the standard Euclidean distance on $S\subset\mathbb R^N$ to a family of path-based metrics, $d^\varepsilon_{S}$. From the pairwise Euclidean distances of points in $S$, we introduce a family (parametrized by $\varepsilon$) of path-based Vietoris--Rips complexes $R^\varepsilon_β(S)$ for a scale $β>0$. If $S\subset\mathbb{R}^2$ is Hausdorff-close to a planar Euclidean graph $G$, we provide quantitative bounds on scales $β,\varepsilon$ for the shadow projection map of the Vietoris--Rips complex of $(S,d^\varepsilon_S)$ at scale $β$ to induce $π_1$-isomorphism. This paper first studies the homotopy-type recovery of $G\subset\mathbb R^N$ using the abstract Vietoris--Rips complex of a Hausdorff-close sample $S$ under the $d^\varepsilon_S$ metric. Then, our result on the $π_1$-isomorphism induced by the shadow projection lends itself to providing also a geometrically close embedding for the reconstruction. Based on the length of the shortest loop and large-scale distortion of the embedding of $G$, we quantify the choice of a suitable sample density $\varepsilon$ and a scale $β$ at which the shadow of $R^\varepsilon_β(S)$ is homotopy-equivalent and Hausdorff-close to $G$.

math.AT↗

A Closed-Form Persistence-Landmark Pipeline for Certified Point-Cloud and Graph Classification

We introduce PLACE (Persistence-Landmark Analytic Classification Engine), a closed-form pipeline for classifying point clouds and graphs through their persistent-homology signatures. Three quantitative guarantees -- a margin-based excess-risk rate, a closed-form descriptor-selection rule, and a per-prediction certificate -- are derived from training labels alone, with no learned weights or held-out calibration. The embedding sums Mitra-Virk single-point coordinate functions over a sparse landmark grid; the closed-form weight rule $w_k^2 \propto (d_{k+1}^2 - d_k^2)/R_k^2$ maximizes the distortion slope in Mitra-Virk's affine certificate under $ν$-coherence. (i) An $O(kR/(Δ\sqrt{m_{\min}}))$ margin bound, driven by class-mean separation $Δ$ and embedding radius $R$, matched in the sample-starved regime $m \lesssim R/Δ$ by a Le Cam minimax lower bound. (ii) The Mahalanobis margin under Ledoit-Wolf-shrunk covariance is the strongest closed-form ranker on a 64-descriptor chemical-graph pool (mean Spearman $ρ= +0.56$ across 11 benchmarks, positive on 10 of 11); the isotropic surrogate $Δ/\sqrt{\ell}$ admits a closed-form selection-consistency rate on the homogeneous protein/social pools. (iii) A training-time-decided certificate, with no per-prediction overhead, in three concrete radii (Pinelis, Gaussian plug-in, and variance-aware Pinelis-Bernstein). Empirically, PLACE is the strongest diagram-based method on Orbit5k and matches the strongest topology-based baseline within statistical noise on MUTAG and COX2; remaining gaps fall into two diagnosable regimes (descriptor blindness on NCI1/NCI109; pool-coverage limits elsewhere). The Pinelis-Bernstein radius fires on 8 of the 12 benchmarks; on MUTAG the empirical and population nearest-centroid rules agree on every one of 940 held-out test predictions, validating the certificate's mechanism.

cs.LG↗

A Closed-Form Adaptive-Landmark Kernel for Certified Point-Cloud and Graph Classification

We introduce PALACE (Persistence Adaptive-Landmark Analytic Classification Engine), the data-adaptive companion to PLACE, paying a small cross-validation tier on three knobs (budget, radii, bandwidth; $\leq 5$ choices each). A cover-theoretic core (Lebesgue-number criterion on the landmark cover) yields four closed-form guarantees. (i) A structural lower distortion bound $λ(τ;ν)$ on $\mathcal{D}_n$ under cross-diagram non-interference, with a $(D/L)^2$ budget reduction over the uniform grid when diagrams concentrate. (ii) Equal weights $w_k = K^{-1/2}$ maximizing $λ$, and farthest-point-sampling positions $2$-approximating the optimal $k$-center covering radius; both derived from training labels alone, no gradient training. (iii) A kernel-RKHS classification rate $O((k-1)\sqrt{K}/(γ\sqrt{m_{\min}}))$ with binary necessity threshold $m = Ω(\sqrt K/γ)$ from a matching Le Cam lower bound, and a closed-form filtration-selection rule. The kernel-Mahalanobis margin $\hatρ_{\mathrm{Mah}}$ is the strongest closed-form ranker across the chemical-graph pool (mean Spearman $ρ\approx +0.60$); the isotropic surrogate $\hatγ/\sqrt{K}$ admits a selection-consistency rate, and $\widehatλ$ from (i) provides an independent data-level signal (positive on COX2 and PTC). (iv) A per-prediction certificate, in non-asymptotic Pinelis and asymptotic Gaussian forms, with no calibration split. Empirically, PALACE is the strongest closed-form diagram-based method on Orbit5k ($91.3 \pm 1.0\%$, matching Persformer), leads every diagram-based competitor on COX2 and MUTAG, and is competitive on DHFR (within 1 pp of ECP). At $8\times$ domain inflation, adaptive placement maintains $94\%$ while the uniform grid collapses to chance ($25\%$ on 4-class data).

cs.LG↗

Detecting Regime Transitions in Dynamical Systems via the Mixup Euler Characteristic Profile

We develop a framework for detecting regime transitions in dynamical systems using the Mixup Euler Characteristic Profile (Mixup ECP) -- the Euler characteristic of the geometric intersection of ball unions around adjacent delay-embedded trajectory segments, viewed as a function of filtration scale. The Mixup ECP provides a detection statistic with a built-in null and guaranteed stability. We formalize regime detection as a low-side-permutation test, establish its validity and consistency, and introduce a multi-delay extension that automatically selects the most informative dynamical timescale. Complementing the topological signal with Complexity Variance, Higuchi fractal dimension, and a rolling mean baseline, the four-signal combined method achieves $9.50$ days MAE on Indian monsoon onset (Nepal target) -- a $32\%$ improvement over the rolling mean baseline and $9\%$ over CUSUM. Validated on the Lorenz system, logistic map, and three monsoon systems spanning both hemispheres (Indian/Nepal, Indian/Kerala, Western North Pacific), plus ENSO and a synthetic EEG dataset, the framework adds value precisely when the transition is gradual or obscured by noise.

math.DS↗

Interpretable Classification of Time Series Using Euler Characteristic Surfaces

Persistent homology (PH) -- the conventional method in topological data analysis -- is computationally expensive, requires further vectorization of its signatures before machine learning (ML) can be applied, and captures information along only the spatial axis. For time series data, we propose Euler Characteristic Surfaces (ECS) as an alternative topological signature based on the Euler characteristic ($χ$) -- a fundamental topological invariant. The ECS provides a computationally efficient, spatiotemporal, and inherently discretized feature representation that can serve as direct input to ML models. We prove a stability theorem guaranteeing that the ECS remains stable under small perturbations of the input time series. We first demonstrate that ECS effectively captures the nontrivial topological differences between the limit cycle and the strange attractor in the Rössler system. We then develop an ECS-based classification framework and apply it to five benchmark biomedical datasets (four ECG, one EEG) from the UCR/UEA archive. On $\textit{ECG5000}$, our single-feature ECS classifier achieves $98\%$ accuracy with $O(n+R\cdot T)$ complexity, compared to $62\%$ reported by a recent PH-based method. An AdaBoost extension raises accuracy to $98.6\%$, matching the best deep learning results while retaining full interpretability. Strong results are also obtained on $\textit{TwoLeadECG}$ ($94.1\%$) and $\textit{Epilepsy2}$ ($92.6\%$).

cs.LG↗

Topological Stability and Latschev-type Reconstruction Theorems for Spaces of Curvature Bounded Above

We consider the problem of homotopy-type reconstruction of compact subsets $X\subset\R^N$ that have the Alexandrov curvature bounded above ($\leq$ $κ$) in the intrinsic length metric. The reconstructed spaces are in the form of Vietoris--Rips complexes computed from a compact sample $S$, Hausdorff--close to the unknown shape $X$. Instead of the Euclidean metric on the sample, our reconstruction technique leverages a path-based metric to compute these complexes. As naturally emerging in the framework of reconstruction, we also study the Gromov--Hausdorff topological stability and finiteness problem for general compact for subspaces of curvature bounded above. Our techniques provide novel sampling conditions as an alternative to the existing and commonly used techniques using weak feature size and $μ$--reach. To the best of our knowledge, this is the first work that establishes homotopy-type reconstruction guarantees for spaces with vanishing reach and $μ$--reach, a regime not covered by existing sampling conditions.

math.AT↗

The Shadow of Vietoris--Rips Complexes in Limits

The Vietoris-Rips complex, denoted $R_β(X)$, of a metric space $(X,d)$ at scale $β$ is an abstract simplicial complex where each $k$-simplex corresponds to $(k+1)$ points of $X$ within diameter $β$. For any abstract simplicial complex $K$ with the vertex set $K^{(0)}$ a Euclidean subset, its shadow, denoted $S(K)$, is the union of the convex hulls of simplices of $K$. This article centers on the homotopy properties of the shadow of Vietoris-Rips complexes $K=R_β(X)$ with vertices from $\mathbb{R}^N$, along with the canonical projection map $ p\colon R_β(X) \to S(R_β(X))$. The study of the geometric/topological behavior of $p$ is a natural yet non-trivial problem. The map $p$ may have many ``singularities'', which have been partially resolved only in low dimensions $N\leq 3$. The obstacle naturally leads us to study systems of these complexes $\{S(R_β(S)) \mid β> 0, S\subset X\}$. We address the challenge posed by singularities in the shadow projection map by studying systems of the shadow complex using inverse system techniques from shape theory, showing that the limit map exhibits favorable homotopy-theoretic properties. More specifically, leveraging ideas and frameworks from Shape Theory, we show that in the limit ``$β\to 0$ and $S \to X$'', the limit map ``$\lim p$'' behaves well with respect to homotopy/homology groups when $X$ is an ANR (Absolute Neighborhood Retract) and admits a metric that satisfies some regularity conditions. This results in limit theorems concerning the homotopy properties of systems of these complexes as the proximity scale parameter approaches zero and the sample set approaches the underlying space (e.g., a submanifold or Euclidean graph). The paper concludes by discussing the potential of these results for finite reconstruction problems in one-dimensional submanifolds.

math.AT↗