Related papers: The Use of Minimal Spanning Trees in Particle Phys…
Due to its broad applications in practice, the minimum spanning tree problem and its all kinds of variations have been studied extensively during the last decades, for which a host of efficient exact and heuristic algorithms have been…
In this paper we present and evaluate a parallel algorithm for solving a minimum spanning tree (MST) problem for supercomputers with distributed memory. The algorithm relies on the relaxation of the message processing order requirement for…
The comparison of the Standard Cosmological Model (SCM) with astronomical observations, i.e. theory versus experiment, and with the Minimal Standard Model (MSM) in particle physics, i.e. theory versus theory, is discussed. The main issue of…
We provide the first asynchronous distributed algorithms to compute broadcast and minimum spanning tree with $o(m)$ bits of communication, in a graph with $n$ nodes and $m$ edges. For decades, it was believed that $\Omega(m)$ bits of…
A novel approach for non-intrusive uncertainty propagation is proposed. Our approach overcomes the limitation of many traditional methods, such as generalised polynomial chaos methods, which may lack sufficient accuracy when the quantity of…
Criteria for defining errors of a physical theory are formulated. It is shown that the Special Theory of Relativity (STR) has a solid mathematical basis. An enormous amount of experiments carried out in particle physics use beams of…
Processing graphs with temporal information (the temporal graphs) has become increasingly important in the real world. In this paper, we study efficient solutions to temporal graph applications using new algorithms for Incremental Minimum…
The minimum spanning tree (MST) construction is a classical problem in Distributed Computing for creating a globally minimized structure distributedly. Self-stabilization is versatile technique for forward recovery that permits to handle…
In the context of algorithm theory, various studies have been conducted on spanning trees with desirable properties. In this paper, we consider the \textsc{Minimum Cover Spanning Tree} problem (MCST for short). Given a graph $G$ and a…
Single-particle tracking (SPT) has become a popular tool to study the intracellular transport of molecules in living cells. Inferring the character of their dynamics is important, because it determines the organization and functions of the…
Density Estimation Trees can play an important role in exploratory data analysis for multidimensional, multi-modal data models of large samples. I briefly discuss the algorithm, a self-optimization technique based on kernel density…
We prove that the Minimal Spanning Tree and the Invasion Percolation Tree on a version of the triangular lattice in the complex plane have unique scaling limits, which are invariant under rotations, scalings, and, in the case of the MST,…
The Stochastic Context Tree (SCOT) is a useful tool for studying infinite random sequences generated by an m-Markov Chain (m-MC). It captures the phenomenon that the probability distribution of the next state sometimes depends on less than…
The multiple scattering theory (MST) is one of the most widely used methods in electronic structure calculations. It features a perfect separation between the atomic configurations and site potentials, and hence provides an efficient way to…
This review aims to provide a very short and pedestrian introduction to some of the basics of extra-dimensional physics. The hope is to facilitate access and to be, in some respects, complementary to the many already existing reviews on…
Algorithms for dynamically maintaining minimum spanning trees (MSTs) have received much attention in both the parallel and sequential settings. While previous work has given optimal algorithms for dense graphs, all existing parallel…
Consider~\(n\) nodes~\(\{X_i\}_{1 \leq i \leq n}\) independently distributed in the unit square~\(S,\) each according to a distribution~\(f\) and let~\(K_n\) be the complete graph formed by joining each pair of nodes by a straight line…
Often machine learning methods are applied and results reported in cases where there is little to no information concerning accuracy of the output. Simply because a computer program returns a result does not insure its validity. If…
I discuss some central issues in particle physics which are potentially relevant to cosmology. I first briefly review the present (glorious) experimental status of the Standard Model, emphasizing that it provides a firm foundation both for…
We present improved learning-augmented algorithms for finding an approximate minimum spanning tree (MST) for points in an arbitrary metric space. Our work follows a recent framework called metric forest completion (MFC), where the learned…