This HTML5 document contains 22 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n9http://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Random_Fibonacci_sequence
rdf:type
dbo:Drug
rdfs:label
Random Fibonacci sequence
rdfs:comment
In mathematics, the random Fibonacci sequence is a stochastic analogue of the Fibonacci sequence defined by the recurrence relation fn = fn−1 ± fn−2, where the signs + or − are chosen at random with equal probability 1/2, independently for different n. By a theorem of Harry Kesten and Hillel Furstenberg, random recurrent sequences of this kind grow at a certain exponential rate, but it is difficult to compute the rate explicitly. In 1999, showed that the growth rate of the random Fibonacci sequence is equal to 1.1319882487943…(sequence in the OEIS), a mathematical constant that was later named Viswanath's constant.
owl:sameAs
yago-res:Random_Fibonacci_sequence freebase:m.02564g
dbp:wikiPageUsesTemplate
dbt:Math dbt:MathWorld dbt:Short_description dbt:OEIS_el dbt:Reflist dbt:OEIS
dct:subject
dbc:Fibonacci_numbers dbc:Stochastic_processes dbc:Mathematical_constants dbc:Number_theory
gold:hypernym
dbr:Analogue
prov:wasDerivedFrom
n9:Random_Fibonacci_sequence?oldid=1073285423&ns=0
dbo:wikiPageID
411957
dbo:wikiPageLength
7033
dbo:wikiPageRevisionID
1073285423
dbo:abstract
In mathematics, the random Fibonacci sequence is a stochastic analogue of the Fibonacci sequence defined by the recurrence relation fn = fn−1 ± fn−2, where the signs + or − are chosen at random with equal probability 1/2, independently for different n. By a theorem of Harry Kesten and Hillel Furstenberg, random recurrent sequences of this kind grow at a certain exponential rate, but it is difficult to compute the rate explicitly. In 1999, showed that the growth rate of the random Fibonacci sequence is equal to 1.1319882487943…(sequence in the OEIS), a mathematical constant that was later named Viswanath's constant.
foaf:isPrimaryTopicOf
n9:Random_Fibonacci_sequence