scholarly journals The Study of the Theoretical Size and Node Probability of the Loop Cutset in Bayesian Networks

Mathematics ◽  
2020 ◽  
Vol 8 (7) ◽  
pp. 1079 ◽  
Author(s):  
Jie Wei ◽  
Yufeng Nie ◽  
Wenxian Xie
Keyword(s):  
Probability Theory ◽  
Graph Theory ◽  
Bayesian Inference ◽  
Bayesian Networks ◽  
Numerical Simulations ◽  
Complete Graph ◽  
Upper Bound ◽  
Numerical Algorithms ◽  
Theoretical Research ◽  
Theoretical Results

Pearl’s conditioning method is one of the basic algorithms of Bayesian inference, and the loop cutset is crucial for the implementation of conditioning. There are many numerical algorithms for solving the loop cutset, but theoretical research on the characteristics of the loop cutset is lacking. In this paper, theoretical insights into the size and node probability of the loop cutset are obtained based on graph theory and probability theory. It is proven that when the loop cutset in a p-complete graph has a size of p − 2 , the upper bound of the size can be determined by the number of nodes. Furthermore, the probability that a node belongs to the loop cutset is proven to be positively correlated with its degree. Numerical simulations show that the application of the theoretical results can facilitate the prediction and verification of the loop cutset problem. This work is helpful in evaluating the performance of Bayesian networks.

scholarly journals Information overload for (bounded) rational agents

2021 ◽  
Vol 288 (1944) ◽  
pp. 20202957
Author(s):  
Emmanuel M. Pothos ◽  
Stephan Lewandowsky ◽  
Irina Basieva ◽  
Albert Barque-Duran ◽  
Katy Tapper ◽  
...  
Keyword(s):  
Probability Theory ◽  
Natural Selection ◽  
Bayesian Inference ◽  
Bayesian Networks ◽  
Information Overload ◽  
Recent Trend ◽  
Quantum Probability ◽  
Political Debate ◽  
Convergence Theorems ◽  
Rational Agents

Bayesian inference offers an optimal means of processing environmental information and so an advantage in natural selection. We consider the apparent, recent trend in increasing dysfunctional disagreement in, for example, political debate. This is puzzling because Bayesian inference benefits from powerful convergence theorems, precluding dysfunctional disagreement. Information overload is a plausible factor limiting the applicability of full Bayesian inference, but what is the link with dysfunctional disagreement? Individuals striving to be Bayesian-rational, but challenged by information overload, might simplify by using Bayesian networks or the separation of questions into knowledge partitions, the latter formalized with quantum probability theory. We demonstrate the massive simplification afforded by either approach, but also show how they contribute to dysfunctional disagreement.

scholarly journals On Winning Fast in Avoider-Enforcer Games

10.37236/328 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
János Barát ◽  
Miloš Stojaković
Keyword(s):  
Graph Theory ◽  
Lower Bound ◽  
Complete Graph ◽  
Upper Bound ◽  
Extremal Graph ◽  
Extremal Graph Theory ◽  
Additive Constant ◽  
Main Interest ◽  
Free Graph ◽  
Positional Games

We analyze the duration of the unbiased Avoider-Enforcer game for three basic positional games. All the games are played on the edges of the complete graph on $n$ vertices, and Avoider's goal is to keep his graph outerplanar, diamond-free and $k$-degenerate, respectively. It is clear that all three games are Enforcer's wins, and our main interest lies in determining the largest number of moves Avoider can play before losing. Extremal graph theory offers a general upper bound for the number of Avoider's moves. As it turns out, for all three games we manage to obtain a lower bound that is just an additive constant away from that upper bound. In particular, we exhibit a strategy for Avoider to keep his graph outerplanar for at least $2n-8$ moves, being just $6$ short of the maximum possible. A diamond-free graph can have at most $d(n)=\lceil\frac{3n-4}{2}\rceil$ edges, and we prove that Avoider can play for at least $d(n)-3$ moves. Finally, if $k$ is small compared to $n$, we show that Avoider can keep his graph $k$-degenerate for as many as $e(n)$ moves, where $e(n)$ is the maximum number of edges a $k$-degenerate graph can have.

On the kinetics of Hadamard-type fractional differential systems

2020 ◽  
Vol 23 (2) ◽  
pp. 553-570 ◽  
Author(s):  
Li Ma
Keyword(s):  
Differential Operator ◽  
Numerical Simulations ◽  
Type Inequality ◽  
The Other ◽  
Differential Systems ◽  
Fractional Differential Systems ◽  
Fractional Differential Operator ◽  
Fractional Differential ◽  
Kinetics Of ◽  
Theoretical Results

AbstractThis paper is devoted to the investigation of the kinetics of Hadamard-type fractional differential systems (HTFDSs) in two aspects. On one hand, the nonexistence of non-trivial periodic solutions for general HTFDSs, which are considered in some functional spaces, is proved and the corresponding eigenfunction of Hadamard-type fractional differential operator is also discussed. On the other hand, by the generalized Gronwall-type inequality, we estimate the bound of the Lyapunov exponents for HTFDSs. In addition, numerical simulations are addressed to verify the obtained theoretical results.

scholarly journals Bayesian Inference of Species Trees using Diffusion Models

2020 ◽  
Vol 70 (1) ◽  
pp. 145-161 ◽  
Author(s):  
Marnus Stoltz ◽  
Boris Baeumer ◽  
Remco Bouckaert ◽  
Colin Fox ◽  
Gordon Hiscott ◽  
...  
Keyword(s):  
Bayesian Inference ◽  
Numerical Algorithms ◽  
Diffusion Models ◽  
Model Parameters ◽  
Data Sets ◽  
Species Trees ◽  
Computationally Efficient ◽  
Data Set ◽  
Snp Data ◽  
Binary Markers

Abstract We describe a new and computationally efficient Bayesian methodology for inferring species trees and demographics from unlinked binary markers. Likelihood calculations are carried out using diffusion models of allele frequency dynamics combined with novel numerical algorithms. The diffusion approach allows for analysis of data sets containing hundreds or thousands of individuals. The method, which we call Snapper, has been implemented as part of the BEAST2 package. We conducted simulation experiments to assess numerical error, computational requirements, and accuracy recovering known model parameters. A reanalysis of soybean SNP data demonstrates that the models implemented in Snapp and Snapper can be difficult to distinguish in practice, a characteristic which we tested with further simulations. We demonstrate the scale of analysis possible using a SNP data set sampled from 399 fresh water turtles in 41 populations. [Bayesian inference; diffusion models; multi-species coalescent; SNP data; species trees; spectral methods.]

scholarly journals Stanley depth of edge ideals

2012 ◽  
Vol 49 (4) ◽  
pp. 501-508 ◽  
Author(s):  
Muhammad Ishaq ◽  
Muhammad Qureshi
Keyword(s):  
Complete Graph ◽  
Upper Bound ◽  
Edge Ideal ◽  
Stanley Depth ◽  
Edge Ideals

We give an upper bound for the Stanley depth of the edge ideal I of a k-partite complete graph and show that Stanley’s conjecture holds for I. Also we give an upper bound for the Stanley depth of the edge ideal of a s-uniform complete bipartite hypergraph.

scholarly journals A Stochastic SIR Epidemic System with a Nonlinear Relapse

2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Ali El Myr ◽  
Abdelaziz Assadouq ◽  
Lahcen Omari ◽  
Adel Settati ◽  
Aadil Lahrouz
Keyword(s):  
Numerical Simulations ◽  
Stationary Distribution ◽  
Stochastic Perturbations ◽  
Sir Epidemic ◽  
Spread Model ◽  
Stochastic Sir ◽  
Theoretical Results

We investigate the conditions that control the extinction and the existence of a unique stationary distribution of a nonlinear mathematical spread model with stochastic perturbations in a population of varying size with relapse. Numerical simulations are carried out to illustrate the theoretical results.

More Dynamical Properties Revealed from a 3D Lorenz-like System

2014 ◽  
Vol 24 (10) ◽  
pp. 1450133 ◽  
Author(s):  
Haijun Wang ◽  
Xianyi Li
Keyword(s):  
Numerical Simulations ◽  
Local Stability ◽  
Equilibrium Points ◽  
Heteroclinic Orbits ◽  
Mathematical Work ◽  
Chaotic Attractors ◽  
Heteroclinic Cycles ◽  
Homoclinic And Heteroclinic Orbits ◽  
Dynamical Properties ◽  
Theoretical Results

After a 3D Lorenz-like system has been revisited, more rich hidden dynamics that was not found previously is clearly revealed. Some more precise mathematical work, such as for the complete distribution and the local stability and bifurcation of its equilibrium points, the existence of singularly degenerate heteroclinic cycles as well as homoclinic and heteroclinic orbits, and the dynamics at infinity, is carried out in this paper. In particular, another possible new mechanism behind the creation of chaotic attractors is presented. Based on this mechanism, some different structure types of chaotic attractors are numerically found in the case of small b > 0. All theoretical results obtained are further illustrated by numerical simulations. What we formulate in this paper is to not only show those dynamical properties hiding in this system, but also (more mainly) present a kind of way and means — both "locally" and "globally" and both "finitely" and "infinitely" — to comprehensively explore a given system.

scholarly journals The Diameter of Almost Eulerian Digraphs

10.37236/429 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
Peter Dankelmann ◽  
L. Volkmann
Keyword(s):  
Graph Theory ◽  
Directed Graph ◽  
Upper Bound ◽  
Minimum Degree ◽  
Additive Constant ◽  
Undirected Graphs

Soares [J. Graph Theory 1992] showed that the well known upper bound $\frac{3}{\delta+1}n+O(1)$ on the diameter of undirected graphs of order $n$ and minimum degree $\delta$ also holds for digraphs, provided they are eulerian. In this paper we investigate if similar bounds can be given for digraphs that are, in some sense, close to being eulerian. In particular we show that a directed graph of order $n$ and minimum degree $\delta$ whose arc set can be partitioned into $s$ trails, where $s\leq \delta-2$, has diameter at most $3 ( \delta+1 - \frac{s}{3})^{-1}n+O(1)$. If $s$ also divides $\delta-2$, then we show the diameter to be at most $3(\delta+1 - \frac{(\delta-2)s}{3(\delta-2)+s} )^{-1}n+O(1)$. The latter bound is sharp, apart from an additive constant. As a corollary we obtain the sharp upper bound $3( \delta+1 - \frac{\delta-2}{3\delta-5})^{-1} n + O(1)$ on the diameter of digraphs that have an eulerian trail.

scholarly journals The Combination of Pairwise and Group Interactions Promotes Consensus in Opinion Dynamics

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Xiaoxuan Liu ◽  
Changwei Huang ◽  
Haihong Li ◽  
Qionglin Dai ◽  
Junzhong Yang
Keyword(s):  
Complex Systems ◽  
Numerical Simulations ◽  
Complete Graph ◽  
Group Interaction ◽  
Opinion Dynamics ◽  
Pairwise Interaction ◽  
Network Structures ◽  
Opinion Formation ◽  
Group Interactions ◽  
Bounded Confidence

In complex systems, agents often interact with others in two distinct types of interactions, pairwise interaction and group interaction. The Deffuant–Weisbuch model adopting pairwise interaction and the Hegselmann–Krause model adopting group interaction are the two most widely studied opinion dynamics. In this study, we propose a novel opinion dynamics by combining pairwise and group interactions for agents and study the effects of the combination on consensus in the population. In the model, we introduce a parameter α to control the weights of the two interactions in the dynamics. Through numerical simulations, we find that there exists an optimal α , which can lead to a highest probability of complete consensus and minimum critical bounded confidence for the formation of consensus. Furthermore, we show the effects of α on opinion formation by presenting the observations for opinion clusters. Moreover, we check the robustness of the results on different network structures and find the promotion of opinion consensus by α not limited to a complete graph.

scholarly journals Graphs with many vertex-disjoint cycles

2012 ◽  
Vol Vol. 14 no. 2 (Graph Theory) ◽  
Author(s):  
Dieter Rautenbach ◽  
Friedrich Regen
Keyword(s):  
Graph Theory ◽  
Upper Bound ◽  
Linear Time ◽  
Simple Extension ◽  
Disjoint Cycles ◽  
Cyclomatic Number ◽  
Finite Set ◽  
Extension Rule ◽  
International Audience ◽  
Vertex Disjoint

Graph Theory International audience We study graphs G in which the maximum number of vertex-disjoint cycles nu(G) is close to the cyclomatic number mu(G), which is a natural upper bound for nu(G). Our main result is the existence of a finite set P(k) of graphs for all k is an element of N-0 such that every 2-connected graph G with mu(G)-nu(G) = k arises by applying a simple extension rule to a graph in P(k). As an algorithmic consequence we describe algorithms calculating minmu(G)-nu(G), k + 1 in linear time for fixed k.

Sign in / Sign up

Export Citation Format

Share Document