scientific article; zbMATH DE number 3409391
From MaRDI portal
Publication:5675746
Exact enumeration problems, generating functions (05A15) Directed graphs (digraphs), tournaments (05C20) 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
(42)- Counting acyclic digraphs by sources and sinks
- On the number of labeled acyclic digraphs
- Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.
- Priors on network structures. Biasing the search for Bayesian networks
- Zeros of the deformed exponential function
- Inferring large graphs using \(\ell_1\)-penalized likelihood
- Who should cast the casting vote? Using sequential voting to amalgamate information
- The size distribution for Markov equivalence classes of acyclic digraph models.
- Counting extensional acyclic digraphs
- On the structure of oriented graphs and digraphs with forbidden tournaments or cycles
- Counting acyclic and strong digraphs by descents
- Generating functions of some families of directed uniform hypergraphs
- Asymptotic enumeration of compacted binary trees of bounded right height
- Marginal information for structure learning
- \textit{Graph\_sampler}: a simple tool for fully Bayesian analyses of DAG-models
- Generating connected acyclic digraphs uniformly at random
- Formulas for counting acyclic digraph Markov equivalence classes
- Acyclic digraphs
- A comparison of random task graph generation methods for scheduling problems
- Asymptotic enumeration of extensional acyclic digraphs
- Minimal strong digraphs
- A novel discrete particle swarm optimization algorithm for solving Bayesian network structures learning problem
- Efficient Sampling and Structure Learning of Bayesian Networks
- Random generation of essential directed acyclic graphs
- Discrete metric spaces: structure, enumeration, and 0-1 laws
- Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks
- Acyclic orientations and the chromatic polynomial
- Uniform random generation of large acyclic digraphs
- Structural factor equation models for causal network construction via directed acyclic mixed graphs
- Persistence for a class of order-one autoregressive processes and Mallows-Riordan polynomials
- The birth of the strong components
- Exact enumeration of satisfiable 2-SAT formulae
- From statistical to causal learning
- Multi-dimensional classification with Bayesian networks
- Corrected score methods for estimating Bayesian networks with error-prone nodes
- Asymptotic analysis and efficient random sampling of directed ordered acyclic graphs
- Hiring strategies
- Lifted inference beyond first-order logic
- Maximal bifix codes of degree 3
- On expressiveness of the chain graph interpretations
- Parallel globally optimal structure learning of Bayesian networks
- Chain graph models to elicit the structure of a Bayesian network
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)
