Convergence Rate Estimates for Countable Markov Chains with Absorption at Zero View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

2018-02

AUTHORS

A. I. Zeifman, A. V. Chegodaev

ABSTRACT

Nonstationary countable Markov chains with continuous time and absorption at zero are considered. We study the convergence rate to the limit mode. As examples, we consider simple nonstationary random walks.

PAGES

592-600

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/s10958-017-3647-2

DOI

http://dx.doi.org/10.1007/s10958-017-3647-2

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1099729737


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "author": [
      {
        "affiliation": {
          "alternateName": "Institute of Socio-Economic Development of Territories", 
          "id": "https://www.grid.ac/institutes/grid.465363.1", 
          "name": [
            "Vologda State University, Vologda, Russia", 
            "Institute of Informatics Problems of the RAS, Moscow, Russia", 
            "Institute of Socio\u2013Economic Development of Territories of the RAS, Vologda, Russia"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Zeifman", 
        "givenName": "A. I.", 
        "id": "sg:person.016403133727.49", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016403133727.49"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Vologda State Technical University", 
          "id": "https://www.grid.ac/institutes/grid.445065.6", 
          "name": [
            "Vologda State University, Vologda, Russia"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Chegodaev", 
        "givenName": "A. V.", 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1017/s0001867800015214", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1001136711"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1017/s002190020003967x", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1001600581"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/0304-4149(95)00028-6", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1029653681"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1017/s0021900200000152", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1043966632"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1017/s0021900200117966", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1054790451"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.2307/1427118", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1069490102"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2018-02", 
    "datePublishedReg": "2018-02-01", 
    "description": "Nonstationary countable Markov chains with continuous time and absorption at zero are considered. We study the convergence rate to the limit mode. As examples, we consider simple nonstationary random walks.", 
    "genre": "research_article", 
    "id": "sg:pub.10.1007/s10958-017-3647-2", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1136516", 
        "issn": [
          "1072-3374", 
          "1573-8795"
        ], 
        "name": "Journal of Mathematical Sciences", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "5", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "228"
      }
    ], 
    "name": "Convergence Rate Estimates for Countable Markov Chains with Absorption at Zero", 
    "pagination": "592-600", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "0d55aa2e03db1d58e9712cebeb5b26f99b58e48cd47fef9260a644fff69a446b"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/s10958-017-3647-2"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1099729737"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/s10958-017-3647-2", 
      "https://app.dimensions.ai/details/publication/pub.1099729737"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-10T21:30", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8687_00000484.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "http://link.springer.com/10.1007/s10958-017-3647-2"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/s10958-017-3647-2'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/s10958-017-3647-2'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s10958-017-3647-2'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s10958-017-3647-2'


 

This table displays all metadata directly associated to this object as RDF triples.

82 TRIPLES      20 PREDICATES      31 URIs      19 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/s10958-017-3647-2 schema:author Nfa4bc647cfd64bd8907dcfe18b215d35
2 schema:citation https://doi.org/10.1016/0304-4149(95)00028-6
3 https://doi.org/10.1017/s0001867800015214
4 https://doi.org/10.1017/s0021900200000152
5 https://doi.org/10.1017/s002190020003967x
6 https://doi.org/10.1017/s0021900200117966
7 https://doi.org/10.2307/1427118
8 schema:datePublished 2018-02
9 schema:datePublishedReg 2018-02-01
10 schema:description Nonstationary countable Markov chains with continuous time and absorption at zero are considered. We study the convergence rate to the limit mode. As examples, we consider simple nonstationary random walks.
11 schema:genre research_article
12 schema:inLanguage en
13 schema:isAccessibleForFree false
14 schema:isPartOf N4745e85dbbc54924867980ede854f85c
15 Nbfd48912938944aca1707c9356025f3f
16 sg:journal.1136516
17 schema:name Convergence Rate Estimates for Countable Markov Chains with Absorption at Zero
18 schema:pagination 592-600
19 schema:productId N1646e65eef0846e9ae7eaf9bf97e9a9b
20 Nc113de216a94487b914a6a4d1587b8eb
21 Nd57b1dbe155e4f52b7c13ca83f9a356a
22 schema:sameAs https://app.dimensions.ai/details/publication/pub.1099729737
23 https://doi.org/10.1007/s10958-017-3647-2
24 schema:sdDatePublished 2019-04-10T21:30
25 schema:sdLicense https://scigraph.springernature.com/explorer/license/
26 schema:sdPublisher N6b60bb571c1749da9480d3bdeec392b3
27 schema:url http://link.springer.com/10.1007/s10958-017-3647-2
28 sgo:license sg:explorer/license/
29 sgo:sdDataset articles
30 rdf:type schema:ScholarlyArticle
31 N1646e65eef0846e9ae7eaf9bf97e9a9b schema:name doi
32 schema:value 10.1007/s10958-017-3647-2
33 rdf:type schema:PropertyValue
34 N27c7d9f5ead64e0bab8e727e11652e94 rdf:first N86686ee7ea99446583f70e3d3fd7c6f0
35 rdf:rest rdf:nil
36 N4745e85dbbc54924867980ede854f85c schema:issueNumber 5
37 rdf:type schema:PublicationIssue
38 N6b60bb571c1749da9480d3bdeec392b3 schema:name Springer Nature - SN SciGraph project
39 rdf:type schema:Organization
40 N86686ee7ea99446583f70e3d3fd7c6f0 schema:affiliation https://www.grid.ac/institutes/grid.445065.6
41 schema:familyName Chegodaev
42 schema:givenName A. V.
43 rdf:type schema:Person
44 Nbfd48912938944aca1707c9356025f3f schema:volumeNumber 228
45 rdf:type schema:PublicationVolume
46 Nc113de216a94487b914a6a4d1587b8eb schema:name readcube_id
47 schema:value 0d55aa2e03db1d58e9712cebeb5b26f99b58e48cd47fef9260a644fff69a446b
48 rdf:type schema:PropertyValue
49 Nd57b1dbe155e4f52b7c13ca83f9a356a schema:name dimensions_id
50 schema:value pub.1099729737
51 rdf:type schema:PropertyValue
52 Nfa4bc647cfd64bd8907dcfe18b215d35 rdf:first sg:person.016403133727.49
53 rdf:rest N27c7d9f5ead64e0bab8e727e11652e94
54 sg:journal.1136516 schema:issn 1072-3374
55 1573-8795
56 schema:name Journal of Mathematical Sciences
57 rdf:type schema:Periodical
58 sg:person.016403133727.49 schema:affiliation https://www.grid.ac/institutes/grid.465363.1
59 schema:familyName Zeifman
60 schema:givenName A. I.
61 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016403133727.49
62 rdf:type schema:Person
63 https://doi.org/10.1016/0304-4149(95)00028-6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1029653681
64 rdf:type schema:CreativeWork
65 https://doi.org/10.1017/s0001867800015214 schema:sameAs https://app.dimensions.ai/details/publication/pub.1001136711
66 rdf:type schema:CreativeWork
67 https://doi.org/10.1017/s0021900200000152 schema:sameAs https://app.dimensions.ai/details/publication/pub.1043966632
68 rdf:type schema:CreativeWork
69 https://doi.org/10.1017/s002190020003967x schema:sameAs https://app.dimensions.ai/details/publication/pub.1001600581
70 rdf:type schema:CreativeWork
71 https://doi.org/10.1017/s0021900200117966 schema:sameAs https://app.dimensions.ai/details/publication/pub.1054790451
72 rdf:type schema:CreativeWork
73 https://doi.org/10.2307/1427118 schema:sameAs https://app.dimensions.ai/details/publication/pub.1069490102
74 rdf:type schema:CreativeWork
75 https://www.grid.ac/institutes/grid.445065.6 schema:alternateName Vologda State Technical University
76 schema:name Vologda State University, Vologda, Russia
77 rdf:type schema:Organization
78 https://www.grid.ac/institutes/grid.465363.1 schema:alternateName Institute of Socio-Economic Development of Territories
79 schema:name Institute of Informatics Problems of the RAS, Moscow, Russia
80 Institute of Socio–Economic Development of Territories of the RAS, Vologda, Russia
81 Vologda State University, Vologda, Russia
82 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...