Hamed Amini
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Hamed Amini has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Nikolaos Fountoulakis
University of Birmingham
2 shared publications Andreea Minca
School of Operations Research and Information Engineering Cornell University
1 shared publication- Andreea Minca
School of Operations Research and Information Engineering, Cornell University, Ithaca, USA
1 shared publication - Rama Cont
Mathematical Institute, University of Oxford, Oxford, UK
1 shared publication - Yuval Peres
Beijing Institute of Mathematical Sciences and Applications (BIMSA), Huairou District, Beijing, People’s Republic of China
1 shared publication
Latest Publications
- Open Access
Inhomogeneous Financial Networks and Contagious Links
We propose a framework for testing the possibility of large cascades in financial networks. This framework accommodates a variety of specifications for the probabilities of emergence of 'contagious links', where a contagious link leads to the default of a bank following the default of its counterparty. These are the first order contagion probabilities and depend on the shock propagation mechanism under consideration. When the cascade represents an insolvency cascade, and under complete observation of balance sheets, the first order contagion probabilities follow from the distribution of recovery rates. Under general contagion mechanisms and incomplete information, the financial network is modeled as an inhomogenous random graph in which only some of the banks' character-istics are observable. We give bounds on the size of the first order contagion and testable conditions for it to be small. For power-law financial networks, we also give a condition so that the higher order cascade dies out.
Open AccessInhomogeneous Financial Networks and Contagious Links
We propose a framework for testing the possibility of large cascades in financial networks. This framework accommodates a variety of specifications for the probabilities of emergence of 'contagious links', where a contagious link leads to the default of a bank following the default of its counterparty. These are the first order contagion probabilities and depend on the shock propagation mechanism under consideration. When the cascade represents an insolvency cascade, and under complete observation of balance sheets, the first order contagion probabilities follow from the distribution of recovery rates. Under general contagion mechanisms and incomplete information, the financial network is modeled as an inhomogenous random graph in which only some of the banks' character-istics are observable. We give bounds on the size of the first order contagion and testable conditions for it to be small. For power-law financial networks, we also give a condition so that the higher order cascade dies out.
- 19 February 2014
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 155 (1) , 72-92
Bootstrap Percolation in Power-Law Random Graphs
- 19 February 2014
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 155 (1) , 72-92
Bootstrap Percolation in Power-Law Random Graphs
- Top Cited PapersOpen Access
- 9 October 2013
- Published by Wiley in Mathematical Finance
- Vol. 26 (2) , 329-365
RESILIENCE TO CONTAGION IN FINANCIAL NETWORKS
We derive rigorous asymptotic results for the magnitude of contagion in a large counterparty network and give an analytical expression for the asymptotic fraction of defaults, in terms of network characteristics. Our results extend previous studies on contagion in random graphs to inhomogeneous‐directed graphs with a given degree sequence and arbitrary distribution of weights. We introduce a criterion for the resilience of a large financial network to the insolvency of a small group of financial institutions and quantify how contagion amplifies small shocks to the network. Our results emphasize the role played by “contagious links” and show that institutions which contribute most to network instability have both large connectivity and a large fraction of contagious links. The asymptotic results show good agreement with simulations for networks with realistic sizes.
- 9 October 2013
- Published by Wiley in Mathematical Finance
- Vol. 26 (2) , 329-365
Top Cited PapersOpen AccessRESILIENCE TO CONTAGION IN FINANCIAL NETWORKS
We derive rigorous asymptotic results for the magnitude of contagion in a large counterparty network and give an analytical expression for the asymptotic fraction of defaults, in terms of network characteristics. Our results extend previous studies on contagion in random graphs to inhomogeneous‐directed graphs with a given degree sequence and arbitrary distribution of weights. We introduce a criterion for the resilience of a large financial network to the insolvency of a small group of financial institutions and quantify how contagion amplifies small shocks to the network. Our results emphasize the role played by “contagious links” and show that institutions which contribute most to network instability have both large connectivity and a large fraction of contagious links. The asymptotic results show good agreement with simulations for networks with realistic sizes.
- Open Access
Bootstrap percolation in power-law random graphs
A bootstrap percolation process on a graph $G$ is an "infection" process which evolves in rounds. Initially, there is a subset of infected nodes and in each subsequent round each uninfected node which has at least $r$ infected neighbours becomes infected and remains so forever. The parameter $r\geq 2$ is fixed. Such processes have been used as models for the spread of ideas or trends within a network of individuals. We analyse bootstrap percolation process in the case where the underlying graph is an inhomogeneous random graph, which exhibits a power-law degree distribution, and initially there are $a(n)$ randomly infected nodes. The main focus of this paper is the number of vertices that will have been infected by the end of the process. The main result of this work is that if the degree sequence of the random graph follows a power law with exponent $\beta$, where $2 < \beta < 3$, then a sublinear number of initially infected vertices is enough to spread the infection over a linear fraction of the nodes of the random graph, with high probability. More specifically, we determine explicitly a critical function $a_c(n)$ such that $a_c(n)=o(n)$ with the following property. Assuming that $n$ is the number of vertices of the underlying random graph, if $a(n) \ll a_c(n)$, then the process does not evolve at all, with high probability as $n$ grows, whereas if $a(n)\gg a_c(n)$, then there is a constant $\eps>0$ such that, with high probability, the final set of infected vertices has size at least $\eps n$. It turns out that when the maximum degree is $o(n^{1/(\beta -1)})$, then $a_c(n)$ depends also on $r$. But when the maximum degree is $\Theta (n^{1/(\beta -1)})$, then $a_c (n)=n^{\beta -2 \over \beta -1}$.Open AccessBootstrap percolation in power-law random graphs
A bootstrap percolation process on a graph $G$ is an "infection" process which evolves in rounds. Initially, there is a subset of infected nodes and in each subsequent round each uninfected node which has at least $r$ infected neighbours becomes infected and remains so forever. The parameter $r\geq 2$ is fixed. Such processes have been used as models for the spread of ideas or trends within a network of individuals. We analyse bootstrap percolation process in the case where the underlying graph is an inhomogeneous random graph, which exhibits a power-law degree distribution, and initially there are $a(n)$ randomly infected nodes. The main focus of this paper is the number of vertices that will have been infected by the end of the process. The main result of this work is that if the degree sequence of the random graph follows a power law with exponent $\beta$, where $2 < \beta < 3$, then a sublinear number of initially infected vertices is enough to spread the infection over a linear fraction of the nodes of the random graph, with high probability. More specifically, we determine explicitly a critical function $a_c(n)$ such that $a_c(n)=o(n)$ with the following property. Assuming that $n$ is the number of vertices of the underlying random graph, if $a(n) \ll a_c(n)$, then the process does not evolve at all, with high probability as $n$ grows, whereas if $a(n)\gg a_c(n)$, then there is a constant $\eps>0$ such that, with high probability, the final set of infected vertices has size at least $\eps n$. It turns out that when the maximum degree is $o(n^{1/(\beta -1)})$, then $a_c(n)$ depends also on $r$. But when the maximum degree is $\Theta (n^{1/(\beta -1)})$, then $a_c (n)=n^{\beta -2 \over \beta -1}$. - Open Access
Shortest-weight paths in random regular graphs
Consider a random regular graph with degree $d$ and of size $n$. Assign to each edge an i.i.d. exponential random variable with mean one. In this paper we establish a precise asymptotic expression for the maximum number of edges on the shortest-weight paths between a fixed vertex and all the other vertices, as well as between any pair of vertices. Namely, for any fixed $d \geq 3$, we show that the longest of these shortest-weight paths has about $\hat{\alpha}\log n$ edges where $\hat{\alpha}$ is the unique solution of the equation $\alpha \log(\frac{d-2}{d-1}\alpha) - \alpha = \frac{d-3}{d-2}$, for $\alpha > \frac{d-1}{d-2}$.Open AccessShortest-weight paths in random regular graphs
Consider a random regular graph with degree $d$ and of size $n$. Assign to each edge an i.i.d. exponential random variable with mean one. In this paper we establish a precise asymptotic expression for the maximum number of edges on the shortest-weight paths between a fixed vertex and all the other vertices, as well as between any pair of vertices. Namely, for any fixed $d \geq 3$, we show that the longest of these shortest-weight paths has about $\hat{\alpha}\log n$ edges where $\hat{\alpha}$ is the unique solution of the equation $\alpha \log(\frac{d-2}{d-1}\alpha) - \alpha = \frac{d-3}{d-2}$, for $\alpha > \frac{d-1}{d-2}$.