We introduce community trees to summarize network structures.
problem Stability of community structures in networks.
method Clique percolation method (CPM) and persistent diagrams.
result Total star number (TSN) provides an upper bound on community tree changes.
New models for graph sequences capture link and community persistence.
problem Difficulties in extending block model results to graph sequences.
method Two models for graph sequences capturing link and community persistence, with efficient inference algorithms.
result Validated suitability of proposed models and methods on synthetic and real instances.
We study the inference of a model of dynamic networks in which both communities and links keep memory of previous network states. By considering maximum likelihood inference from single snapshot observations of the network, we show that link persistence makes the inference of communities harder, decreasing the detectab…
This work introduces novel methods to identify and compare cycles across topological objects.
problem Identifying and comparing topological features, particularly cycles, across different topological objects.
method Two complementary approaches: dendrogram-based merge-tree algorithms and Stratified Gradient Sampling.
result Transformed cycle matching into hierarchical clustering and topological optimization framework.
New topological methods for hypergraph data improve community detection and pattern recognition.
problem Community detection and pattern recognition in hypergraph data.
method Introducing a new topological space structure of hypergraph data, proposing modified nearest neighbors methods.
result Improved methods for community detection and pattern recognition in hypergraph data.
The study confirms conditions for Q-learning with persistent exploration.
problem Formulating conditions for Q-learning with persistent exploration. method Formulated assumptions for Q-learning with local and global clocks, ensuring persistent exploration. result The Robbins-Monro conditions are confirmed for Q-learning with persistent exploration. Neural persistence measures network complexity using topology.
problem Lack of measures for characterizing and monitoring structural properties of neural networks.
method Topological data analysis on weighted stratified graphs.
result Neural persistence reflects best practices and can shorten training time.
Networks are a convenient way to represent complex systems of interacting entities. Many networks contain "communities" of nodes that are more densely connected to each other than to nodes in the rest of the network. In this paper, we investigate the detection of communities in temporal networks represented as multilay…
Survey on optimizing topological descriptors for machine learning.
problem Optimizing topological priors in machine learning models.
method Minimizing topologically-informed losses using gradient descent.
result Various techniques enable optimization of persistence-based loss functions.
We study the cluster dynamics of multichannel (multivariate) time series by representing their correlations as time-dependent networks and investigating the evolution of network communities. We employ a node-centric approach that allows us to track the effects of the community evolution on the functional roles of indiv…
FLIX simplifies federated learning with efficient communication.
problem Handling constraints specific to federated learning.
method Introduces FLIX, a new framework for federated learning that addresses communication and personalization challenges.
result FLIX achieves dissimilarity regularization similar to local methods without requiring local steps.
Under what conditions is an edge present in a social network at time t likely to decay or persist by some future time t + Delta(t)? Previous research addressing this issue suggests that the network range of the people involved in the edge, the extent to which the edge is embedded in a surrounding structure, and the age…
FedRD improves risk difference estimation in federated learning for clinical outcomes.
problem Privacy-preserving model co-training in medical research is hindered by server-dependent architectures and focus on relative effect measures.
method FedRD is a server-independent, communication-efficient framework for federated risk difference estimation in distributed survival data.
result FedRD provides valid confidence intervals and hypothesis testing, and is asymptotically equivalent to pooled individual-level analysis.
PEAR dynamically reconfigures agent roles to prevent persistent biases in multi-agent debates.
problem Persistent positional biases and sensitivity to role assignments in fixed topologies.
method Dynamic reconfiguration of agent roles and sparse topologies based on evolving agent states.
result Significantly improves average accuracy over debate baselines across multiple reasoning benchmarks.
New method recovers graph latent positions under edge differential privacy.
problem Recovering latent graph information from privatized graphs.
method Applying geometric insights to adjust statistical inference for privatized graphs.
result Achieves consistent recovery of latent positions under local edge differential privacy constraints.
Bayesian topological learning improves EEG signal analysis for brain state classification.
problem Challenges in classifying and analyzing noisy, nonlinear, nonstationary EEG signals.
method Persistent homology with Bayesian framework to track topological features and incorporate prior knowledge.
result Bayesian topological learning outperforms existing methods for noisy EEG classification.
Study examines how institutional differences and crises affect volatility in ASEAN stock markets.
problem Understanding how institutional differences and crises impact volatility in emerging Asian stock markets.
method By-window EGARCH/TGARCH analysis of daily stock index returns for Indonesia, Malaysia, and the Philippines from 2010 to 2024.
result All three markets show strong volatility persistence and fat-tailed returns; crises increase persistence and asymmetry, while tail thickness rises.
PTOPOFL uses topological descriptors to protect privacy in federated learning.
problem Privacy and data reconstruction attacks in federated learning.
method PTOPOFL replaces gradient communication with persistent homology feature vectors for privacy and topology-guided aggregation.
result PTOPOFL achieves higher AUC and reduces reconstruction risk compared to gradient sharing.
This paper introduces TDA and TSI for better business analytics.
problem Nonlinear, multi-scale business datasets under-represented by traditional tools.
method Topological Data Analysis (TDA) and Topological Stability Index (TSI).
result TSI reveals structural variability in business data.
Persistence landscapes map diagrams into function spaces for statistical and machine learning applications.
problem Mapping persistence diagrams into function spaces for statistical and machine learning.
method Introducing persistence landscapes, weighted persistence landscapes, and Poisson-weighted persistence landscape kernels.
result Persistence landscapes allow for the application of statistical and machine learning tools, and are stable and invertible.
We present an analysis of the credit market of Japan. The analysis is performed by investigating the bipartite network of banks and firms which is obtained by setting a link between a bank and a firm when a credit relationship is present in a given time window. In our investigation we focus on a community detection alg…
Approaches for approximating persistent homology for large datasets.
problem Inability to compute persistent homology for large datasets.
method Multiple subsampling framework for statistical approximation of persistent homology.
result Derivation of finite sample convergence rates for empirical means of persistent homology.
Proposes deep graph persistence to address neural persistence issues in deep learning.
problem Variance of weights and lack of spatial structure in deep neural networks impact neural persistence.
method Extends neural persistence to the whole network, considering interactions between layers.
result Deep graph persistence alleviates variance-related issues and captures persistent paths through the network.
Paper proves k-means clustering works on persistence diagrams.
problem Complex geometry of persistence diagram space.
method Proves convergence of k-means on persistence diagram space. result Performance of k-means on persistence diagrams and measures is superior. Formula for interleaving distance of rectangle persistence modules.
problem Calculating distances between rectangle persistence modules.
method Formulas based on rectangle geometry, extended to decomposable modules.
result Closed formulas for interleaving and bottleneck distances.
This paper demonstrates the flaws of co-persistence theory proposed by Bollerslev and Engle (1993) which cause the theory can hardly be applied. With the introduction of the half-life of decay coefficient as the measure of the persistence, and both the weak definition of persistence and co-persistence in variance, this…
Optimizes wavelets for graph classification using spectral wavelet signatures and persistence diagrams.
problem Graph classification with geometric properties encoded in persistence diagrams.
method Optimizes spectral wavelets for graph datasets to capture best-suited features for classification.
result Competitive performance in graph classification problems compared to other persistence-based architectures.
New methods found persistent tangles in knots.
problem Persistent tangles in knot diagrams.
method Non-trivial colorings for tangles.
result Any knot with non-trivial coloring has persistent tangles.
Paper speeds up DGD by allowing multiple transmissions from non-straggling servers.
problem Limited parallel execution due to straggling servers in DGD.
method Allowing multiple transmissions from each CS at each iteration.
result Significant reduction in average completion time per iteration.
New method for analyzing multiparameter persistence modules from smooth functions.
problem Analyzing multiparameter persistence modules from smooth functions.
method Generalized Morse theory applied to cobordism and Cerf theory.
result Complete description of persistence modules as direct sums of indecomposables.
Develops robust persistence diagrams using kernel methods.
problem Persistence diagrams are sensitive to data perturbations.
method Constructs robust persistence diagrams from superlevel filtrations of robust density estimators using reproducing kernels.
result Robust persistence diagrams are consistent estimators in bottleneck distance.
This paper interprets critical scales in persistent homology for compact metric spaces.
problem Understanding critical scales in persistent homology for general compact metric spaces.
method Analyzing local minima of the distance function and their impact on persistence.
result Each decrease in zero-dimensional persistence and increase in one-dimensional persistence is induced by local minima of the distance function.
Introduces a new space of Radon measures for better understanding persistence diagrams.
problem Lack of optimal transport-based formalism for persistence diagrams.
method Formalizes persistence diagrams as Radon measures on the upper half plane via optimal partial transport.
result Characterizes convergence and barycenters of persistence diagrams.
MuRiT efficiently computes multi-parameter persistence barcodes.
problem Efficient computation of multi-parameter persistent homology.
method Vietoris-Rips transformation to reduce multi-parameter to single-parameter computation.
result MuRiT computes pathwise persistence barcodes for multi-filtered flag complexes.
Study on embedding persistence diagrams into Hilbert spaces, focusing on metric distortion.
problem Understanding metric properties of persistence diagrams in Hilbert spaces.
method Investigate embedding persistence diagrams into separable Hilbert spaces using bi-Lipschitz maps.
result Impossible to find a bi-Lipschitz embedding into finite-dimensional Hilbert spaces.
Kernel for multi-parameter persistent homology connects TDA with ML.
problem Connecting persistent homology with machine learning for multivariate data.
method Integrating a one-parameter kernel weighted along straight lines.
result Stable and efficiently computable kernel for multi-parameter persistence.
Persistent homology can recognize knotting in curves.
problem Recognizing knotting in curves
method Compute one-dimensional persistent homology, extract cycle representatives, and assign a hypergraph curvature-based score.
result Systematic differences between knotted and unknotted structures are revealed.
This article analyzes the relationship between co-persistence and hedging which indicates co-persistence ratio is just the long-term hedging ratio. The new method of exhaustive search algorithm for deriving co-persistence ratio is derived in the article. And we also develop a new hedging strategy of combining co-persis…
Persistent homology detects curvature from sampled points.
problem Understanding the geometric information encoded in short intervals of persistent homology.
method Persistent homology computations and average persistence landscapes.
result Persistent homology detects curvature of disks from sampled points.
The paper studies geometric properties of geodesic spaces using Rips and Čech filtrations.
problem Understanding geometric properties of geodesic spaces.
method Applying fundamental group and homology groups to Rips or Čech filtrations.
result Rips critical points correspond to circles of specific lengths and persistence encodes space properties.
Computational topology has recently known an important development toward data analysis, giving birth to the field of topological data analysis. Topological persistence, or persistent homology, appears as a fundamental tool in this field. In this paper, we study topological persistence in general metric spaces, with a …
A new approach to reinforcement learning improves policy performance by adjusting control frequency.
problem Improving reinforcement learning performance by optimizing control frequency.
method Introducing action persistence and a novel algorithm, PFQI, to learn optimal value function at a given persistence.
result PFQI effectively learns optimal value function with action persistence, improving reinforcement learning performance.
A new method compares persistent cycles in topological data.
problem Comparing persistent homology representations of two spaces.
method Direct comparison of individual persistent cycles based on persistence intervals and spatial placement.
result Demonstrated the effectiveness of the method in topological inference.
Improved persistence spheres map measures to functions, stable under partial transport.
problem Representing and comparing measures in topological machine learning.
method Persistence spheres map measures to continuous functions on the sphere, stable under 1-Wasserstein partial transport.
result Persistence spheres provide a stable, parameter-free representation of measures, improving upon existing methods.
New model predicts persistent weather patterns better than persistence model.
problem Improving weather forecasting accuracy for persistent patterns.
method Mixture of experts model using ordinal neural network.
result The model outperforms persistence and other models for longer time horizon predictions.
Embeds persistence diagrams into Hilbert spaces to use kernel methods.
problem No inner product structure on persistence diagrams.
method Shows non-embeddability of persistence diagrams into Hilbert spaces.
result Persistence diagrams with bottleneck distance do not coarse embed into Hilbert spaces.
Directional and pairwise measurements are often used to model inter-relationships in a social network setting. The Mixed-Membership Stochastic Blockmodel (MMSB) was a seminal work in this area, and many of its capabilities were extended since then. In this paper, we propose the \emph{Dynamic Infinite Mixed-Membership s…
We introduce several geometric notions, including the width of a homology class, to the theory of persistent homology. These ideas provide geometric interpretations of persistence diagrams. Indeed, we give quantitative and geometric descriptions of the "life span" or "persistence" of a homology class. As a case study, …