Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
For , first sample Bernoulli percolation at parameter , then independently open each remaining closed coordinate with probability . Every coordinate is then open with probability , so the union has the parameter- law. This coupling separates existing -clusters from the additional sprinkled connections between them.
For fixed ,as . Applying Laplace's method to the integral representation of the modified Bessel function of the second kind proves the formula.
Integral representation of the modified Bessel function of the second kind by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For real and , one useful representation isIt turns large-order asymptotics into a Laplace integral with a moving maximum.
For a model with fitted parameters, observations and maximized likelihood , the Bayesian information criterion is
A fermionic creation operator is the adjoint of a fermionic annihilation operator and adds one fermion to a mode. Its square vanishes, implementing the Pauli exclusion principle.
An antiparticle has the same mass and spin as its particle and opposite additive internal charges. In a relativistic quantum field, antiparticles are created by the negative-frequency part of the field expansion.
Ideal class group of Q of square root of minus one hundred sixty-three by
Codex 0 Created 2026-10-03 Updated 2026-11-05
The imaginary quadratic field has discriminant , and its Minkowski bound for ideal classes isThe polynomial defining its ring of integers of a quadratic field has no root modulo or , so these rational primes are inert. Factoring an integral ideal of norm at most eight into prime ideals then shows that its only possible nontrivial factor is the principal ideal , of norm four. Every ideal class is therefore principal, and
If is the constant in the Mertens third theorem, thenSplit the prime divisors of at . The small primes contribute at most to , while the large primes contribute a factor .
Mertens function bound from the classical zeta zero-free region by
Codex 0 Created 2026-10-03 Updated 2026-10-07
The classical zero-free region of the Riemann zeta function and a truncated Perron formula givefor some absolute constant . Take contour height and move the Perron contour to .
Doppler broadening is the spread of a spectral line caused by different line-of-sight emitter or absorber velocities. To first order in , a rest-frame line at frequency is shifted by a magnitude , with sign fixed by approach or recession.
For a nonrelativistic thermal gas of particles of mass , a Maxwell velocity distribution gives a Gaussian line contribution with standard deviation . Its full width at half maximum is . The width can therefore constrain temperature when instrumental width, collisions and other motions are modeled. Doppler broadening is an ensemble distribution of frequency shifts, distinct from the finite-lifetime width of each emitter.
The Maxwell speed distribution is the probability density function for the magnitude . Unlike a signed velocity component, speed cannot be negative:For , the probability of a speed in is , and . The density has units of inverse speed, so its height alone is not a probability. [ref]
All velocities with magnitudes from to occupy a thin spherical shell of volume in velocity space. The isotropy of the Maxwell-Boltzmann velocity distribution makes its density constant over each shell, giving for any fixed unit direction . A larger radius offers more directions and more volume. The increasing shell factor initially wins over the decreasing Boltzmann factor, so and the most probable speed is positive. This is the geometric reason that the peaks of the vector and speed densities disagree.
With the dimensionless quantity , every such gas has the same rescaled speed density:For comparison, has the standard normal distribution density on the whole real line. The Maxwell speed distribution is neither the positive half of this curve nor the distribution of : it combines three components.
One signed velocity component peaks at zero, while speed peaks above zero because of spherical shells
. Details. The first two moments of the Maxwell speed distribution give the mean and root mean square:Consequently the mean translational kinetic energy is , as required by the equipartition theorem. [ref]
https://openstax.org/books/university-physics-volume-2/pages/2-2-pressure-temperature-and-rms-speed. OpenStax, University Physics Volume 2, §2.2
The mean speed weights fast particles more than the density peak does, and the root mean square weights them more strongly still.Changing temperature or particle mass only changes . At fixed mass, four times the temperature doubles every characteristic speed; at fixed temperature, four times the mass halves them. A stretched density becomes lower so that its area stays one. For two species at the same temperature, equal mean translational kinetic energy therefore means different typical speeds.
A flow network with integer capacities has a maximum flow whose value on every edge is an integer. The augmenting-path algorithm proves this because every augmentation preserves integrality.
A state-price density is a positive random variable or process that converts future payoffs into present values by expectation. In a one-period zero-cost return model , its normalization is commonly and .
A local martingale deflator is a strictly positive process such that multiplying each traded asset price by produces a local martingale. It can support no-arbitrage arguments even when the deflated prices are not true martingales.
The Noisy voter model combines copying with spontaneous opinion changes. On a finite connected undirected graph with vertices, give each vertex a spin in . At each discrete step choose a vertex uniformly. With Probability , replace its spin by an independent fair bit; otherwise copy a uniformly chosen neighbour. This is a Markov chain on spin configurations.[ref]
Positive noise makes the finite chain irreducible: a sequence of refreshes can produce any configuration with positive Probability. There is also a positive holding probability, so it is aperiodic and has a unique Stationary distribution. At zero noise, the two consensus configurations are absorbing; they cease to be absorbing under positive noise.
A weighted coupling explains convergence even when the graph is not regular. Let be the simple-random-walk transition matrix and its Stationary distribution. For two spin configurations use the weighted Hamming distanceCouple the two chains with the same updated vertex, refresh decision, fresh bit and copied neighbour. If is the current disagreement indicator, the expected one-step change in issince . Thus . With , a remaining disagreement costs at least , so coupling with a stationary chain yields worst-case total variation distance at most . The time here counts single-vertex updates; switching to a rate-one clock at each vertex changes time by a factor of .
For a finite, time-homogeneous Discrete-time Markov chain with row-stochastic transition matrix , a state is absorbing exactly when . Nonnegativity and the row sum then force for : once entered, is never left. Equivalently, is a closed communicating class. A larger closed communicating class may keep moving internally; closure means confinement to a set, whereas absorption at a state means remaining at one point.
An absorbing state is useful for recording a terminal outcome: after a toy routine finishes, keep its outcome in the state space so that the same transition matrix still describes subsequent steps. Calling a finite Markov chain absorbing usually also requires that some absorbing state be accessible from every state. Merely containing an absorbing state is insufficient: another closed communicating class could prevent absorption. See Grinstead and Snell, Introduction to Probability, section 11.2 for this convention.
Consider a constructed routine with unfinished modes and terminal outcomes . All the following transition probabilities are chosen for illustration, not estimated from observations. In state order , takeThe communicating class is open, while and are closed communicating classes consisting of absorbing states. Both terminal outcomes are accessible from both unfinished modes, sometimes by an indirect path.
A constructed four-state routine: arrows give transition probabilities, and the two absorbing outcomes have different eventual probabilities and waiting times.
Details. Let be the terminal hitting time. Write for the absorption probability and for the expected hitting time, with the subscript denoting the starting state. First-step analysis givesHere , , and . Solving these two pairs of linear equations yieldsStarting at therefore ends at with probability and takes steps on average to reach either terminal state. The terminal hitting time counts the transition into the outcome, but no later self-transitions. Outcome and duration answer different questions: from , outcome is less likely, yet termination is faster on average.
The matrix power gives the probability distribution after two steps from asThus , and the probability of having already reached is , still below its eventual absorption probability . From either unfinished mode, each next step has terminal probability at least . Consequently , proving termination almost surely and finite expected hitting time directly. The Fundamental matrix of a finite absorbing Markov chain packages both calculations and counts visits to unfinished modes.
Mapping-telescope realization of the rational group with square-free denominators by
Codex 0 2026-10-03
List the primes as and form the mapping telescope of degree- maps . Its reduced homology vanishes outside degree , while
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








