English
Related papers

Related papers: Random Systems with Complete Connections and the G…

200 papers

Proper continued fractions are generalized continued fractions with positive integer numerators $a_i$ and integer denominators with $b_i\geq a_i$. In this paper we study the strength of approximation of irrational numbers to their…

Dynamical Systems · Mathematics 2024-12-09 Niels Langeveld , David Ralston

We consider a fully-coupled slow-fast system of McKean-Vlasov SDEs with full dependence on the slow and fast component and on the law of the slow component and derive convergence rates to its homogenized limit. We do not make periodicity…

Probability · Mathematics 2022-08-24 Zachary Bezemek , Konstantinos Spiliopoulos

In this paper we answer certain questions posed by V.I. Arnold, namely, we study periods of continued fractions for solutions of quadratic equations in the form $x^2+p x=q$ with integer $p$ and $q$, $p^2+q^2\le R^2$. Our results concern the…

Number Theory · Mathematics 2012-07-10 E. Yu. Lerner

We describe various properties of continued fraction expansions of complex numbers in terms of Gaussian integers. Numerous distinct such expansions are possible for a complex number. They can be arrived at through various algorithms, as…

Number Theory · Mathematics 2011-02-21 S. G. Dani , Arnaldo Nogueira

We study perturbations of random dynamical systems whose associated transfer operators admit a uniform spectral gap. We provide a $k^{\text{th}}$-order approximation for the invariant density of the associated random dynamical system. We…

Dynamical Systems · Mathematics 2020-06-18 Toby Taylor-Crush

Quadratic irrationals posses a periodic continued fraction expansion. Much less is known about cubic irrationals. We do not even know if the partial quotients are bounded, even though extensive computations suggest they might follow…

Number Theory · Mathematics 2014-06-04 M. Lakner , P. Petek , M. Škapin Rugelj

The randomized extended Kaczmarz and Gauss-Seidel algorithms have attracted much attention because of their ability to treat all types of linear systems (consistent or inconsistent, full rank or rank-deficient). In this paper, we interpret…

Numerical Analysis · Mathematics 2018-01-11 Kui Du

By a classical result of Gauss and Kuzmin, the continued fraction expansion of a ``random'' real number contains each digit $a\in\mathbb{N}$ with asymptotic frequency $\log_2(1+1/(a(a+2)))$. We generalize this result in two directions:…

Number Theory · Mathematics 2025-11-06 Alex Jin , Shreyas Singh , Zhuo Zhang , AJ Hildebrand

Even though Zaremba's conjecture remains open, Bourgain and Kontorovich solved the problem for a full density subset. Nevertheless, there are only a handful of explicit sequences known to satisfy the strong version of the conjecture, all of…

Number Theory · Mathematics 2026-01-28 Elias Dubno

A homogenization problem of infinite dimensional diffusion processes indexed by ${\mathbf Z}^d$ having periodic drift coefficients is considered. By an application of the uniform ergodic theorem for infinite dimensional diffusion processes…

Probability · Mathematics 2026-03-31 Sergio Albeverio , Michael Rockner , Simonetta Bernabei , Minoru W. Yoshida

We describe a simple method that produces automatically closed forms for the coefficients of continued fractions expansions of a large number of special functions. The function is specified by a non-linear differential equation and initial…

Symbolic Computation · Computer Science 2015-07-16 Sébastien Maulat , Bruno Salvy

We consider existence and stability of an almost periodic solution of the quasilinear system of differential equations with piecewise constant argument of generalized type. The associated linear homogeneous system satisfies exponential…

Dynamical Systems · Mathematics 2016-09-07 M. U. Akhmet

We consider general Exponential Random Graph Models (ERGMs) where the sufficient statistics are functions of homomorphism counts for a fixed collection of simple graphs $F_k$. Whereas previous work has shown a degeneracy phenomenon in dense…

Probability · Mathematics 2024-04-04 Nicholas A. Cook , Amir Dembo

This work addresses the problem of simulating Gaussian random fields that are continuously indexed over a class of metric graphs, termed graphs with Euclidean edges, being more general and flexible than linear networks. We introduce three…

Statistics Theory · Mathematics 2024-04-29 Alfredo Alegría , Xavier Emery , Tobia Filosi , Emilio Porcu

Let $a_n$ be the random increasing sequence of natural numbers which takes each value independently with decreasing probability of order $n^{-\alpha}$, $0 < \alpha < 1/2$. We prove that, almost surely, for every measure-preserving system…

Classical Analysis and ODEs · Mathematics 2017-08-18 Ben Krause , Pavel Zorin-Kranich

This paper provides a necessary and sufficient condition for a random network with nodes Poissonly distributed on a unit square and a pair of nodes directly connected following a generic random connection model to be asymptotically almost…

Networking and Internet Architecture · Computer Science 2012-10-05 Guoqiang Mao , Brian Do Anderson

We investigate the completeness of Gabor systems with respect to several classes of window functions on rational lattices. Our main results show that the time-frequency shifts of every finite linear combination of Hermite functions with…

Mathematical Physics · Physics 2016-11-29 Karlheinz Gröchenig , Antti Haimi , José Luis Romero

This paper is a sequel to our previous work in which we found a combinatorial realization of continued fractions as quotients of the number of perfect matchings of snake graphs. We show how this realization reflects the convergents of the…

Combinatorics · Mathematics 2019-08-23 Ilke Canakci , Ralf Schiffler

We show that the quantum Hamilton Jacobi approach to a class of quantum mechanical bound state problems and the Gaussian orthogonal ensemble of random matrix theory are equivalent. The Berry connection for both problems is identical to…

Quantum Physics · Physics 2018-01-03 K. V. S. Shiv Chaitanya , B. A. Bambah

A famously hard graph problem with a broad range of applications is computing the number of perfect matchings, that is the number of unique and complete pairings of the vertices of a graph. We propose a method to estimate the number of…