• 検索結果がありません。

Recent site activity Naoki Wakamori's Website

N/A
N/A
Protected

Academic year: 2018

シェア "Recent site activity Naoki Wakamori's Website"

Copied!
62
0
0

読み込み中.... (全文を見る)

全文

Loading

Figure 1. Number of bank failures over time. This figure plots the time series of bank fail- fail-ures irrespective of resolution method—purchase and assumption (P&A) transaction, deposit payoff, or insured deposit transfer—during the period 1994 to 20
Figure 2. Kernel density of FDIC resolution costs. The figure in Panel A plots the Epanech- Epanech-nikov kernel density of the total resolution costs (dashed line) incurred by the FDIC in the  res-olution of failed banks since 2007
Table II
Figure 3. Failed bank sales and geographical proximity. This figure plots the share of failed banks (as a percent of total failed banks during the sample period) that were assumed by potential acquirers in each of 20 distance bins
+7

参照

関連したドキュメント

In analogy with the distance between two continuous affine maps, we will construct a metric to evaluate the distance between two metric jets: fixing a pair of points (a and a 0

This means that finding the feasible arrays for distance-regular graphs of valency 4 was reduced to a finite amount of work, but the diameter bounds obtained were not small enough

He thereby extended his method to the investigation of boundary value problems of couple-stress elasticity, thermoelasticity and other generalized models of an elastic

Compactly supported vortex pairs interact in a way such that the intensity of the interaction decays with the inverse of the square of the distance between them. Hence, vortex

Kilbas; Conditions of the existence of a classical solution of a Cauchy type problem for the diffusion equation with the Riemann-Liouville partial derivative, Differential Equations,

Here we continue this line of research and study a quasistatic frictionless contact problem for an electro-viscoelastic material, in the framework of the MTCM, when the foundation

Theorem 1. Tarnanen uses the conjugacy scheme of the group S n in order to obtain new upper bounds for the size of a permutation code. A distance that is both left- and right-

Applications of msets in Logic Programming languages is found to over- come “computational inefficiency” inherent in otherwise situation, especially in solving a sweep of