Related papers: Purely periodic continued fractions and graph-dire…
The dual normal factor graph and the factor graph duality theorem have been considered for discrete graphical models. In this paper, we show an application of the factor graph duality theorem to continuous graphical models. Specifically, we…
A dual approach to defining the triangle sequence (a type of multidimensional continued fraction algorithm, initially developed in NT/9906016) for a pair of real numbers is presented, providing a new, clean geometric interpretation of the…
We study functional graphs generated by quadratic polynomials over prime fields. We introduce efficient algorithms for methodical computations and provide the values of various direct and cumulative statistical parameters of interest. These…
We construct an example of an iterated function system on the line, consisting of linear fractional transformations, such that two of the maps share a fixed points, but the dimension of the attractor equals the conformal dimension, so that…
Usually, mathematical objects have highly parallel interpretations. In this paper, we consider them as sequential constructors of other objects. In particular, we prove that every reflexive directed graph can be interpreted as a program…
We consider a one-parameter family of piecewise isometries of a rhombus. The rotational component is fixed, and its coefficients belong to the quadratic number field $K=\mathbb{Q}(\sqrt{2})$. The translations depend on a parameter $s$ which…
The connection between cutting sequences of geodesics on the modular surface $\operatorname{PSL}(2,\mathbb{Z})\backslash\mathbb{H}$ and regular continued fractions was established by Series, and Heersink expanded the cross-section of the…
We compare two families of continued fractions algorithms, the symmetrized Rosen algorithm and the Veech algorithm. Each of these algorithms expands real numbers in terms of certain algebraic integers. We give explicit models of the natural…
Bayesian estimation of Gaussian graphical models has proven to be challenging because the conjugate prior distribution on the Gaussian precision matrix, the G-Wishart distribution, has a doubly intractable partition function. Recent…
For a sequence of continuous, monotone functions $f_1,\dots,f_n \colon I \to \mathbb{R}$ ($I$ is an interval) we define the mapping $M \colon I^n \to I^n$ as a Cartesian product of quasi-arithmetic means generated by $f_j$-s. It is known…
For polynomials and rational maps of fixed degree over a finite field, we bound both the average number of connected components of their functional graphs as well as the average number of periodic points of their associated dynamical…
We expand the cross section of the geodesic flow in the tangent bundle of the modular surface given by Series to produce another section whose return map under the geodesic flow is a double cover of the natural extension of the Farey map.…
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…
InfoMod is a new software and application devoted to the modular group, PSL2(Z). It has algorithms that deals with the classical correspondences among continued fractions, geodesics on the modular surface and binary quadratic forms. In…
Hierarchical structure and repetition are prevalent in graphs originating from nature or engineering. These patterns can be represented by a class of parametric-structure graphs, which are defined by templates that generate structure by way…
We reformulate several known results about continued fractions in combinatorial terms. Among them the theorem of Conway and Coxeter and that of Series, both relating continued fractions and triangulations. More general polygon dissections…
We prove algorithmic weak and \Szemeredi{} regularity lemmas for several classes of sparse graphs in the literature, for which only weak regularity lemmas were previously known. These include core-dense graphs, low threshold rank graphs,…
Graphical functions are single-valued complex functions which arise from Feynman amplitudes. We study their properties and use their connection to multiple polylogarithms to calculate Feynman periods. For the zig-zag and two more families…
Our goal is to show that both the fast and slow versions of the triangle map (a type of multi-dimensional continued fraction algorithm) in dimension $n$ are ergodic, resolving a conjecture of Messaoudi, Noguiera and Schweiger. This…
Normals with unknown parameters (NUP) can be used to convert nontrivial model-based estimation problems into iterations of linear least-squares or Gaussian estimation problems. In this paper, we extend this approach by augmenting factor…