相关论文: A box-covering algorithm for fractal scaling in sc…
The curves of scaling behavior is a significant concept in fractal dimension analysis of complex systems. However, the underlying rationale of this kind of curves for fractal cities is not yet clear. The aim of this paper is at researching…
Cascade solutions of the Boltzmann equation suffer from causality violation at large densities and/or scattering cross sections. Although the particle subdivision technique can reduce the causality violation, it alters event-by-event…
A major challenge facing existing sequential Monte-Carlo methods for parameter estimation in physics stems from the inability of existing approaches to robustly deal with experiments that have different mechanisms that yield the results…
We investigated two-dimensional brittle fragmentation with a flat impact experimentally, focusing on the low impact energy region near the fragmentation-critical point. We found that the universality class of fragmentation transition…
Sampling technique has become one of the recent research focuses in the graph-related fields. Most of the existing graph sampling algorithms tend to sample the high degree or low degree nodes in the complex networks because of the…
This paper presents a review of the fractal approach for describing the large scale distribution of galaxies. We start by presenting a brief, but general, introduction to fractals, which emphasizes their empirical side and applications…
Exponential growth describes an extremely rapid process ubiquitous across mathematics and diverse physical, biological, and technological systems. Here, we introduce a class of fractal-inspired lattices that combine long-range periodic…
Neural network models have recently demonstrated impressive prediction performance in complex systems where chaos and unpredictability appear. In spite of the research efforts carried out on predicting future trajectories or improving their…
This paper brings explicit considerations of distributed computing architectures and data structures into the rigorous design of Sequential Monte Carlo (SMC) methods. A theoretical result established recently by the authors shows that…
The present work introduces an efficient Monte Carlo algorithm for continuum percolation composed of randomly-oriented rectangles. By conducting extensive simulations, we report high precision percolation thresholds for a variety of…
Random sampling of graph partitions under constraints has become a popular tool for evaluating legislative redistricting plans. Analysts detect partisan gerrymandering by comparing a proposed redistricting plan with an ensemble of sampled…
Cluster analysis which focuses on the grouping and categorization of similar elements is widely used in various fields of research. Inspired by the phenomenon of atomic fission, a novel density-based clustering algorithm is proposed in this…
The unsupervised learning of community structure, in particular the partitioning vertices into clusters or communities, is a canonical and well-studied problem in exploratory graph analysis. However, like most graph analyses the…
Box Decoding is a sort-free tree-search MIMO detector whose complexity is independent of the QAM order, achieved by searching a fixed candidate box around a zero-forcing (ZF) estimate. However, without pruning, the number of visited nodes…
The study of real-life network modeling has become very popular in recent years. An attractive model is the scale-free percolation model on the lattice $\mathbb{Z}^d$, $d\ge1$, because it fulfills several stylized facts observed in large…
We present the algorithm for generating strictly saturated random sequential adsorption packings built of rounded polygons. It can be used to study various properties of such packings built of a wide variety of different shapes and in…
Modern 3D printing technologies and the upcoming mass-customization paradigm call for efficient methods to produce and distribute arbitrarily-shaped 3D objects. This paper introduces an original algorithm to split a 3D model in parts that…
Multifractal analysis (MFA) is a useful tool to systematically describe the spatial heterogeneity of both theoretical and experimental fractal patterns. One of the widely used methods for fractal analysis is box-covering. It is known to be…
In this paper we introduce algorithms for the construction of scale-free networks and for clustering around the nerve centers, nodes with a high connectivity in a scale-free networks. We argue that such overlay networks could support…
We perform fractal analysis on a closed classical hard-wall billiard, the circular billiard with a straight cut, assuming there are two openings on the boundary. We use a two-dimensional set of initial conditions that produce all possible…