graph sequence
Recently Published Documents


TOTAL DOCUMENTS

28
(FIVE YEARS 15)

H-INDEX

4
(FIVE YEARS 1)

2021 ◽  
Author(s):  
Mahesh Balan Umaithanu ◽  
Vignesh Ravichandran ◽  
M. Rohith Srinivaas ◽  
Venkat Subramanian Selvaraj
Keyword(s):  

2021 ◽  
Vol 12 (2) ◽  
pp. 1-22
Author(s):  
Jianguo Chen ◽  
Kenli Li ◽  
Keqin Li ◽  
Philip S. Yu ◽  
Zeng Zeng

Benefiting from convenient cycling and flexible parking locations, the Dockless Public Bicycle-sharing (DL-PBS) network becomes increasingly popular in many countries. However, redundant and low-utility stations waste public urban space and maintenance costs of DL-PBS vendors. In this article, we propose a Bicycle Station Dynamic Planning (BSDP) system to dynamically provide the optimal bicycle station layout for the DL-PBS network. The BSDP system contains four modules: bicycle drop-off location clustering, bicycle-station graph modeling, bicycle-station location prediction, and bicycle-station layout recommendation. In the bicycle drop-off location clustering module, candidate bicycle stations are clustered from each spatio-temporal subset of the large-scale cycling trajectory records. In the bicycle-station graph modeling module, a weighted digraph model is built based on the clustering results and inferior stations with low station revenue and utility are filtered. Then, graph models across time periods are combined to create a graph sequence model. In the bicycle-station location prediction module, the GGNN model is used to train the graph sequence data and dynamically predict bicycle stations in the next period. In the bicycle-station layout recommendation module, the predicted bicycle stations are fine-tuned according to the government urban management plan, which ensures that the recommended station layout is conducive to city management, vendor revenue, and user convenience. Experiments on actual DL-PBS networks verify the effectiveness, accuracy, and feasibility of the proposed BSDP system.


Author(s):  
Daheng Wang ◽  
Zhihan Zhang ◽  
Yihong Ma ◽  
Tong Zhao ◽  
Tianwen Jiang ◽  
...  

2020 ◽  
Vol 52 (3) ◽  
pp. 772-797
Author(s):  
Leonardo A. Videla

AbstractWe study the long-term behaviour of a random walker embedded in a growing sequence of graphs. We define a (generally non-Markovian) real-valued stochastic process, called the knowledge process, that represents the ratio between the number of vertices already visited by the walker and the current size of the graph. We mainly focus on the case where the underlying graph sequence is the growing sequence of complete graphs.


Sign in / Sign up

Export Citation Format

Share Document