How often can two independent elephant random walks on Z meet?

被引：0

作者：

Roy, Rahul ^{[1
]}

Takei, Masato ^{[2
]}

Tanemura, Hideki ^{[3
]}

机构：

[1] Indian Stat Inst, 7 SJS Sansanwal Marg, New Delhi 110016, India

[2] Yokohama Natl Univ, Dept Appl Math, Fac Engn, 79-5 Tokiwadai,Hodogaya Ku, Yokohama, Kanagawa 2408501, Japan

[3] Keio Univ, Dept Math, 3-14-1 Hiyoshi,Kohoku Ku, Yokohama, Kanagawa 2238522, Japan

来源：

PROCEEDINGS OF THE JAPAN ACADEMY SERIES A-MATHEMATICAL SCIENCES | 2024年 / 100卷 / 10期

关键词：

Self-interacting random walks; Random walks with memory; Elephant random walks;

D O I：

10.3792/pjaa.100.012

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We show that two independent elephant random walks on the integer lattice Z meet each other finitely often or infinitely often depends on whether the memory parameter p is strictly larger than 3/4 or not. Asymptotic results for the distance between them are also obtained.

引用

页码：57 / 59

页数：3

共 26 条

[21] THEORY-Z - HOW AMERICAN-BUSINESS CAN MEET THE JAPANESE CHALLENGE - OUCHI,W
MICHAEL, SR
BUSINESS HORIZONS, 1986, 29 (02) : 86 - 87
[22] THEORY-Z - HOW AMERICAN-BUSINESS CAN MEET THE JAPANESE CHALLENGE - DUCHI,WG
BROOKS, J
NEW YORK TIMES BOOK REVIEW, 1981, 86 (27): : 2 - +
[23] THEORY-Z - HOW AMERICAN-BUSINESS CAN MEET THE JAPANESE CHALLENGE - OUCHI,W
ANDERSSON, D
ECONOMIC AND INDUSTRIAL DEMOCRACY, 1982, 3 (02) : 205 - 209
[24] A COMMENTARY ON THEORY Z - HOW AMERICAN-BUSINESS CAN MEET THE JAPANESE CHALLENGE - OUCHI,W
SCHEIN, EH
SLOAN MANAGEMENT REVIEW, 1981, 23 (01): : 55 - 68
[25] THEORY-Z - HOW AMERICAN-BUSINESS CAN MEET THE JAPANESE CHALLENGE - OUCHI,WG
PERRY, LT
STRATEGIC MANAGEMENT JOURNAL, 1982, 3 (04) : 381 - 383
[26] Diversity Youth Shall Be Served Two Gen Z-Ers Discuss How Deir Principles Can Shape The Profession
Drane, Quincy
Diaddezio, Madison
Lighting Design and Application: LD and A, 2023, 53 (11) : 22 - 23

← 1 2 3 →