scientific article; zbMATH DE number 3409391
From MaRDI portal
Publication:5675746
Directed graphs (digraphs), tournaments (05C20) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) General theory of functional-differential equations (34K05)
Cited in
(39)- Marginal information for structure learning
- On the structure of oriented graphs and digraphs with forbidden tournaments or cycles
- A comparison of random task graph generation methods for scheduling problems
- Exact enumeration of satisfiable 2-SAT formulae
- Generating connected acyclic digraphs uniformly at random
- Multi-dimensional classification with Bayesian networks
- Structural factor equation models for causal network construction via directed acyclic mixed graphs
- Random generation of essential directed acyclic graphs
- Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks
- On the number of labeled acyclic digraphs
- Inferring large graphs using \(\ell_1\)-penalized likelihood
- The size distribution for Markov equivalence classes of acyclic digraph models.
- Chain graph models to elicit the structure of a Bayesian network
- Counting acyclic and strong digraphs by descents
- Efficient Sampling and Structure Learning of Bayesian Networks
- Asymptotic enumeration of extensional acyclic digraphs
- Corrected score methods for estimating Bayesian networks with error-prone nodes
- On expressiveness of the chain graph interpretations
- Parallel globally optimal structure learning of Bayesian networks
- Counting acyclic digraphs by sources and sinks
- \textit{Graph\_sampler}: a simple tool for fully Bayesian analyses of DAG-models
- Discrete metric spaces: structure, enumeration, and 0-1 laws
- Formulas for counting acyclic digraph Markov equivalence classes
- Generating functions of some families of directed uniform hypergraphs
- Maximal bifix codes of degree 3
- Uniform random generation of large acyclic digraphs
- Who should cast the casting vote? Using sequential voting to amalgamate information
- Acyclic digraphs
- A novel discrete particle swarm optimization algorithm for solving Bayesian network structures learning problem
- From statistical to causal learning
- Persistence for a class of order-one autoregressive processes and Mallows-Riordan polynomials
- Priors on network structures. Biasing the search for Bayesian networks
- Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.
- Counting extensional acyclic digraphs
- Zeros of the deformed exponential function
- Acyclic orientations and the chromatic polynomial
- The birth of the strong components
- Asymptotic enumeration of compacted binary trees of bounded right height
- Minimal strong digraphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5675746)
