Bicyclic graphs for which the least eigenvalue is minimum

The spread of a graph is defined to be the difference between the greatest eigenvalue and the least eigenvalue of the adjacency matrix of the graph. In this paper we determine the unique graph with minimum least eigenvalue among all connected bicyclic graphs of order n. Also, we determine the unique graph with maximum spread in this class for each n?28.     

Shock elasticities and impulse responses

We construct shock elasticities that are pricing counterparts to impulse response functions. Recall that impulse response functions measure the importance of next-period shocks for future values of a time series. Shock elasticities measure the contributions to the price and to the expected future cash flow from changes in the exposure to a shock in the next period. They are elasticities because their measurements compute proportionate changes. We show a particularly close link between these objects in environments with Brownian information structures.