| dc.contributor.author | Zhang, Li-Chun | |
| dc.date.accessioned | 2023-03-02T13:09:42Z | |
| dc.date.available | 2023-03-02T13:09:42Z | |
| dc.date.created | 2023-01-13T07:56:59Z | |
| dc.date.issued | 2021-12-10 | |
| dc.identifier.citation | Zhang, L.-C. (2022). Graph sampling by lagged random walk. Stat, 11( 1), e444. https://doi.org/10.1002/sta4.444 | en_US |
| dc.identifier.issn | 2049-1573 | |
| dc.identifier.uri | https://hdl.handle.net/11250/3055413 | |
| dc.description | "This is the peer reviewed version of the following article: Zhang, L.-C. (2022). Graph sampling by lagged random walk. Stat, 11( 1), e444, which has been published in final form at https://doi.org/10.1002/sta4.444
This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Use of Self-Archived Versions. This article may not be enhanced, enriched or otherwise transformed into a derivative work, without express permission from Wiley or by statutory rights under applicable legislation. Copyright notices must not be removed, obscured or modified. The article must be linked to Wiley’s version of record on Wiley Online Library and any embedding, framing or otherwise making available the article or pages thereof by third parties from platforms, services and websites other than Wiley Online Library must be prohibited." | en_US |
| dc.description.abstract | We propose a family of lagged random walk sampling methods in simple undirected graphs, where transition to the next state (i.e., node) depends on both the current and previous states—hence, lagged. The existing random walk sampling methods can be incorporated as special cases. We develop a novel approach to estimation based on lagged random walks at equilibrium, where the target parameter can be any function of values associated with finite-order subgraphs, such as edge, triangle, 4-cycle and others. | en_US |
| dc.language.iso | eng | en_US |
| dc.publisher | Wiley | en_US |
| dc.title | Graph sampling by lagged random walk | en_US |
| dc.title.alternative | Graph sampling by lagged random walk | en_US |
| dc.type | Peer reviewed | en_US |
| dc.type | Journal article | en_US |
| dc.description.version | acceptedVersion | en_US |
| dc.rights.holder | © 2021 John Wiley & Sons, Ltd. | en_US |
| dc.subject.nsi | VDP::Matematikk og Naturvitenskap: 400::Matematikk: 410::Statistikk: 412 | en_US |
| dc.source.volume | 11 | en_US |
| dc.source.journal | Stat | en_US |
| dc.source.issue | 1 | en_US |
| dc.identifier.doi | 10.1002/sta4.444 | |
| dc.identifier.cristin | 2106108 | |
| cristin.ispublished | true | |
| cristin.fulltext | postprint | |
| cristin.qualitycode | 1 | |
