Related papers: A Fractal Valued Random Iteration Algorithm and Fr…
The small-angle scattering curves of deterministic mass fractals are studied and analyzed in the momentum space. In the fractal region, the curve I(q)q^D is found to be log-periodic with a good accuracy, and the period is equal to the…
Kernel methods represent one of the most powerful tools in machine learning to tackle problems expressed in terms of function values and derivatives due to their capability to represent and model complex relations. While these methods show…
Urban form has been empirically demonstrated to be of scaling invariance and can be described with fractal geometry. However, the rational range of fractal dimension value and the relationships between various fractal indicators of cities…
Traditional approaches to variational inference rely on parametric families of variational distributions, with the choice of family playing a critical role in determining the accuracy of the resulting posterior approximation. Simple…
One of the most well known random fractals is the so-called Fractal percolation set. This is defined as follows: we divide the unique cube in $\mathbb{R}^d$ into $M^d$ congruent sub-cubes. For each of these cubes a certain retention…
Viscoelasticity and related phenomena are of great importance in the study of mechanical properties of material especially, biological materials. Certain materials show some complex effects in mechanical tests, which cannot be described by…
Iterative Proportional Fitting (IPF), combined with EM, is commonly used as an algorithm for likelihood maximization in undirected graphical models. In this paper, we present two iterative algorithms that generalize upon IPF. The first one…
We discuss the properties of invariant measures corresponding to iterated function systems (IFSs) with place-dependent probabilities and compute their Renyi entropies, generalized dimensions, and multifractal spectra. It is shown that with…
Iterated functions system (IFS) is defined by specifying a set of functions in a classical phase space, which act randomly on an initial point. In an analogous way, we define a quantum iterated functions system (QIFS), where functions act…
This paper is a survey, with few proofs, of ideas and notions related to self-similarity of groups, semi-groups and their actions. It attempts to relate these concepts to more familiar ones, such as fractals, self-similar sets, and…
Fractal and fractal-rate stochastic point processes (FSPPs and FRSPPs) provide useful models for describing a broad range of diverse phenomena, including electron transport in amorphous semiconductors, computer-network traffic, and…
In this paper, a new variant to fractional signal processing is proposed known as the Reduced Order Fractional Fourier Transform. Various properties satisfied by its transformation kernel is derived. The properties associated with the…
Many recent advances in large scale probabilistic inference rely on variational methods. The success of variational approaches depends on (i) formulating a flexible parametric family of distributions, and (ii) optimizing the parameters to…
We consider iterated functions systems (IFS) on compact metric spaces and introduce the concept of target sets. Such sets have very rich dynamical properties and play a similar role as semifractals introduced by Lasota and Myjak do for…
We give a systematic account of iterated function systems (IFS) of weak contractions of different types (Browder, Rakotch, topological). We show that the existence of attractors and asymptotically stable invariant measures, and the validity…
In this paper we introduce new models of complex weighted networks sharing several properties with fractal sets: the deterministic non-homogeneous weighted fractal networks and the stochastic weighted fractal networks. Networks of both…
Fractional programming (FP) is a branch of mathematical optimization that deals with the optimization of ratios. It is an invaluable tool for signal processing and machine learning, because many key metrics in these fields are fractionally…
The aim of this paper is to construct a fractal with the help of a finite family of generalized F-contraction mappings, a class of mappings more general than contraction mappings, defined in the setup of b-metric space. Consequently, we…
Iterative phase retrieval algorithms typically employ projections onto constraint subspaces to recover the unknown phases in the Fourier transform of an image, or, in the case of x-ray crystallography, the electron density of a molecule.…
In this article, starting from a Gibbs capacity, we build a new random capacity by applying two simple operators, the first one introducing some redundancy and the second one performing a random sampling. Depending on the values of the two…