相关论文: Jacobi Set Simplification for Tracking Topological…

The labeling of point features on a map is a well-studied topic. In a static setting, the goal is to find a non-overlapping label placement for (a subset of) point features. In a dynamic setting, the set of point features and their…

In the paper, we study variation formulas for transversally harmonic maps and bi-harmonic maps, respectively. We also study the transversal Jacobi field along a map and give several relations with infinitesimal automorphisms.

The goal of this work is to introduce a local and a global interpolator in Jacobi-weighted spaces, with optimal order of approximation in the context of the $p$-version of finite element methods. Then, an a posteriori error indicator of the…

Twistor methods provide a powerful tool in the study of harmonic maps and harmonic morphisms. Indeed, their use has enabled us to produce a variety of examples of harmonic morphisms defined on 4-dimensional manifolds, and a complete…

We propose a graphical notation by which certain spectral properties of complex systems can be rewritten concisely and interpreted topologically. Applying this notation to analyze the stability of a class of networks of coupled dynamical…

We propose a node clustering method for time-varying graphs based on the assumption that the cluster labels are changed smoothly over time. Clustering is one of the fundamental tasks in many science and engineering fields including signal…

Recurrence plots exhibit line structures which represent typical behaviour of the investigated system. The local slope of these line structures is connected with a specific transformation of the time scales of different segments of the…

Multi-Camera Multi-Object Tracking (MC-MOT) utilizes information from multiple views to better handle problems with occlusion and crowded scenes. Recently, the use of graph-based approaches to solve tracking problems has become very…

Real complex systems are inherently time-varying. Thanks to new communication systems and novel technologies, it is today possible to produce and analyze social and biological networks with detailed information on the time of occurrence and…

Temporal consistency is critical in video prediction to ensure that outputs are coherent and free of artifacts. Traditional methods, such as temporal attention and 3D convolution, may struggle with significant object motion and may not…

Dynamical systems across the sciences, from electrical circuits to ecological networks, undergo qualitative and often catastrophic changes in behavior, called bifurcations, when their underlying parameters cross a threshold. Existing…

Let $\mathbf{K}$ be a field and $\phi$, $\mathbf{f} = (f_1, \ldots, f_s)$ in $\mathbf{K}[x_1, \dots, x_n]$ be multivariate polynomials (with $s < n$) invariant under the action of $\mathcal{S}_n$, the group of permutations of $\{1, \dots,…

Two-point correlation functions (2PCF) are widely used to characterize how points cluster in space. In this work, we study the problem of measuring the 2PCF over a large set of points, restricted to a subset satisfying a property of…

We develop a hybrid formalism suitable for modeling scalar field dark matter, in which the phase-space distribution associated to the real scalar field is modeled by statistical equal-time two-point functions and gravity is treated by two…

We consider the problem of analyzing multivariate time series collected on multiple subjects, with the goal of identifying groups of subjects exhibiting similar trends in their recorded measurements over time as well as time-varying groups…

The assumption of using a static graph to represent multivariate time-varying signals oversimplifies the complexity of modeling their interactions over time. We propose a Dynamic Multi-hop model that captures dynamic interactions among…

Jacobi's method is a well-known algorithm in linear algebra to diagonalize symmetric matrices by successive elementary rotations. We report about the generalization of these elementary rotations towards canonical transformations acting in…

The Jacobi-Davidson method is one of the most popular approaches for iteratively computing a few eigenvalues and their associated eigenvectors of a large matrix. The key of this method is to expand the search subspace via solving the…

We consider the algorithmic complexity of recognizing bipartite temporal graphs. Rather than defining these graphs solely by their underlying graph or individual layers, we define a bipartite temporal graph as one in which every layer can…

Change point detection (CPD) aims to locate abrupt property changes in time series data. Recent CPD methods demonstrated the potential of using deep learning techniques, but often lack the ability to identify more subtle changes in the…