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

Trend · papers per month

336699132 · Jun 202019922001200920172026
48 results for topology identification

Paper tackles dynamic graph topology identification in time-varying graphs.

problem Dynamic graph topology identification in time-varying graphs.
method Proposes an online algorithm for time-varying optimization, with intrinsic temporal regularization.
result Demonstrates performance on Gaussian graphical model problem.

New method identifies network dynamics and noise structure.

problem Estimating network and disturbance topologies in dynamic systems.
method Extended multi-step Sequential Linear Regression and Weighted Null Space Fitting methods.
result Consistent estimation of dynamic networks with reduced computational burden.

This chapter covers methods for identifying and inferring graph topologies.

problem Identifying and inferring graph topologies from multidimensional relational data.
method Overview of methods including correlation metrics, covariance selection, kernels, structural equations, and vector autoregressions.
result Supports both batch and online learning with convergence guarantees and leverages high-order statistical information.

The paper deals with the problem of reconstructing the topological structure of a network of dynamical systems. A distance function is defined in order to evaluate the "closeness" of two processes and a few useful mathematical properties are derived. Theoretical results to guarantee the correctness of the identificatio…

2008-04-15abs ↗pdf ↗

New framework for 3D spatial topology enumeration and identification.

problem Efficient navigation through complex engineering system topologies.
method Mathematical spatial graph theory to represent, enumerate, and identify unique topological classes.
result Identification of distinctive 3D topological classes for engineering systems.

Paper introduces a conformer-based system for streaming language identification in long-form speech.

problem Language identification in long-form audio.
method Conformer layers with attentive temporal pooling and domain adaptation.
result Conformer-based models significantly outperform LSTM and transformer models.

Let M be an orientable topological manifold of dimension m, m greater or equal to 5, with fundamental group ΓΓ. Let S(M) be the topological structure set, endowed with the group structure induced by its identification with Ranicki's algebraic structure set. We prove that the (rationalized) rho map $ρ_Γ: S(M)\rightarro…

2016-07-24abs ↗pdf ↗

New method identifies diffusion sources on networks with statistical confidence.

problem Identifying sources of diffusion on networks without restrictive assumptions.
method Statistical framework and confidence set inference approach based on hypothesis testing.
result Efficiently produces a small subset of nodes covering the source node with any confidence level.

We prove that the open topological string partition function on a D-brane configuration in a Calabi-Yau manifold X takes the form of a closed topological string partition function on a different Calabi-Yau manifold X_b. This identification shows that the physics of D-branes in an arbitrary background X of topological s…

2007-04-24abs ↗pdf ↗

Two single parameter families of polyhedra P(ψ)P(ψ) are constructed in three dimensional spaces of constant curvature C(ψ)C(ψ). Identification of the faces of the polyhedra via isometries results in cone manifolds M(ψ)M(ψ) which are topologically $S^1\timesS^2$, S3S^3 or singular S2S^2. The singular set of M(ψ)M(ψ) can have se…

2005-08-30abs ↗pdf ↗

The paper derives Cramer-Rao bounds for Laplacian matrix estimation under various constraints.

problem Estimating Laplacian matrices with structural constraints and sparsity.
method Linear reparametrization and closed-form expressions for Cramer-Rao bounds tailored to Laplacian matrix estimation.
result The derived CRBs provide performance limits for Laplacian matrix estimation and are validated in various applications.

The potential of recovering the topology of a grid using solely publicly available market data is explored here. In contemporary whole-sale electricity markets, real-time prices are typically determined by solving the network-constrained economic dispatch problem. Under a linear DC model, locational marginal prices (LM…

2013-12-02abs ↗pdf ↗

A new method for state estimation on complex networks.

problem Reconstructing latent dynamics from multivariate time-series on topological cell complexes.
method Topology-aware state space framework derived from stochastic partial differential equations, with state evolution following heat-like topological diffusion.
result The proposed method successfully recovers latent states and topological structures in real-world networks.

The topology of a power grid affects its dynamic operation and settlement in the electricity market. Real-time topology identification can enable faster control action following an emergency scenario like failure of a line. This article discusses a graphical model framework for topology estimation in bulk power grids (…

2017-07-05abs ↗pdf ↗

We present the Infinite Latent Events Model, a nonparametric hierarchical Bayesian distribution over infinite dimensional Dynamic Bayesian Networks with binary state representations and noisy-OR-like transitions. The distribution can be used to learn structure in discrete timeseries data by simultaneously inferring a s…

2012-05-09abs ↗pdf ↗

The paper tackles noisy combinations of continuous and step functions, providing conditions for their identification.

problem Recovering noisy observations as a combination of continuous and step functions.
method Topological and local properties of the functions are used to determine conditions for identification. A practical estimation algorithm is provided.
result Conditions for the identification of continuous and step functions based on their global and local properties.

AdaCGP learns dynamic graph topology from time series data, improving over existing methods.

problem Learning dynamic graph topology from time-varying signals, especially in real-time applications.
method AdaCGP is a sparsity-aware adaptive algorithm that recursively estimates the Graph Shift Operator (GSO) through variable splitting.
result AdaCGP outperforms state-of-the-art methods in GSO estimation, achieving improvements exceeding 83%.

We provide a systematic approach to twisting differential KO-theory leading to a construction of the corresponding twisted differential Atiyah-Hirzebruch spectral sequence (AHSS). We relate and contrast the degree two and the degree one twists, whose description involves appropriate local systems. Along the way, we pro…

2019-05-22abs ↗pdf ↗

Large-scale recurrent networks have drawn increasing attention recently because of their capabilities in modeling a large variety of real-world phenomena and physical mechanisms. This paper studies how to identify all authentic connections and estimate system parameters of a recurrent network, given a sequence of node …

2014-10-05abs ↗pdf ↗

The paper studies transformations of Frobenius manifolds and their properties.

problem Analyzing transformations of Frobenius manifolds and their properties.
method Analytic theory of Legendre-type transformations for Frobenius manifolds.
result Monodromy data, Stokes matrix, and central connection matrix are shared among Legendre-type transformations.

Network science provides valuable insights across numerous disciplines including sociology, biology, neuroscience and engineering. A task of major practical importance in these application domains is inferring the network structure from noisy observations at a subset of nodes. Available methods for topology inference t…

2018-05-16abs ↗pdf ↗

Bounded-type 3-manifolds arise as combinatorially bounded gluings of irreducible 3-manifolds chosen from a finite list. We prove effective hyperbolization and effective rigidity for a broad class of 3-manifolds of bounded type and large gluing heights. Specifically, we show the existence and uniqueness of hyperbolic me…

2013-12-09abs ↗pdf ↗

This paper clusters networks with annotated time-series data using kernel-ARMA and Grassmannian geometry.

problem Clustering networks with annotated time-series data, including state, node, and subnetwork clustering.
method Extract features from time-series data using kernel-ARMA, map onto Grassmannian, and cluster using Riemannian geometry.
result The proposed framework outperforms state-of-the-art clustering schemes on brain-network data.

Paper explores using EEG for better speaker identification, even in noisy environments.

problem Speaker identification performance degrades in background noise.
method Uses EEG signals to enhance speaker identification systems, comparing with acoustic features.
result Speaker identification system using only EEG features outperforms one using only acoustic features in high background noise.

PHLP uses persistent homology to interpret graph link prediction.

problem Interpreting why graph neural network models perform well in link prediction.
method Employing persistent homology to analyze graph topology and extract features.
result PHLP outperforms state-of-the-art models on most benchmark datasets.

Symplectic homology matches dual capacities for convex domains.

problem Understanding symplectic capacities and Reeb flows on convex domains.
method Isomorphic filtered symplectic homology to dual singular homology.
result Gutt-Hutchings capacities match spectral invariants for convex domains.

In the present paper we study interval identification systems of order three. We prove that the Rauzy induction preserves symmetry: for any symmetric interval identification system of order three after finitely many iterations of the Rauzy induction we always obtain a symmetric system. We also provide an example of sym…

2010-10-09abs ↗pdf ↗

Although the threshold network is one of the most used tools to characterize the underlying structure of a stock market, the identification of the optimal threshold to construct a reliable stock network remains challenging. In this paper, the concept of dynamic consistence between the threshold network and the stock ma…

2018-03-06abs ↗pdf ↗

Simplified identification methods for causal inference with arbitrary interventional distributions.

problem Estimating cause-effect relationships from data with experimental interventions.
method Using Single World Intervention Graphs and nested model factorization, we provide algorithms for identifying causal parameters from mixed observational and interventional distributions.
result Our algorithms are complete for certain types of interventional marginal distributions.