1,556 research outputs found

    Bayesian networks for enterprise risk assessment

    Get PDF
    According to different typologies of activity and priority, risks can assume diverse meanings and it can be assessed in different ways. In general risk is measured in terms of a probability combination of an event (frequency) and its consequence (impact). To estimate the frequency and the impact (severity) historical data or expert opinions (either qualitative or quantitative data) are used. Moreover qualitative data must be converted in numerical values to be used in the model. In the case of enterprise risk assessment the considered risks are, for instance, strategic, operational, legal and of image, which many times are difficult to be quantified. So in most cases only expert data, gathered by scorecard approaches, are available for risk analysis. The Bayesian Network is a useful tool to integrate different information and in particular to study the risk's joint distribution by using data collected from experts. In this paper we want to show a possible approach for building a Bayesian networks in the particular case in which only prior probabilities of node states and marginal correlations between nodes are available, and when the variables have only two states

    Basic and degenerate pregeometries

    Full text link
    We study pairs (Γ,G)(\Gamma,G), where Γ\Gamma is a 'Buekenhout-Tits' pregeometry with all rank 2 truncations connected, and G⩽AutΓG\leqslant\mathrm{Aut} \Gamma is transitive on the set of elements of each type. The family of such pairs is closed under forming quotients with respect to GG-invariant type-refining partitions of the element set of Γ\Gamma. We identify the 'basic' pairs (those that admit no non-degenerate quotients), and show, by studying quotients and direct decompositions, that the study of basic pregeometries reduces to examining those where the group GG is faithful and primitive on the set of elements of each type. We also study the special case of normal quotients, where we take quotients with respect to the orbits of a normal subgroup of GG. There is a similar reduction for normal-basic pregeometries to those where GG is faithful and quasiprimitive on the set of elements of each type

    A characterisation of weakly locally projective amalgams related to A16A_{16} and the sporadic simple groups M24M_{24} and HeHe

    Full text link
    A simple undirected graph is weakly GG-locally projective, for a group of automorphisms GG, if for each vertex xx, the stabiliser G(x)G(x) induces on the set of vertices adjacent to xx a doubly transitive action with socle the projective group Lnx(qx)L_{n_x}(q_x) for an integer nxn_x and a prime power qxq_x. It is GG-locally projective if in addition GG is vertex transitive. A theorem of Trofimov reduces the classification of the GG-locally projective graphs to the case where the distance factors are as in one of the known examples. Although an analogue of Trofimov's result is not yet available for weakly locally projective graphs, we would like to begin a program of characterising some of the remarkable examples. We show that if a graph is weakly locally projective with each qx=2q_x =2 and nx=2n_x = 2 or 33, and if the distance factors are as in the examples arising from the rank 3 tilde geometries of the groups M24M_{24} and HeHe, then up to isomorphism there are exactly two possible amalgams. Moreover, we consider an infinite family of amalgams of type Un\mathcal{U}_n (where each qx=2q_x=2 and n=nx+1≥4n=n_x+1\geq 4) and prove that if n≥5n\geq 5 there is a unique amalgam of type Un\mathcal{U}_n and it is unfaithful, whereas if n=4n=4 then there are exactly four amalgams of type U4\mathcal{U}_4, precisely two of which are faithful, namely the ones related to M24M_{24} and HeHe, and one other which has faithful completion A16A_{16}

    Locally ss-distance transitive graphs

    Full text link
    We give a unified approach to analysing, for each positive integer ss, a class of finite connected graphs that contains all the distance transitive graphs as well as the locally ss-arc transitive graphs of diameter at least ss. A graph is in the class if it is connected and if, for each vertex vv, the subgroup of automorphisms fixing vv acts transitively on the set of vertices at distance ii from vv, for each ii from 1 to ss. We prove that this class is closed under forming normal quotients. Several graphs in the class are designated as degenerate, and a nondegenerate graph in the class is called basic if all its nontrivial normal quotients are degenerate. We prove that, for s≥2s\geq 2, a nondegenerate, nonbasic graph in the class is either a complete multipartite graph, or a normal cover of a basic graph. We prove further that, apart from the complete bipartite graphs, each basic graph admits a faithful quasiprimitive action on each of its (1 or 2) vertex orbits, or a biquasiprimitive action. These results invite detailed additional analysis of the basic graphs using the theory of quasiprimitive permutation groups.Comment: Revised after referee report
    • …
    corecore