Maximum Entropy Analysis of Flow Networks with Structural Uncertainty (Graph Ensembles)
From MaRDI portal
Recommendations
- Calculating Maximum Entropy Flows in Networks
- Maximum entropy analysis of flow and reaction networks
- Bayesian and maximum entropy analyses of flow networks with non-Gaussian priors and soft constraints
- Entropy modeling of network structures
- Maximum-entropy networks. Pattern detection, network reconstruction and graph combinatorics
- Maximum flows in probabilistic networks
- A note on asymptotic distributions in maximum entropy models for networks
Cites work
- A Mathematical Theory of Communication
- Combinatorial entropies and statistics
- Generalized classical, quantum and intermediate statistics and the Pólya urn model
- Maximum entropy derivation of quasi-Newton methods
- On Information and Sufficiency
- Percolation transition and distribution of connected components in generalized random network ensembles
- Statistical mechanics of complex networks
Cited in
(3)
This page was built for publication: Maximum Entropy Analysis of Flow Networks with Structural Uncertainty (Graph Ensembles)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4689218)