Let , and for put
Each edge cutset separates from . Adjacent vertices have graph distances from differing by at most one. Hence an edge can cross at most one of these level boundaries, so the edge cutsets are pairwise edge-disjoint. Write ; then .
The Nash-Williams inequality for unit conductances gives
where the middle inequality is the Cauchy-Schwarz inequality. One can also derive the first inequality directly: every unit flow has signed net flux one through each , so its energy of a flow on that cut is at least ; sum over the disjoint cuts and use the Thomson principle.
Combining with the commute time identity yields
The case is trivial. A path graph, with its endpoints, attains equality.
Choose a spanning tree of , rooted at . A depth-first traversal of a tree gives a deterministic closed walk
that traverses each edge of once in each direction and visits every vertex. Define stopping times and
The simple random walk is at at time . All these hitting times have finite mean on the finite connected graph. By the Strong Markov property,
The cover time is no larger than . Grouping the summands by the two traversals of each tree edge and applying the commute time identity gives
The effective resistances are measured in the original graph, where each tree-edge pair is adjacent. Part (a) therefore bounds every summand by one, so
For the one-vertex graph, the cover time is zero and the same bound is immediate.
The Thomson principle states that the effective resistance is the minimum energy of a flow among all unit flows from to :
The flow is antisymmetric on oriented edges, and the sum counts each unoriented edge once. The Rayleigh monotonicity principle states that increasing edge resistances, including deleting edges by setting their resistance to infinity, cannot decrease the effective resistance. Decreasing resistances or identifying vertices cannot increase it.
Take a shortest path in a graph from to , of length , and send one unit of flow along it, with zero flow on all other edges. Its energy of a flow is because each edge resistance is one. The Thomson principle gives
Alternatively, delete all edges outside that path and use the Rayleigh monotonicity principle; the remaining edges are in series, with total resistance . When , both quantities are zero.
Declare an edge of the planar dual graph open exactly when its crossed primal edge is closed. This dual bond percolation has parameter , using the Harris-Kesten theorem. We use the standard exponential tail of subcritical cluster size: for some , uniformly in the dual vertex ,
This is decay of the number of vertices in the percolation cluster, not merely its radius.
On , the geometric fact allowed in the paper supplies a simple dual cycle in a graph surrounding , with length . Every crossed edge is in the edge boundary of and is therefore closed, so the dual cycle is open. Its distinct vertices lie in one dual percolation cluster of size at least .
A dual cycle in a graph of length surrounding the origin has all its vertices within sup-norm distance of the origin: its coordinate spans are at most , and the origin lies between each pair of extreme coordinates. There are at most possible dual vertices there. The union bound over lengths and possible vertices yields
for some , since a polynomial factor can be absorbed into a slower exponential decay.
To remove the constant prefactor for all , first choose so that the bound is at most for . For the remaining finitely many , use and choose
For , the chosen ensures .
For , let be the set of vertices of connected to by an open path in a graph using only edges of . Every infinite-cluster vertex of belongs to , by stopping an infinite open path in a graph at its first boundary visit. Hence the increasing event
has probability at least by part (a). Importantly, depends only on the edges with both endpoints in .
Open all perimeter edges joining successive vertices of . They form a cycle in a graph, and opening them joins every vertex of into one percolation cluster, containing the specified perimeter vertex . The Harris-FKG inequality bounds the probability of this event together with below by .
Close all edges in the edge boundary of . These edges are distinct from the internal edges already considered, so their states are independent of those events. The resulting percolation cluster of is finite, contained in , and has at least vertices. Therefore, by translating to the origin,
For , choose . Then the threshold is at least , and . Put and ; both are positive. The preceding lower bound is at least with, for example,
The construction modifies only order- boundary edges while trapping order- vertices, which explains the stretched exponential scale. Here is interpreted as the positive integers; the proposed lower bound at would be false because .
Write and . By translation invariance and linearity of expectation,
Let . Since , splitting the expectation at the threshold gives
Rearranging produces the slightly stronger estimate
Only the mean and boundedness of the random variable are used; independence of the vertex-membership events is unnecessary.
For bond percolation, the Harris-FKG inequality states that any two increasing events satisfy
The same inequality holds for two decreasing events, either by reversing the coordinate order or by taking complements in the two-event identity. Intersections of decreasing events are decreasing events, so induction gives
Write and . Then . Taking the nonnegative -th root and rearranging yields the square-root trick for positively associated events:
No independence among the events is needed.
Consider a triangle of three links, each with capacity . Calls for each pair of its three nodes arrive as independent Poisson processes at rate and have independent holding times with an exponential distribution of mean one. Try the direct link first; if it is full, try the two-link path through the third node; if either alternative link is full, reject the call. This is alternative routing in a loss network.
In the symmetric Erlang fixed point approximation, let be each link's blocking probability. A given link receives direct offered traffic . Each of the other two call types contributes overflow traffic , screened by the availability of the other link on its alternative path. Thus
The extra term expresses a feedback: blocking sends calls onto longer paths, which consume more total capacity and can create still more blocking.
Here is an explicit finite-capacity example, not just a limiting argument. Take and , and let . Evaluating the Erlang loss formula gives
The displayed decimals are rounded, but the four signs can be checked exactly using the rational recursion , . By the intermediate value theorem, there is a fixed point in each of , , and . Numerically these three are
Thus alternative routing can produce multiple Erlang fixed points. This does not imply multiple stationary distributions for the exact finite continuous-time Markov chain, which is irreducible and has a unique stationary distribution; the multiplicity belongs to the approximation. The symmetric alternative-routing model is also discussed in Kelly's review of fixed point models of loss networks.
First consider unit requirements, . The Erlang loss formula for a resource with capacity and offered traffic is
The Erlang fixed point approximation assumes that resources block independently and that the traffic retained after screening at other resources can be treated as a Poisson process. If is the approximate blocking probability and , the reduced-load approximation gives
The link whose load is being calculated is excluded from the screening product. Otherwise one would confuse its offered load with its carried load.
For existence, these equations define a continuous map from into itself. The Brouwer fixed-point theorem gives a fixed point. Assume ; a zero-capacity resource forces rejection of every call needing it and can be removed together with those call types.
For uniqueness, let have probabilities proportional to , , and write . Direct differentiation gives
These identities hold for , and . Also increases from zero to one and increases from zero to .
Put . Define by , and define . This is a continuous, strictly increasing function on , starting at zero and tending to . Multiplying each Erlang fixed point approximation load equation by transforms it into
These are exactly the zero-gradient conditions of
Each integral is a strictly convex function; the exponential terms are convex functions. Thus is a strictly convex function. It is also a coercive function, since , so it has a unique minimizer. At , its partial derivative is negative if some positive-traffic route uses , so that coordinate of the minimizer is positive. If no route uses , the unique minimizing coordinate is zero. The minimizer therefore satisfies the equations in every coordinate. Conversely any fixed point has , finite , and these zero-gradient equations, so must equal that unique minimizer. Hence the Erlang fixed point approximation exists and is unique for fixed routing.
For integer requirements, the common generalized Erlang fixed point approximation uses
Multiplication by gives the same equations for , so the existence and uniqueness argument also covers this generalized approximation. It remains an approximation, rather than the exact blocking law for a call requesting several units.
A loss network models calls that require several resources simultaneously and are rejected if any required capacity is unavailable; rejected calls do not queue. For fixed routing, let be the number of units of resource used by a call of type , and let be its capacity. Independent Poisson processes supply type- calls at rate , with independent holding times having an exponential distribution of mean . Write for the offered traffic, and
Assume finitely many resources and call types, with every call using a resource, so this set is finite. The occupancy continuous-time Markov chain has rates
Its stationary distribution is
Indeed, for each feasible upward transition,
which is detailed balance for a continuous-time Markov chain. Thus this is a reversible Markov chain. With positive arrival rates it is irreducible on : departures reach the empty state, and any feasible state can be assembled by arrivals. Its stationary distribution is consequently unique.
The formula is a product-form stationary distribution of a loss network: equivalently, independent Poisson random variables of means conditioned on . The conditioning couples the occupancies, so the resources are generally not independent. By Poisson arrivals see time averages, the acceptance probability for a type- arrival is
because the prearrival state must leave free units at each resource. Set the numerator to zero if its capacity vector has a negative entry. This exact formula is often expensive to evaluate, which motivates the Erlang fixed point approximation.
The same occupancy stationary distribution extends to independent general holding-time distributions with these means by insensitivity of loss networks; the exponential assumption above makes the occupancy process itself a continuous-time Markov chain and permits the direct detailed balance proof.
With constant coefficients, is constant, so the stochastic exponential is a true martingale. Under its equivalent martingale measure , the stock follows the Black-Scholes model . The Gaussian exponential moment gives the value of the power option
The option delta is , so the replicating strategy holds
Half the wealth value is in the stock and half in the bank account, with continuous rebalancing. To check the self-financing portfolio property under the original measure, the Itô formula gives . Also and .
The payoff is unbounded, so the bounded-payoff restriction of part (c) is not invoked automatically; the Black-Scholes model has the necessary finite Gaussian moments, and the explicit strategy attains . The supermartingale bound from part (b) therefore proves its minimality. The cost is independent of the physical drift .
Fix the maturity horizon. Since is a nonnegative local martingale and is bounded, : and . The bounded nonnegative payoff thus makes integrable. Set
The Brownian martingale representation theorem yields , using its locally square-integrable version for an integrable terminal random variable. The Itô formula for gives
Choose the replicating strategy
Its self-financing portfolio equation has exactly the displayed drift and diffusion, because . All coefficients are locally integrable after stopping; the holdings are predictable in the augmented natural Brownian filtration. This construction has and , so it is an admissible replicating strategy under the question's nonnegative-wealth convention.
For any other nonnegative self-financing portfolio replicating the same payoff, part (b) implies . The constructed strategy attains equality, since and in the augmented natural Brownian filtration. Hence
This is deflator-based claim replication; it does not require upgrading the local martingale deflator to a true martingale density.
Let and be the predictable holdings of the stock and the bank account. With no consumption, the self-financing portfolio has and . The Itô product rule, together with the dynamics from part (a), gives
The drift vanishes because and . Thus is a local martingale. It is nonnegative by the assumed nonnegative wealth and strict positivity of , and hence
For example, this last fact follows directly from Conditional Fatou lemma applied to a localizing sequence; the initial capital is assumed finite. As usual, holdings must be integrable against the asset semimartingales for the self-financing portfolio equation to be defined.
Use positive initial asset prices and the usual augmentation of the natural Brownian filtration. Define the market price of risk
Continuity and strict positivity of imply on every finite horizon almost surely, because each path has a positive minimum of there. Hence the strictly positive stochastic exponential
is defined and has and . The Itô product rule gives
so it is a local martingale deflator.
For uniqueness, let be any normalized strictly positive local martingale deflator. The Brownian martingale representation theorem makes a continuous local martingale with a Brownian motion integral representation. Dividing by therefore gives . The vanishing drift of requires , so . This scalar linear stochastic differential equation has exactly the exponential solution above, proving the normalized local martingale deflator is unique.
The assumptions do not make deterministically bounded: need not be bounded away from zero uniformly over outcomes. Thus a true martingale density or Novikov condition is not inferred here; the required conclusion is local.
Assume the usual positive initial stock price and strike, so the logarithm is defined, and interpret as a classical solution of the displayed partial differential equation. For a fixed complex , put , defining . The Itô formula for the two Brownian motions with correlation coefficient gives
The partial differential equation cancels the entire drift. By the permission to treat the resulting local martingales as true martingales, and the terminal condition, .
The bounded spot volatility ensures : the Itô formula for a real power and localization bound its moment by . Rewrite the proposed integrand as
Now , an integrable bound independent of . Conditional Fubini's theorem and part (b) therefore imply
This route justifies the contour exchange without assuming bounds on uniform in all complex . Cash is constant, is a true martingale under the stated allowance, and the displayed is a true martingale. The original measure is thus an equivalent martingale measure for all three assets. The fundamental theorem of asset pricing gives the market has no arbitrage under the usual admissible trading convention.
Set . Since and is integrable over , the proposed contour integral is absolutely convergent. The same bound justifies the Fubini's theorem when substituting :
The last equality uses the contour identity provided in the original PDF. Consequently
This is contour inversion for call prices. The supplied TeX corrupts the permitted identity into a reciprocal and drops the imaginary units from its endpoints; the PDF has and the vertical contour used above.
For a fixed realization and , direct integration gives
To interchange the integral and expectation, write and estimate
The Fubini's theorem now proves the Mellin transform of call prices identity
The required exponential moment is at the chosen real part; the assertion for every presupposes these exponential moments for every such .

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