For the standard normal density, . Using integration by parts,
The boundary term vanishes because Gaussian decay dominates every power. Since the given mean is zero and variance is one, , yielding the Gaussian fourth moment
Write . Its cube roots have modulus two and arguments , for . Thus
Each cube equals , and a cubic polynomial has no further distinct roots.
The number has modulus one and argument modulo . Therefore its complex logarithm has values
Every value has real part zero. For the principal complex logarithm, choose the unique integer giving imaginary part in . The unwrapped value is the principal imaginary part only when it already lies in that interval.
A day's admission count is a Poisson random variable with mean three. “Less than three” includes zero, one and two, so
Thus the probability is about .
For centred data, classical multidimensional scaling from Euclidean distances constructs the observation Gram matrix
where . By part (i), its nonzero eigenvalues agree with those of , the matrix used for principal component analysis before dividing by a covariance normalization.
If is the unit observation-space eigenvector, the corresponding classical multidimensional scaling coordinate column is
That is exactly the column of principal component scores. Consequently classical multidimensional scaling of Euclidean pairwise distances recovers the same reduced coordinates as principal component analysis, up to signs and arbitrary orthogonal transformations within equal-eigenvalue subspaces. Distances alone cannot fix translation or orientation. The equivalence presumes centred data and Euclidean distances; general dissimilarities need not yield a positive semidefinite Gram matrix or a corresponding data covariance matrix.
The premise contains a wording error: must be a nonzero eigenvalue, rather than a nonzero eigenvector. Let satisfy
Then , since otherwise would force . Multiplying by gives
Thus , with eigenvector . Conversely, applying maps an eigenvector of with nonzero eigenvalue to one of .
These maps are inverses up to the factor on the corresponding eigenspaces, so the nonzero eigenvalues have equal multiplicities. Their zero eigenvalues need not have the same multiplicity because the two matrices can have different sizes. For a unit eigenvector and real , the normalized partner is , since .
For the Barabási-Albert model, choose a connected seed graph on vertices, the number of new edges per added vertex, and a final size . A complete seed with suffices. Add one vertex at a time, attaching it to distinct existing vertices selected with weights proportional to their current vertex degrees. Exclude duplicate edges and self-loops.
Increasing creates a larger network and permits older hubs to grow. Increasing makes the graph denser, with asymptotic average vertex degree , and tends to shorten graph distances. The seed affects early structure and the oldest hubs; standard linear preferential attachment gives a robust large-size tail exponent.
Its asymptotic degree distribution is , so it is a scale-free network. Hubs produce short average shortest path length, but elevated clustering coefficients are not automatic: with a tree seed gives a triangle-free tree, and clustering decreases with size in the standard model. The strict clustered small-world network property is therefore not guaranteed.[ref]
For the Watts-Strogatz model, choose vertices on a ring, an even initial vertex degree , and a rewiring probability . Connect each vertex to its nearest neighbours on each side. Consider each original clockwise edge once: with probability , retain its starting endpoint and replace its other endpoint uniformly, excluding self-loops and duplicate edges. The edge count remains , although individual vertex degrees change.
Increasing at fixed lengthens unrewired-ring graph distances. Increasing adds edges and shortens distances. Increasing introduces shortcuts, sharply reducing average shortest path length at first, then progressively reducing the clustering coefficient by destroying local triangles.
The small-world network regime occurs at intermediate with sufficient shortcuts, substantial clustering, and . At distances are long; near the clustering advantage disappears. The degree distribution remains concentrated around , so this is not a scale-free network.[ref]
For the Erdős-Rényi model , choose the number of vertices and an edge probability . Visit every unordered pair of distinct vertices once and include its edge independently with probability . This construction gives a simple graph with expected edge count and mean vertex degree .
Increasing at fixed makes the graph denser, increases typical vertex degree and local clustering coefficient, and tends to shorten graph distances and improve connectivity. Increasing at fixed also increases the mean vertex degree; to retain a sparse comparison one instead decreases approximately as .
Its degree distribution is binomial distribution, approximately Poisson distribution in the sparse large- regime, so it is not a scale-free network. Connected realizations can have short average shortest path length, but their clustering coefficients are not elevated above the random baseline they themselves define. Thus they are not small-world networks under the high-clustering convention, although “small world” is sometimes used more loosely to mean only short distances.
For a haploid population with possible parents, each pair of ancestral lineages merges backward at rate in the Kingman's coalescent approximation. With lineages there are pairs. Hence the mean phylogenetic epoch duration is
Thus , and . For an autosomal sample from diploid individuals, replace the number of gene copies by , giving . A mitochondrial sample naturally uses a haploid maternal effective population size; the common factor cancels in the ratios below.
In the Yule process, each of branches gives birth independently at rate per generation. The next birth therefore has total rate . Its waiting time has an exponential distribution, so the mean phylogenetic epoch duration is
For the ensuing calculation use , and . This is the inter-event waiting-time convention requested in the question, including an observation interval with four branches. Stopping the forward process immediately when the fourth branch is born would instead leave a zero terminal interval and describe a different sampling convention.
On a logarithmic strength–density materials selection chart, constant gives , a guideline of slope one; constant gives , of slope two. Moving each guideline upwards selects better candidates. A suitably qualified longitudinal carbon-fibre-reinforced polymer is a promising candidate for both designs. Composite families occupy favourable high-strength/low-density regions in published course selection charts, but a beam must meet its compressive as well as tensile allowable.[ref]
For scale, an explicitly illustrative candidate with in both required loading senses and would have and , exceeding the best supplied materials. These are assumed screening values, not measured properties of a specified product.
Figure 1.
Strength–density selection with the two cantilever merit-index guidelines
. Original chart of the three supplied candidates and one explicitly assumed composite design point. Pine uses its compression limit; the figure is not a complete material-family database. Details.

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!
We have two killer features:
  1. 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-calculus
    Articles 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/derivative
  2. 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.
    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.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
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