相关论文: A Fractal Valued Random Iteration Algorithm and Fr…

In this article, we present a novel box-covering algorithm for analyzing the fractal properties of complex networks. Unlike traditional algorithms that impose a predetermined box size, our approach assigns nodes to boxes identified by their…

If a point particle moves chaotically through a periodic array of scatterers the associated transport coefficients are typically irregular functions under variation of control parameters. For a piecewise linear two-parameter map we analyze…

In many problems of classical analysis extremal configurations appear to exhibit complicated fractal structure. This makes it much harder to describe extremals and to attack such problems. Many of these problems are related to the…

This article aims to study fractal interpolation functions corresponding to a sequence of iterated function systems (IFSs). For a suitable choice of a sequence of IFS parameters, the corresponding non-stationary fractal function is a better…

We investigate the use of iterated function system (IFS) models for data analysis. An IFS is a discrete dynamical system in which each time step corresponds to the application of one of a finite collection of maps. The maps, which represent…

Graphical models have found widespread applications in many areas of modern statistics and machine learning. Iterative Proportional Fitting (IPF) and its variants have become the default method for undirected graphical model estimation, and…

The fractal dimension provides a statistical index of object complexity by studying how the pattern changes with the measuring scale. Although useful in several classification tasks, the fractal dimension is under-explored in deep learning…

There are many research available on the study of real-valued fractal interpolation function and fractal dimension of its graph. In this paper, our main focus is to study the dimensional results for vector-valued fractal interpolation…

As nature is ascribed as quantum, the fractals also pose some intriguing appearance which is found in many micro and macro observable entities or phenomena. Fractals show self-similarity across sizes; structures that resemble the entire are…

A $d$-dimensional random array on a nonempty set $I$ is a stochastic process $\boldsymbol{X}=\langle X_s:s\in \binom{I}{d}\rangle$ indexed by the set $\binom{I}{d}$ of all $d$-element subsets of $I$. We obtain structural decompositions of…

We present Vector-Space Markov Random Fields (VS-MRFs), a novel class of undirected graphical models where each variable can belong to an arbitrary vector space. VS-MRFs generalize a recent line of work on scalar-valued, uni-parameter…

Fractals offer the ability to generate fascinating geometric shapes with all sorts of unique characteristics (for instance, fractal geometry provides a basis for modelling infinite detail found in nature). While fractals are non-euclidean…

We propose alternatives to Bayesian a priori distributions that are frequently used in the study of inverse problems. Our aim is to construct priors that have similar good edge-preserving properties as total variation or Mumford-Shah priors…

We develop a multifractal random tilling that fills the square. The multifractal is formed by an arrangement of rectangular blocks of different sizes, areas and number of neighbors. The overall feature of the tilling is an heterogeneous and…

In this paper are investigated strictly self-similar fractals that are composed of an infinite number of regular star-polygons, also known as Sierpinski $n$-gons, $n$-flakes or polyflakes. Construction scheme for Sierpinsky $n$-gon and…

Iterated Graph Systems (IGS) transplant ideas from fractal geometry into graph theory. Building on this framework, we extend Edge IGS from the primitive to the reducible setting. Within this broader context, we formulate rigorous…

Stochastic variational inference makes it possible to approximate posterior distributions induced by large datasets quickly using stochastic optimization. The algorithm relies on the use of fully factorized variational distributions.…

In this short note, we merge the areas of hypercomplex algebras with that of fractal interpolation and approximation. The outcome is a new holistic methodology that allows the modelling of phenomena exhibiting a complex self-referential…

The graph Fourier transform (GFT) is a fundamental tool in graph signal processing and has recently been extended to the graph fractional Fourier transform (GFRFT). Existing sampling methods in the GFRFT domain are primarily designed to…

A simple, yet unifying method is provided for the construction of tilings by tiles obtained from the attractor of an iterated function system (IFS). Many examples appearing in the literature in ad hoc ways, as well as new examples, can be…