EconStor >
Bank of Canada, Ottawa >
Bank of Canada Working Papers >

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10419/53799
  
Title:Estimating the structure of the payment network in the LVTS: An application of estimating communities in network data PDF Logo
Authors:Chapman, James T. E.
Zhang, Yinan
Issue Date:2010
Series/Report no.:Bank of Canada Working Paper 2010,13
Abstract:In the Canadian large value payment system an important goal is to understand how liquidity is transferred through the system and hence how efficient the system is in settling payments. Understanding the structure of the underlying network of relationships between participants in the payment system is a crucial step in achieving the goal. The set of nodes in any given network can be partitioned into a number of groups (or 'communities'). Usually, the partition is not directly observable and must be inferred from the observed data of interaction flows between all nodes. In this paper we use the statistical model of éCopiéc, Jackson, and Kirman (2007) to estimate the most likely partition in the network of business relationships in the LVTS. Specifically, we estimate from the LVTS transactions data different 'communities' formed by the direct participants in the system. Using various measures of transaction intensity, we uncover communities of participants that are based on both transaction amount and their physical locations. More importantly these communities were not easily discernible in previous studies of LVTS data since previous studies did not take into account the network (or transitive) aspects of the data.
Subjects:Payment, clearing, and settlement systems
financial stability
JEL:C11
D85
G20
Document Type:Working Paper
Appears in Collections:Bank of Canada Working Papers

Files in This Item:
File Description SizeFormat
630741034.pdf292.21 kBAdobe PDF
No. of Downloads: Counter Stats
Download bibliographical data as: BibTeX
Share on:http://hdl.handle.net/10419/53799

Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.