Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
A latent factor is an unobserved coordinate introduced to explain shared variation among measurements. In an orthogonal factor model, latent factors have variance one and are mutually uncorrelated, with coefficients specified by the factor loadings. They differ from a regression factor, which is a categorical predictor. A fitted covariance alone generally leaves the latent factor orientation undetermined; factor rotation gives equivalent representations.
For a finite connected graph embedded as a plane graph, follow the edges around a face of a plane graph to obtain a closed walk. Count traversals, not distinct edges: a bridge in a graph occurs twice along one facial boundary walk. Each edge contributes two sides in total.[ref]
Mathematics for Computer Science by Eric Lehman and others. Mathematics for Computer Science, §12.4, Lemma 12.4.1, printed p. 485
For the three-vertex graph path , the only facial boundary walk is , of length four. Both edges are bridges in a graph; neither is a graph cycle. Thus a facial boundary walk need not be a graph cycle.
The outer face is the unique unbounded face of a plane graph for a finite plane graph. It counts once even though it surrounds the whole graph drawing. A tree has only this face of a plane graph.
For the threading convention and , contract with . Metric compatibility gives , and the Jacobi determinant derivative formula gives . With zero shift, is the local volume Hubble parameter. Reversing the shift convention reverses both the normal's spatial component and the shift terms; the two conventions must not be mixed.
For a compact regular locale , put and . This locale is extremally disconnected. Its natural surjection to has inverse imageThe Joyal extension lemma gives the frame homomorphism; its injectivity follows by recovering as the join of the regular opens in this ideal.
Map two disjoint walking arrows to the two mutually inverse arrows of the walking isomorphism. Their images generate the entire target, so the functor is an extremal epimorphism. Its kernel pair only identifies the matching endpoint objects, not the inverse-composition relations. Mapping both arrows to a nonidentity idempotent in a one-object category equalizes that kernel pair but cannot factor through the target groupoid. Thus the functor is not a regular epimorphism, although the category of small categories has finite limits.
The characteristic map of a subdivision surface is the planar limit map obtained from the two independent tangent eigenvectors of its local subdivision matrix. In the usual stationary setting, a simple constant eigenvalue one, a semisimple double subdominant eigenvalue , strictly smaller other eigenvalues, and a regular injective characteristic map establish the standard tangent-plane behavior for nondegenerate data. The eigenvalue inequalities alone do not exclude a folded or singular characteristic map. For an alternating scheme these tests must use a full period of refinement.
The Lie product formula extends from matrices to any finite-dimensional Lie group. In a local exponential chart, smooth multiplication and its differential give . Taking and using the one-parameter subgroup identity shows that the th power is , proving the displayed limit. This proof needs only the first-order expansion, rather than convergence of the full Baker--Campbell--Hausdorff formula.
The Exponential map of a Lie group is a group homomorphism from the additive Lie algebra exactly when its identity component of a Lie group is abelian. If it is additive, its image is an abelian subgroup containing an identity neighborhood by the local exponential chart; connectedness makes that image the entire identity component. Conversely, in an abelian identity component the product is a one-parameter subgroup with derivative , giving the identity by uniqueness. The disconnected Lie group shows that the full group need not be abelian.
The interval required to double a quantity under constant-rate exponential growth. Solving with the natural logarithm gives . At per time unit, it is approximately time units; every subsequent doubling takes the same interval.
For an exponential dispersion family with a common dispersion parameter , scaled deviance compares a fitted model with the saturated statistical model at the same dispersion:For a normal distribution with variance , unscaled deviance is the residual sum of squares and scaled deviance is that sum divided by . For the binomial distribution, and the two coincide. Unknown Gaussian dispersion requires variance estimation; raw deviance differences should not be treated as chi-squared statistics without the scale.
For an impulsive leaky porous gravity current, write and , where . At a fixed lateral location, when . The maximum invaded thickness is the envelope , . The source solution is singular at the initial line release; finite source size and aquifer depth limit its near-source validity.
For independent exponential random variables with the same rate , the convolution density of is for . The cumulative distribution function of is , whose derivative is the same density. This is equality of probability distributions, not an almost-sure equality of the two expressions formed from the same sample.
Let be a fixed sum of independent exponential random variables with smallest rate , and let be the sum of independent rate- exponential random variables, independent of , with fixed and . At large-deviation speed , has rate function for ; the sample mean has rate function for . The product large-deviation principle and contraction principle for large deviations giveIndeed the derivative of the quantity minimized with respect to is . Its minimizer is . Beyond that transition, a single slow exponential random variable carries the extra excursion; the rate function becomes affine.
An order-one exponential dispersion family has a scalar natural parameter and canonical sufficient statistic ; its density or mass function has the displayed form on parameter-independent support. Differentiating its normalization gives and . Known observation weights replace by . Its variance function is , and its canonical link function is .
For an affine autoregressive process , suppose its initial zero-coupon bond prices are positive and finite. A deterministic shift of the rate changes the bond price to . To fit any positive curve with , put , , and . Adding the deterministic drift to the rate recursion realizes precisely this shift, and telescoping gives the desired curve. No stationary autoregression assumption is needed.
A utility indifference price for a claim is the cash amount at which optimally buying the claim leaves the investor with the same maximal expected utility as trading without it.
For an increasing strictly concave utility function satisfying the Inada conditions, put and let be the positive terminal state-price density. In a finite complete market, select so that equals initial wealth. The displayed payoff is optimal under that budget: the supporting-line inequality for utility has marginal slope , and its expected linear error vanishes on the budget constraint. Market completeness supplies its replicating strategy.
If a positive terminal state-price density has essential infimum zero, let and . Whenever , these claims cost and satisfy . In a Brownian complete market with constant nonzero market price of risk, has a lognormal distribution and all these events have positive probability. Thus bounded market coefficients and an increasing concave utility do not alone ensure a finite attained optimum: the linear utility already fails. Usual inverse-marginal-utility formulas require further utility and integrability hypotheses.
Pinned article: Introduction to the OurBigBook Project
Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
Intro to OurBigBook
. Source. We have two killer features:
- topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculusArticles of different users are sorted by upvote within each article page. This feature is a bit like:
- a Wikipedia where each user can have their own version of each article
- a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.Figure 1. Screenshot of the "Derivative" topic page. View it live at: ourbigbook.com/go/topic/derivativeVideo 2. OurBigBook Web topics demo. Source. - local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.Figure 5. . You can also edit articles on the Web editor without installing anything locally. Video 3. Edit locally and publish demo. Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension. - Infinitely deep tables of contents:
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact





