English
Related papers

Related papers: Finite-State Mutual Dimension

200 papers

This paper introduces a new notion of dimensionality of probabilistic models from an information-theoretic view point. We call it the "descriptive dimension"(Ddim). We show that Ddim coincides with the number of independent parameters for…

Machine Learning · Computer Science 2019-10-28 Kenji Yamanishi

We analyze ground-state behaviors of fidelity susceptibility (FS) and show that the FS has its own distinct dimension instead of real system's dimension in general quantum phases. The scaling relation of the FS in quantum phase transitions…

Quantum Physics · Physics 2015-05-13 Shi-Jian Gu , Hai-Qing Lin

Subsystem Density-Functional Theory (DFT) is an emerging technique for calculating the electronic structure of complex molecular and condensed phase systems. In this topical review, we focus on some recent advances in this field related to…

Chemical Physics · Physics 2015-06-24 Alisa Krishtal , Debalina Sinha , Alessandro Genova , Michele Pavanello

We investigate the trade-off relations between imaginarity and mixedness in arbitrary $d$-dimensional quantum systems. For given mixedness, a quantum state with maximum imaginarity is defined to be a "maximally imaginary mixed state"…

Quantum Physics · Physics 2024-04-26 Bin Chen , Shao-Ming Fei

Selective state space models (SSMs), such as Mamba, achieve strong per-token expressivity by making the time discretization step $\Tilde{\Delta}$ a learned function of the input. However, in doing so, $\Tilde{\Delta}$ ceases to represent a…

Machine Learning · Computer Science 2026-05-12 Taylan Soydan , Miguel A. Bessa , Dirk Mohr , Rui Barreira

We prove a version of the countable union theorem for asymptotic dimension and we apply it to groups acting on asymptotically finite dimensional metric spaces. As a consequence we obtain the following finite dimensionality theorems. A) An…

Group Theory · Mathematics 2014-10-01 G. Bell , A. Dranishnikov

In this paper, we mainly elucidate a close relationship between the topological entropy and mean dimension theory for actions of polynomial growth groups. We show that metric mean dimension and mean Hausdorff dimension of subshifts with…

Dynamical Systems · Mathematics 2021-03-30 Yunping Wang , Ercai Chen , Xiaoyao Zhou

Synthetic dimensions, which simulate spatial coordinates using non-spatial degrees of freedom, are drawing interest in topological science and other fields for modelling higher-dimensional phenomena on simple structures. We present the…

Suplementary algoritm for optimizing technological parameters of soft magnetic compozities has been derived on the base of topological structure of the power loss characteristics. In optimization processes of magnitudes obeying scaling it…

Materials Science · Physics 2014-06-18 Krzysztof Zdzisław Sokalski , Bartosz Jankowski , Barbara Ślusarek

The conductance of finite systems plays a central role in the scaling theory of localization (Abrahams et al, 1979). Usually it is defined by the Landauer-type formulas, which remain open the following questions: (a) exclusion of the…

Disordered Systems and Neural Networks · Physics 2015-06-04 I. M. Suslov

In the field of quantum simulation of condensed matter phenomena by artificially engineering the Hamiltonian of an atomic, molecular or optical system, the concept of `synthetic dimensions' has recently emerged as a powerful way to emulate…

Quantum Gases · Physics 2019-10-02 Tomoki Ozawa , Hannah M. Price

In this manuscript, we provide a concise review of the concept of metric dimension for both deterministic as well as random graphs. Algorithms to approximate this quantity, as well as potential applications, are also reviewed. This work has…

Discrete Mathematics · Computer Science 2019-10-25 Richard C. Tillquist , Rafael M. Frongillo , Manuel E. Lladser

Systems obtained by quotienting a subshift of finite type (SFT) by another SFT are called finitely presented in the literature. Analogously, if a sofic shift is quotiented by a sofic equivalence relation, we call the resulting system…

Dynamical Systems · Mathematics 2021-05-17 Johan Kopra , Ville Salo

The dimension of a quantum state is traditionally seen as the number of superposed distinguishable states in a given basis. We propose an absolute, i.e.~basis-independent, notion of dimensionality for ensembles of quantum states. It is…

Quantum Physics · Physics 2024-12-24 Alexander Bernal , Gabriele Cobucci , Martin J. Renner , Armin Tavakoli

The capacity of finite state channels (FSCs) has been established as the limit of a sequence of multi-letter expressions only and, despite tremendous effort, a corresponding finite-letter characterization remains unknown to date. This paper…

Information Theory · Computer Science 2020-09-29 Holger Boche , Rafael F. Schaefer , H. Vincent Poor

A separator is a countable dense subset of $[0,1)$, and a separator enumerator is a naming scheme that assigns a real number in $[0,1)$ to each finite word so that the set of all named values is a separator. Mayordomo introduced separator…

Formal Languages and Automata Theory · Computer Science 2026-02-04 Subin Pulari

We present metrics for measuring the similarity of states in a finite Markov decision process (MDP). The formulation of our metrics is based on the notion of bisimulation for MDPs, with an aim towards solving discounted infinite horizon…

Artificial Intelligence · Computer Science 2012-07-19 Norman Ferns , Prakash Panangaden , Doina Precup

We explore the degrees of freedom (DoF) of three classes of finite state compound wireless networks in this paper. First, we study the multiple-input single-output (MISO) finite state compound broadcast channel (BC) with arbitrary number of…

Information Theory · Computer Science 2009-09-24 Tiangao Gou , Syed A. Jafar , Chenwei Wang

We introduce Similarity-Distance-Magnitude (SDM) language models (LMs), which are sequence prediction models fine-tuned to maximize the proportion of generations in the well-calibrated, high-probability region partitioned by a final-layer…

Computation and Language · Computer Science 2025-10-31 Allen Schmaltz

We consider the use of the well-known dual capacity bounding technique for deriving upper bounds on the capacity of indecomposable finite-state channels (FSCs) with finite input and output alphabets. In this technique, capacity upper bounds…

Information Theory · Computer Science 2021-07-13 Bashar Huleihel , Oron Sabag , Haim H. Permuter , Navin Kashyap , Shlomo Shamai