Abstract
AbstractThis paper introduces graph‐based mutually exciting processes (GB‐MEP) to model event times in network point processes, focusing on an application to docked bike‐sharing systems. GB‐MEP incorporates known relationships between nodes in a graph within the intensity function of a node‐based multivariate Hawkes process. This approach reduces the number of parameters to a quantity proportional to the number of nodes in the network, resulting in significant advantages for computational scalability when compared with traditional methods. The model is applied on event data observed on the Santander Cycles network in central London, demonstrating that exploiting network‐wide information related to geographical location of the stations is beneficial to improve the performance of node‐based models for applications in bike‐sharing systems. The proposed GB‐MEP framework is more generally applicable to any network point process where a distance function between nodes is available, demonstrating wider applicability.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
