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

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

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n17https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n5http://dbpedia.org/resource/G/G/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Dennis_Lindley
dbo:wikiPageWikiLink
dbr:Lindley_equation
dbp:knownFor
dbr:Lindley_equation
dbo:knownFor
dbr:Lindley_equation
Subject Item
dbr:List_of_scientific_equations_named_after_people
dbo:wikiPageWikiLink
dbr:Lindley_equation
Subject Item
n5:1_queue
dbo:wikiPageWikiLink
dbr:Lindley_equation
Subject Item
dbr:Lindley_equation
rdf:type
dbo:Election
rdfs:label
Lindley equation
rdfs:comment
In probability theory, the Lindley equation, Lindley recursion or Lindley processes is a discrete-time stochastic process An where n takes integer values and: An + 1 = max(0, An + Bn). Processes of this form can be used to describe the waiting time of customers in a queue or evolution of a queue length over time. The idea was first proposed in the discussion following Kendall's 1951 paper.
dcterms:subject
dbc:Queueing_theory
dbo:wikiPageID
3474448
dbo:wikiPageRevisionID
995636192
dbo:wikiPageWikiLink
dbr:Queueing_theory dbr:David_George_Kendall n5:1_queue dbc:Queueing_theory dbr:Probability_theory dbr:Dennis_Lindley dbr:Integer dbr:Wiener–Hopf_method dbr:Discrete-time_stochastic_process
owl:sameAs
freebase:m.09ffx7 wikidata:Q6552558 n17:4qLv3
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:Queueing_theory
dbo:abstract
In probability theory, the Lindley equation, Lindley recursion or Lindley processes is a discrete-time stochastic process An where n takes integer values and: An + 1 = max(0, An + Bn). Processes of this form can be used to describe the waiting time of customers in a queue or evolution of a queue length over time. The idea was first proposed in the discussion following Kendall's 1951 paper.
gold:hypernym
dbr:Process
prov:wasDerivedFrom
wikipedia-en:Lindley_equation?oldid=995636192&ns=0
dbo:wikiPageLength
3537
foaf:isPrimaryTopicOf
wikipedia-en:Lindley_equation
Subject Item
dbr:List_of_statistics_articles
dbo:wikiPageWikiLink
dbr:Lindley_equation
Subject Item
dbr:Lindley's_integral_equation
dbo:wikiPageWikiLink
dbr:Lindley_equation
dbo:wikiPageRedirects
dbr:Lindley_equation
Subject Item
dbr:Lindley_recursion
dbo:wikiPageWikiLink
dbr:Lindley_equation
dbo:wikiPageRedirects
dbr:Lindley_equation
Subject Item
wikipedia-en:Lindley_equation
foaf:primaryTopic
dbr:Lindley_equation