Related papers: The Computational Complexity of Generating Random …
Model multiplicity is a well-known but poorly understood phenomenon that undermines the generalisation guarantees of machine learning models. It appears when two models with similar training-time performance differ in their predictions and…
Real-world physical systems are inherently complex, often involving the coupling of multiple physics, making their simulation both highly valuable and challenging. Many mainstream approaches face challenges when dealing with decoupled data.…
Multiplicity fluctuations of intermediate-mass fragments are studied with the percolation model. It is shown that super-Poissonian fluctuations occur near the percolation transition and that this behavior is associated with the…
For self-similar fractals, the Minkowski content and fractal curvature have been introduced as a suitable limit of the geometric characteristics of its parallel sets, i.e., of uniformly thin coatings of the fractal. For some self-conformal…
Spectral clustering approaches have led to well-accepted algorithms for finding accurate clusters in a given dataset. However, their application to large-scale datasets has been hindered by computational complexity of eigenvalue…
Building upon [1], this study aims to introduce fractal geometry into graph theory, and to establish a potential theoretical foundation for complex networks. Specifically, we employ the method of substitution to create and explore…
The problem of real-time processing is one of the most challenging current issues in computer sciences. Because of the large amount of data to be treated in a limited period of time, parallel and distributed systems are required, whose…
Simulation methods are among the most ubiquitous methodological tools in statistical science. In particular, statisticians often is simulation to explore properties of statistical functionals in models for which developed statistical theory…
This article presents new algorithms for massively parallel granular dynamics simulations on distributed memory architectures using a domain partitioning approach. Collisions are modelled with hard contacts in order to hide their…
Large deviations for additive path functionals of stochastic dynamics and related numerical approaches have attracted significant recent research interest. We focus on the question of convergence properties for cloning algorithms in…
Many appplications in computational science are sufficiently compute-intensive that they depend on the power of parallel computing for viability. For all but the "embarrassingly parallel" problems, the performance depends upon the level of…
We present an intensity speckle simulation algorithm based on stochastic differential equations. Intensity speckles are generated with a negative exponential distribution and an exponential auto-correlation decay. The mean of the…
Coagulation-fragmentation processes describe the stochastic association and dissociation of particles in clusters. Cluster dynamics with cluster-cluster interactions for a finite number of particles has recently attracted attention…
The Massive Parallel Computation (MPC) model is a theoretical framework for popular parallel and distributed platforms such as MapReduce, Hadoop, or Spark. We consider the task of computing a large matching or small vertex cover in this…
We consider random instances of non-convex perceptron problems in the high-dimensional limit of a large number of examples $M$ and weights $N$, with finite load $\alpha = M/N$. We develop a formalism based on replica theory to predict the…
Interference of randomly scattered classical waves naturally leads to familiar speckle patterns, where the wave intensity follows an exponential distribution while the wave field itself is described by a circularly symmetric complex normal…
While deep learning excels in natural image and language processing, its application to high-dimensional data faces computational challenges due to the dimensionality curse. Current large-scale data tools focus on business-oriented…
Numerical simulations of concrete fracture performed with a probabilistic mesoscale discrete model are presented. The model represents a substantial part of material randomness by assigning random locations to the largest aggregates. The…
Homogeneous random fractals form a probabilistic extension of self-similar sets with more dependencies than in random recursive constructions. For such random fractals we consider mean values of the Lipschitz-Killing curvatures of their…
The diffraction spectrum of coherent waves scattered from fractal supports is calculated exactly. The fractals considered are of the class generated iteratively by successive dilations and translations, and include generalizations of the…