Optimal Bounds for the k -cut Problem

In the k -cut problem, we want to find the lowest-weight set of edges whose deletion breaks a given (multi)graph into k connected components. Algorithms of Karger and Stein can solve this in roughly O ( n 2k ) time. However, lower bounds from conjectures about the k -clique problem imply that Ω ( n (1- o (1)) k ) time is likely needed. Recent results of Gupta, Lee, and Li have given new algorithms for general k -cut in n 1.98k + O(1) time, as well as specialized algorithms with better performance for certain classes of graphs (e.g., for small integer edge weights). In this work, we resolve the problem for general graphs. We show that the Contraction Algorithm of Karger outputs any fixed k -cut of weight α λ k with probability Ω k ( n - α k ), where λ k denotes the minimum k -cut weight. This also gives an extremal bound of O k ( n k ) on the number of minimum k -cuts and an algorithm to compute λ k with roughly n k polylog( n ) runtime. Both are tight up to lower-order factors, with the algorithmic lower bound assuming hardness of max-weight k -clique. The first main ingredient in our result is an extremal bound on the number of cuts of weight less than 2 λ k / k , using the Sunflower lemma. The second ingredient is a fine-grained analysis of how the graph shrinks—and how the average degree evolves—in the Karger process.

Parallel analysis of Ethereum blockchain transaction data using cluster computing

Ability to perform fast analysis on massive public blockchain transaction data is needed in various applications such as tracing fraudulent financial transactions. The blockchain data is continuously growing and is organized as a sequence of blocks containing transactions. This organization, however, cannot be used for parallel graph algorithms which need efficient distributed graph data structures. Using message passing libraries (MPI), we develop a scalable cluster-based system that constructs a distributed transaction graph in parallel and implement various transaction analysis algorithms. We report performance results from our system operating on roughly 5 years of 10.2 million block Ethereum Mainnet blockchain data. We report timings obtained from tests involving distributed transaction graph construction, partitioning, page ranking of addresses, degree distribution, token transaction counting, connected components finding and our new parallel blacklisted address trace forest computation algorithm on a 16 node economical cluster set up on the Amazon cloud. Our system is able to construct a distributed graph of 766 million transactions in 218 s and compute the forest of blacklisted address traces in 32 s.

Critical Nodes Detection in IoT-Based Cyber-Physical Systems

The new generation of fast, small, and energy-efficient devices that can connect to the internet are already used for different purposes in healthcare, smart homes, smart cities, industrial automation, and entertainment. One of the main requirements in all kinds of cyber-physical systems is a reliable communication platform. In a wired or wireless network, losing some special nodes may disconnect the communication paths between other nodes. Generally, these nodes, which are called critical nodes, have many undesired effects on the network. The authors focus on three different problems. The first problem is finding the nodes whose removal minimizes the pairwise connectivity in the residual network. The second problem is finding the nodes whose removal maximizes the number of connected components. Finally, the third problem is finding the nodes whose removal minimizes the size of the largest connected component. All three problems are NP-Complete, and the authors provide a brief survey about the existing approximated algorithms for these problems.

Fixed-time sliding mode attitude control of a flexible spacecraft with rotating appendages connected by magnetic bearing

<abstract> <p>This study focuses on the attitude control of a flexible spacecraft comprising rotating appendages, magnetic bearings, and a satellite platform capable of carrying flexible solar panels. The kinematic and dynamic models of the spacecraft were established using Lagrange methods to describe the translation and rotation of the spacecraft system and its connected components. A simplified model of the dynamics of a five-degrees-of-freedom (DOF) active magnetic bearing was developed using the equivalent stiffness and damping methods based on the magnetic gap variations in the magnetic bearing. Next, a fixed-time sliding mode control method was proposed for each component of the spacecraft to adjust the magnetic gap of the active magnetic bearing, realize a stable rotation of the flexible solar panels, obtain a high inertia for the appendage of the spacecraft, and accurately control the attitude. Finally, the numerical simulation results of the proposed fixed-time control method were compared with those of the proportional-derivative control method to demonstrate the superiority and effectiveness of the proposed control law.</p> </abstract>

Phase transition in a stochastic geometry model with applications to statistical mechanics

We study the connected components of the stochastic geometry model on Poisson points which is obtained by connecting points with a probability that depends on their relative position. Equivalently, we investigate the random clusters of the ran- dom connection model defined on the points of a Poisson process in d-dimensional space where the links are added with a particular probability function. We use the thermodynamicrelationsbetweenfreeenergy,entropyandinternalenergytofindthe functions of the cluster size distribution in the statistical mechanics of extensive and non-extensive. By comparing these obtained functions with the probability function predicted by Penrose, we provide a suitable approximate probability function. More- over, we relate this stochastic geometry model to the physics literature by showing how the fluctuations of the thermodynamic quantities of this model correspond to other models when a phase transition (10.1002/mma.6965, 2020) occurs. Also, we obtain the critical point using a new analytical method.

Topology optimization of periodically arranged components using shared design domains

Building structures from identical components organized in a periodic pattern is a common design strategy to reduce design effort, structural complexity and cost. However, any periodic pattern will impose certain design restrictions often leading to lower structural efficiency and heavier weight. Much research is available for periodic structures with connected components. This paper addresses minimal compliance design for periodic arrangements of unconnected components. The design problem discussed here is relevant for many applications where a tightly nested, space-saving arrangement of identical components is required. We formulate an optimal design problem for a component being part of a periodic arrangement. The orientation and position of the component relatively to its neighbours are prescribed. The component design is computed by topology optimization on a design domain possibly shared by several neighbouring components. Additional constraints prevent components from overlapping. Constraint aggregation is employed to reduce the computational cost of many local constraints. The effectiveness of the method is demonstrated by a series of 2D and 3D examples with an ever-smaller distance between the components. Moreover, problem-specific ranges with only little to no increase in compliance are reported.

The shape of cancer relapse: Topological data analysis predicts recurrence in paediatric acute lymphoblastic leukaemia

Acute Lymphoblastic Leukaemia (ALL) is the most frequent paediatric cancer. Modern therapies have improved survival rates, but approximately 15-20 % of patients relapse. At present, patients' risk of relapse are assessed by projecting high-dimensional flow cytometry data onto a subset of biomarkers and manually estimating the shape of this reduced data. Here, we apply methods from topological data analysis (TDA), which quantify shape in data via features such as connected components and loops, to pre-treatment ALL datasets with known outcomes. We combine these fully unsupervised analyses with machine learning to identify features in the pre-treatment data that are prognostic for risk of relapse. We find significant topological differences between relapsing and non-relapsing patients and confirm the predictive power of CD10, CD20, CD38, and CD45. Further, we are able to use the TDA descriptors to predict patients who relapsed. We propose three prognostic pipelines that readily extend to other haematological malignancies.

Cubical homology-based Image Classification - A Comparative Study

Persistent homology is a powerful tool in topological data analysis (TDA) to compute, study and encode efficiently multi-scale topological features and is being increasingly used in digital image classification. The topological features represent number of connected components, cycles, and voids that describe the shape of data. Persistent homology extracts the birth and death of these topological features through a filtration process. The lifespan of these features can represented using persistent diagrams (topological signatures). Cubical homology is a more efficient method for extracting topological features from a 2D image and uses a collection of cubes to compute the homology, which fits the digital image structure of grids. In this research, we propose a cubical homology-based algorithm for extracting topological features from 2D images to generate their topological signatures. Additionally, we propose a score, which measures the significance of each of the sub-simplices in terms of persistence. Also, gray level co-occurrence matrix (GLCM) and contrast limited adapting histogram equalization (CLAHE) are used as a supplementary method for extracting features. Machine learning techniques are then employed to classify images using the topological signatures. Among the eight tested algorithms with six published image datasets with varying pixel sizes, classes, and distributions, our experiments demonstrate that cubical homology-based machine learning with deep residual network (ResNet 1D) and Light Gradient Boosting Machine (lightGBM) shows promise with the extracted topological features.

TriCCo v1.0.0 – a cubulation-based method for computing connected components on triangular grids

We present a new method to identify connected components on a triangular grid. Triangular grids are, for example, used in atmosphere and climate models to discretize the horizontal dimension. Because they are unstructured, neighbor relations are not self-evident and identifying connected components is challenging. Our method addresses this challenge by involving the mathematical tool of cubulation. We show that cubulation allows one to map the 2-d cells of the triangular grid onto the vertices of the 3-d cells of a cubic grid. The latter is structured and so connected components can be readily identified on the cubic grid by previously developed software packages. An advantage is that the cubulation, i.e., the mapping between the triangular and cubic grids, needs to be computed only once, which should be benifical for analysing many data fields for the same grid.We further implement our method in a python package that we name TriCCo and that is made available via pypi and gitlab. We document the package, demonstrate its application using cloud data from the ICON atmosphere model, and characterize its computational performance. This shows that TriCCo is ready for triangular grids with 100,000 cells, but that its speed and memory requirements need to be improved to analyse larger grids.

Order preserving hierarchical agglomerative clustering

Partial orders and directed acyclic graphs are commonly recurring data structures that arise naturally in numerous domains and applications and are used to represent ordered relations between entities in the domains. Examples are task dependencies in a project plan, transaction order in distributed ledgers and execution sequences of tasks in computer programs, just to mention a few. We study the problem of order preserving hierarchical clustering of this kind of ordered data. That is, if we have $$a<b$$ a < b in the original data and denote their respective clusters by [a] and [b], then we shall have $$[a]<[b]$$ [ a ] < [ b ] in the produced clustering. The clustering is similarity based and uses standard linkage functions, such as single- and complete linkage, and is an extension of classical hierarchical clustering. To achieve this, we develop a novel theory that extends classical hierarchical clustering to strictly partially ordered sets. We define the output from running classical hierarchical clustering on strictly ordered data to be partial dendrograms; sub-trees of classical dendrograms with several connected components. We then construct an embedding of partial dendrograms over a set into the family of ultrametrics over the same set. An optimal hierarchical clustering is defined as the partial dendrogram corresponding to the ultrametric closest to the original dissimilarity measure, measured in the p-norm. Thus, the method is a combination of classical hierarchical clustering and ultrametric fitting. A reference implementation is employed for experiments on both synthetic random data and real world data from a database of machine parts. When compared to existing methods, the experiments show that our method excels both in cluster quality and order preservation.