Finite-state Markov chains obey Benford's law

A.A.N. Ridder; A. Berger; T.P. Hill; B. Kaynar

doi:10.1137/100789890

Finite-state Markov chains obey Benford's law

A.A.N. Ridder
, A. Berger
, T.P. Hill
, B. Kaynar

Amsterdam Business Research Institute

Research output: Contribution to Journal › Article › Academic › peer-review

Abstract

A sequence of real numbers (xn) is Benford if the significands, i.e., the fraction parts in the floating-point representation of (xn), are distributed logarithmically. Similarly, a discrete-time irreducible and aperiodic finite-state Markov chain with transition probability matrix P and limiting matrix P* is Benford if every component of both sequences of matrices (P

Original language	English
Pages (from-to)	665-684
Journal	SIAM Journal on Matrix Analysis and Applications
Volume	32
Issue number	3
DOIs	https://doi.org/10.1137/100789890
Publication status	Published - 2011

Access to Document

10.1137/100789890

Persistent URL (handle)

Persistent link

Cite this

@article{59b35348106d43f1838550e8396b2922,

title = "Finite-state Markov chains obey Benford's law",

abstract = "A sequence of real numbers (xn) is Benford if the significands, i.e., the fraction parts in the floating-point representation of (xn), are distributed logarithmically. Similarly, a discrete-time irreducible and aperiodic finite-state Markov chain with transition probability matrix P and limiting matrix P* is Benford if every component of both sequences of matrices (P",

author = "A.A.N. Ridder and A. Berger and T.P. Hill and B. Kaynar",

year = "2011",

doi = "10.1137/100789890",

language = "English",

volume = "32",

pages = "665--684",

journal = "SIAM Journal on Matrix Analysis and Applications",

issn = "0895-4798",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "3",

}

TY - JOUR

T1 - Finite-state Markov chains obey Benford's law

AU - Ridder, A.A.N.

AU - Berger, A.

AU - Hill, T.P.

AU - Kaynar, B.

PY - 2011

Y1 - 2011

N2 - A sequence of real numbers (xn) is Benford if the significands, i.e., the fraction parts in the floating-point representation of (xn), are distributed logarithmically. Similarly, a discrete-time irreducible and aperiodic finite-state Markov chain with transition probability matrix P and limiting matrix P* is Benford if every component of both sequences of matrices (P

AB - A sequence of real numbers (xn) is Benford if the significands, i.e., the fraction parts in the floating-point representation of (xn), are distributed logarithmically. Similarly, a discrete-time irreducible and aperiodic finite-state Markov chain with transition probability matrix P and limiting matrix P* is Benford if every component of both sequences of matrices (P

UR - https://www.scopus.com/pages/publications/80054043105

UR - https://www.scopus.com/pages/publications/80054043105#tab=citedBy

U2 - 10.1137/100789890

DO - 10.1137/100789890

M3 - Article

SN - 0895-4798

VL - 32

SP - 665

EP - 684

JO - SIAM Journal on Matrix Analysis and Applications

JF - SIAM Journal on Matrix Analysis and Applications

IS - 3

ER -

Finite-state Markov chains obey Benford's law

Abstract

Access to Document

Persistent URL (handle)

Other files and links

Fingerprint

Cite this