The analysis of continuous events for any application involves the discretization of an event into sequences with potential historical dependencies. These sequences represent time stamps or samplings of a continuous process collectively forming a time series dataset utilized for training recurrent neural networks (RNNs) such as Long Short-Term Memory (LSTM) and Gated Recurrent Unit (GRU) for pattern prediction. The challenge is to ensure that the estimates from the trained models are consistent in the same input domain for different discretizations of the same or similar continuous history-dependent events. In other words, if different time stamps are used during the prediction phase after training, the model is still expected to give consistent predictions based on the knowledge it has learned. To address this, we present a novel RNN transition formula intended to produce consistent estimates in a wide range of engineering applications. The approach was validated with synthetically generated datasets in 1D, 2D, and 3D spaces, intentionally designed to exhibit high non-linearity and complexity. Furthermore, we have verified our results with real-world datasets to ensure practical applicability and robustness. These assessments show the ability of the proposed method, which involves restructuring the mathematical structure and extending conventional RNN architectures, to provide reliable and consistent estimates for complex time series data.
We analyze the number of cliques of given size and the size of the largest clique in tensor product $G \times H$ of two Erdős-Rényi graphs $G$ and $H$. Then an extended clustering coefficient is introduced and is studied for $G \times H$. Restriction to the standard clustering coefficient has a direct relation to the local efficiency of the graph, and the results are also interpreted in terms of the efficiency. As a last statistic of interest, the number of isolated vertices is analyzed for $G \times H$. The paper is concluded with a discussion of the modular product of random graphs, and the relation to the maximum common subgraph problem.
Various relations for comparison of intervals of real numbers are introduced, and the expected length of the corresponding longest increasing subsequence is analyzed. When intervals are randomly generated by taking the minimum and maximum of two independent uniform random variables, we prove that the expected length of the longest increasing subsequence grows on the order of 3 √ n. We also investigate the asymptotic behavior of the expected length under alternative comparison relations and random interval models. Discussions on other subsequence problems for interval sequences are included.
Current neural network (NN) models can learn patterns from data points with historical dependence. Specifically, in natural language processing (NLP), sequential learning has transitioned from recurrence-based architectures to transformer-based architectures. However, it is unknown which NN architectures will perform the best on datasets containing deformation history due to mechanical loading. Thus, this study ascertains the appropriateness of 1D-convolutional, recurrent, and transformer-based architectures for predicting deformation localization based on the earlier states in the form of deformation history. Following this investigation, the crucial incompatibility issues between the mathematical computation of the prediction process in the best-performing NN architectures and the actual values derived from the natural physical properties of the deformation paths are examined in detail.