Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
A finite bipartite graph of positive maximum degree has a matching in a graph covering every vertex of vertex degree . To cover the vertices of maximum degree in one side , apply Hall's marriage theorem to that subset: for each subset of it, double counting gives , where is its graph neighbourhood. Construct the corresponding matching in a graph for the other side, then use the union of two matchings to cover both specified subsets simultaneously.
If a finite graph has no isolated vertex, its minimum edge cover cardinality and matching number sum to its number of vertices.
Proof. Start with a maximum cardinality matching . Its unmatched vertices in a matching form an independent set, since an edge between two of them could be added. Add one incident edge for each such vertex. They are distinct, giving an edge cover of size .
Conversely, in any inclusion-minimal edge cover , every edge has an endpoint of vertex degree one in ; otherwise it could be removed. Thus each component is a star graph: two vertices of vertex degree at least two in one component would produce a graph path containing an edge with both endpoints of vertex degree at least two. If there are components, . Selecting one edge from each star graph gives a matching in a graph of size , so and . A minimum-cardinality edge cover is inclusion-minimal, completing the proof. The constructive first half also gives a polynomial-time algorithm once a maximum cardinality matching is available.
For a bipartite graph with bipartition and nonnegative integer bounds , a bipartite b-matching is an edge subset whose degree of a vertex is at most at each . Taking gives a matching in a graph. To maximize , build a flow network with arcs of flow network edge capacity for , arcs of flow network edge capacity one for , and arcs of flow network edge capacity for . The integral max-flow theorem gives an integral optimum. Select precisely the middle arcs with flow one. Flow conservation identifies their endpoint degrees with the outside arc flows, and the flow value is . Conversely, every such edge subset supplies a feasible flow of that value. This proves the reduction and its optimality.
Three players with positive integer holdings exchange a token by choosing an unordered active pair uniformly, then choosing the transfer direction fairly. Let be the conserved total, and the stopping time of the first elimination. Given holdings before , the conditional expectation of the change of their product is : transfers in each pair decrease the mean product by the third holding. Thus the displayed stopped process is a martingale. Its nonnegative product term gives , so the monotone convergence theorem first proves integrability of . The bounded product then vanishes by the dominated convergence theorem, yielding . Continuing the deterministic time term beyond elimination instead produces a submartingale.
Let , , and let be a binary random variable satisfying . Suppose is -measurable and is -measurable. The updateremains in and defines a bounded martingale. For example, take independent uniform random variables independent of the current filtration and set .
The binary identity givesand henceThe L2-bounded martingale convergence theorem gives a terminal random variable with almost sure convergence and convergence in L2. Iteration followed by the bounded convergence theorem yieldsThus takes only and , and preservation of its expected value gives a Bernoulli distribution with parameter . The terminal conditional expectation representation gives the exact mean squared errorThe finite-time paths can stay strictly inside while their limit lies entirely at the endpoints. The positive conditional variance in the interior makes permanent convergence to an interior value impossible.
An early interval of Martian geological history, identified by ancient cratered terrains and extensive records of aqueous alteration.
A Markov process following a deterministic flow of a vector field between random jumps, with jump hazard function and destination transition kernel . The integrated rate along the flowing path determines the next jump time. Retaining instead the holding times of a different piecewise-constant process need not yield a Markov process in the flowing state. Assume nonexplosion when describing paths at all finite times.
Use the mapping cylinder convention for . Its bottom copy of is a retract precisely when has a left homotopy inverse . A retraction restricted to supplies , and its values along the cylinder supply the homotopy from to . Conversely use that homotopy on the cylinder and on ; agreement at the attached end makes the map descend by the universal property of the quotient topology.
For an orthogonal decomposition , the squared norms add to the total norm. Refining one component into orthogonal subcomponents preserves its total weight by the Pythagorean theorem. In an Everettian account these weights are candidates for governing probabilities, rational credences or decisions; the algebra alone does not select which interpretive role is justified. Counting arbitrarily refined components is not the same measure.[ref]
Uncertainty about which observer-centred situation is one's own, even conditional on a known global wave function. An example is a post-measurement observer who has not yet consulted a decohered record. This proposal distinguishes uncertainty about the experienced record from randomness in the universal dynamics. A further argument is needed to connect its credences to branch weights; not every decision-theoretic Everettian account must interpret its weights as ignorance of a uniquely selected future branch.
A strong surface thermal boundary layer largely immobile relative to convecting material beneath it. Local volcanism and occasional foundering can still occur.
A regime in which surface lithosphere participates substantially in overturn and horizontal motion. Additional organization into long-lived plates and narrow boundaries is needed for a close analogue of plate tectonics.
A mantle plume is a localized buoyant upwelling in a planetary mantle. Hot material can rise because thermal expansion lowers its density relative to its surroundings; compositional differences may strengthen or oppose that buoyancy. As it rises and decompresses, it can cross a rock's solidus and produce melt without requiring heat to be added during ascent.
A volcanic chain, a broad topographic swell or a seismic anomaly can motivate a plume interpretation, but they measure different consequences. Plate motion, background mantle flow, melt transport and crustal structure influence the surface expression. A plume hypothesis is tested by combining those observations rather than reading a unique source depth from a hotspot's position.
An energy balance for heat stored in the mantle. Here is its effective heat capacity, internally generated radioactive power, power entering across the core-mantle boundary and power leaving the mantle. The sign of the right-hand side determines warming or secular cooling in this reduced model. Different reservoirs and latent heat may require additional terms. Surface heat loss includes crustal contributions and should not be substituted for without specifying the partition.
The buoyancy of the mantle beneath a descending slab. Thermal, compositional or melt-related density anomalies can modify pressure and traction on the slab, potentially changing its contact with the overriding plate. It differs from the slab's own slab buoyancy. Inferring it from low seismic velocities requires independent constraints because temperature, fluids, melt and composition can produce overlapping signatures.
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





