Discrete default intensity based or logit type models are commonly used as reduced form models for conditional default probabilities for corporate loans where this default probability depends upon macroeconomic as well as firm-specific covariates.

Nisan gave an exact characterization of the ``non-commutative algebraic branching program (ABP) complexity'' of a polynomial in 1991.

Around a week ago, a group of researchers* proved that the randomized query complexity of f composed with g is lower bounded by the product of the randomized query complexities of f and g, albeit with suboptimal parameters.

During academic collaborations, we have different people working on a paper and the draft has a natural evolution. Most people are ok using a sync service like dropbox, or even just emailing tex sources to each other (gasp).

An individual is faced with several options while deciding to invest in a financial market. Some opportunities giving higher returns but carrying more risk while some being less risky and give lower returns.