A computing method of fractional Bayes factor (FBF) for a point null hypothesis is explained. We propose alternative form of FBF that is the product of density ratio and a quantity using the generalized Savage-Dickey density ratio method. When it is diicult to compute the alternative form of FBF analytically, each term of the proposed form can be estimated by MCMC method. Finally, two examples ...

We propose the use of the generalized fractional Bayes factor for testing fit in multinomial models. This is a non-asymptotic method that can be used to quantify the evidence for or against a sub-model. We give expressions for the generalized fractional Bayes factor and we study its properties. In particular, we show that the generalized fractional Bayes factor has better properties than the fr...

We say that a simple graph G is fractional independent-set-deletable k-factor-critical, shortly, fractional ID-k-factor-critical, if G− I has a fractional k-factor for every independent set I of G. Some sufficient conditions for a graph to be fractional ID-k-factor-critical are studied in this paper. Furthermore, we show that the result is best possible in some sense. 2010 Mathematics Subject C...

A graph G is fractional ID-[a, b]-factor-critical if G − I has a fractional [a, b]-factor for every independent set I of G. We extend a result of Zhou and Sun concerning fractional ID-k-factor-critical graphs.

A graph G is fractional k-covered if for each edge e of G, there exists a fractional k-factor h, such that h(e) = 1. If k = 2, then a fractional k-covered graph is called a fractional 2-covered graph. The binding number bind(G) is defined as follows, bind(G) = min{ |NG(X)| |X| : Ø = X ⊆ V (G), NG(X) = V (G)}. In this paper, it is proved that G is fractional 2-covered if δ(G) ≥ 4 and bind(G) > 5...

A procedure is presented that synthesizes fractional crystallization separation processes to obtain pure solids from multi-component solutions. The method includes a procedure to generate a network flow model to identify alternative process designs for fractional crystallization. The main advantage of this systematic procedure with respect to other reported procedures is using non-equilibri...

Let G be a graph of sufficiently large order n, and let a and b be integers with 1 ≤ a ≤ b. Let h : E(G) → [0, 1] be a function. If a ≤ ∑x∈e h(e) ≤ b holds for any x ∈ V (G), then G[Fh] is called a fractional [a, b]-factor of G with indicator function h, where Fh = {e ∈ E(G) | h(e) > 0}. A graph G is fractional independent-set-deletable [a, b]-factor-critical (simply, fractional ID-[a, b]-facto...

a procedure is presented that synthesizes fractional crystallization separation processes to obtain pure solids from multi-component solutions. the method includes a procedure to generate a network flow model to identify alternative process designs for fractional crystallization. the main advantage of this systematic procedure with respect to other reported procedures is using non-equilibrium s...

A graphG is fractional ID-[a, b]-factor-critical ifG−I includes a fractional [a, b]-factor for every independent set I of G. In this paper, it is proved that if α(G) ≤ 4b(δ(G)−a+1) (a+1)2+4b , then G is fractional ID-[a, b]-factor-critical. Furthermore, it is shown that the result is best possible in some sense.

in this paper, we prove the existence and uniqueness results to the random fractional functional differential equations under assumptions more general than the lipschitz type condition. moreover, the distance between exact solution and appropriate solution, and the existence extremal solution of the problem is also considered.