Related papers: IFS measures on generalized Bratteli diagrams
We propose a notion of contraction function for a family of graphs and establish its connection to the strong spatial mixing for spin systems. More specifically, we show that for anti-ferromagnetic Potts model on families of graphs…
We extend the study of the multifractal analysis of the class of equicontractive self-similar measures of finite type to the non-equicontractive setting. Although stronger than the weak separation condition, the finite type property…
A fractal surface is a set which is a graph of a bivariate continuous function. In the construction of fractal surfaces using IFS, vertical scaling factors in IFS are important one which characterizes a fractal feature of surfaces…
We study the local dimensions and local multifractal properties of measures on doubling metric spaces. Our aim is twofold. On one hand, we show that there are plenty of multifractal type measures in all metric spaces which satisfy only mild…
We study the set S of ergodic probability Borel measures on stationary non-simple Bratteli diagrams which are invariant with respect to the tail equivalence relation. Equivalently, the set S is formed by ergodic probability measures…
The present work is concerned with the eqiucontinuity and sensitivity of iterated function systems (IFSs). Here, we consider more general case of IFSs, i.e. the IFSs generated by a family of relations. We generalize the concepts of…
In this paper we consider Iterated Function Systems (IFS) on the real line consisting of continuous piecewise linear functions. We assume some bounds on the contraction ratios of the functions, but we do not assume any separation condition.…
In this paper we investigate $p$-adic self-similar sets and $p$-adic self-similar measures. We show that $p$-adic self-similar sets are $p$-adic path set fractals, and that the converse is not necessarily true. For $p$-adic self-similar…
In this paper we investigate aspects of rigidity and flexibility for conformal iterated function systems. For the case in which the systems are not essentially affine we show that two such systems are conformal equivalent if and only if in…
This paper presents a system identification framework -- inspired by multi-task learning -- to estimate the dynamics of a given number of linear time-invariant (LTI) systems jointly by leveraging structural similarities across the systems.…
This article introduces a full mathematical and numerical framework for treating functional shapes (or fshapes) following the landmarks of shape spaces and shape analysis. Functional shapes can be described as signal functions supported on…
We discuss various infinite-dimensional configuration spaces that carry measures quasiinvariant under compactly-supported diffeomorphisms of a manifold M corresponding to a physical space. Such measures allow the construction of unitary…
We construct a coalescence hidden variable fractal interpolation function (CHFIF) through a non-diagonal iterated function system(IFS). Such a FIF may be self-affine or non-self-affine depending on the parameters of the defining…
We work out the theory of fractional isomorphism of graphons as a generalization to the classical theory of fractional isomorphism of finite graphs. The generalization is given in terms of homomorphism densities of finite trees and it is…
Few-shot semantic segmentation (FSS) is a crucial challenge in computer vision, driving extensive research into a diverse range of methods, from advanced meta-learning techniques to simple transfer learning baselines. With the emergence of…
Statisticians increasingly face the problem to reconsider the adaptability of classical inference techniques. In particular, divers types of high-dimensional data structures are observed in various research areas; disclosing the boundaries…
We study a class $\widehat{\mathfrak{F}}$ of one-dimensional full branch maps introduced in [Doubly Intermittent Full Branch Maps with Critical Points and Singularities; D. Coates, S. Luzzatto, M. Mubarak, 2022], admitting two indifferent…
Graphity models are characterized by configuration spaces in which states correspond to graphs and Hamiltonians that depend on local properties of graphs such as the degrees of vertices and numbers of short cycles. As statistical systems,…
It is well-known since the seventies of last century that Depth First Search (DFS) can be used to compute strongly connected components [RE. Tarjan. SIAM Journal on Computing, 1972] and Breadth First Search (BFS) can be used to compute…
An affine iterated function system is a finite collection of affine invertible contractions and the invariant set associated to the mappings is called self-affine. In 1988, Falconer proved that, for given matrices, the Hausdorff dimension…