2022
DOI: 10.1016/j.jcss.2021.07.007
|View full text |Cite
|
Sign up to set email alerts
|

An extension of the Moran process using type-specific connection graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
9
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(9 citation statements)
references
References 24 publications
0
9
0
Order By: Relevance
“…Here a Star graph , denoted S N , consists of a single node (called centre ) connected to all other nodes (called leaves ). It is known [44] that ρ ( S N ) ≤ 1/( N − 2)! and ρfalse(SNfalse)false→1 as N → ∞.…”
Section: Resultsmentioning
confidence: 99%
See 4 more Smart Citations
“…Here a Star graph , denoted S N , consists of a single node (called centre ) connected to all other nodes (called leaves ). It is known [44] that ρ ( S N ) ≤ 1/( N − 2)! and ρfalse(SNfalse)false→1 as N → ∞.…”
Section: Resultsmentioning
confidence: 99%
“…In one dimension, we consider circulation graphs CirNd (already studied in this context from a different point of view, see [44]). For a fixed even integer d , a d -Circulation graph, denoted CirNd, consists of N nodes arranged in a cycle, where each node is connected to d other nodes, namely the next d /2 nodes and the previous d /2 nodes in the cyclic order, see figure 6 a .…”
Section: Resultsmentioning
confidence: 99%
See 3 more Smart Citations