Related papers: Computing the bridge length: the key ingredient in…
The discovery of new materials using crystal structure prediction (CSP) based on generative machine learning models has become a significant research topic in recent years. In this paper, we study invariance and continuity in the generative…
A wide variety of methods have been used to compute percolation thresholds. In lattice percolation, the most powerful of these methods consists of microcanonical simulations using the union-find algorithm to efficiently determine the…
With the rapid advancement of computer technologies enabling fast calculations of complex structures, numerical methods have become a central tool in engineering sciences, while physical models have increasingly receded into the background.…
The identification of nodes occupying important positions in a network structure is crucial for the understanding of the associated real-world system. Usually, betweenness centrality is used to evaluate a node capacity to connect different…
The most fundamental model of a molecule is a cloud of unordered atoms, even without chemical bonds that can depend on thresholds for distances and angles. The strongest equivalence between clouds of atoms is rigid motion, which is a…
We refine the bit complexity analysis of an algorithm for the computation of at least one point per connected component of a smooth real algebraic set, yielding exponential speedup (with respect to the number of variables) compared to prior…
The first step in investigating fractional difference maps, which do not have periodic points except fixed points, is to find asymptotically periodic points and bifurcation points and draw asymptotic bifurcation diagrams. Recently derived…
An algorithm for determining crystal structures from diffraction data is described which does not rely on the usual Fourier-space formulations of atomicity. The new algorithm implements atomicity constraints in real-space, as well as…
Consider the {$\ell_{\alpha}$} regularized linear regression, also termed Bridge regression. For $\alpha\in (0,1)$, Bridge regression enjoys several statistical properties of interest such as sparsity and near-unbiasedness of the estimates…
The interleaving distance is arguably the most prominent distance measure in topological data analysis. In this paper, we provide bounds on the computational complexity of determining the interleaving distance in several settings. We show…
The evolution of the liquid bridge formed between two coalescing sessile yield-stress drops is studied experimentally. We find that the height of the bridge evolves similar to a viscous Newtonian fluid, $h_0\sim t$, before arresting at long…
Stratified digraphs are popular models for feedforward neural networks. However, computation of their path homologies has been limited to low dimensions due to high computational complexity. A recursive algorithm is proposed to compute…
We investigate the longevity of broad bridge features in position-velocity diagrams that appear as a result of cloud-cloud collisions. Broad bridges will have a finite lifetime due to the action of feedback, conversion of gas into stars and…
We compare the various chirality measures most widely used in the literature to quantify chiral symmetry in extended solids, i.e., the continuous chirality measure, the Hausdorff distance, and the angular momentum. By studying these…
In turbulent flows, energy production is associated with highly organized structures, known as coherent structures. Since these structures are three-dimensional, their detection remains challenging in the most common situation, when…
As an example for the fast calculation of distributional parameters of Gaussian processes, we propose a new Monte Carlo algorithm for the computation of quantiles of the supremum norm of weighted Brownian bridges. As it is known, the…
We propose an iterative proposal to estimate critical points for statistical models based on configurations by combing machine-learning tools. Firstly, phase scenarios and preliminary boundaries of phases are obtained by…
Age estimation is an important yet very challenging problem in computer vision. Existing methods for age estimation usually apply a divide-and-conquer strategy to deal with heterogeneous data caused by the non-stationary aging process.…
Many complex systems occurring in the natural or social sciences or economics are frequently described on a microscopic level, e.g., by lattice- or agent-based models. To analyze the states of such systems and their bifurcation structure on…
The stable torsion length in a group is the stable word length with respect to the set of all torsion elements. We show that the stable torsion length vanishes in crystallographic groups. We then give a linear programming algorithm to…