Calculating Maximum Entropy Flows in Networks
From MaRDI portal
Publication:5289350
Recommendations
- Maximum Entropy Analysis of Flow Networks with Structural Uncertainty (Graph Ensembles)
- Maximum flows in probabilistic networks
- Maximum entropy analysis of flow and reaction networks
- Entropy modeling of network structures
- Maximal flow in possibilistic networks
- Efficiently Computing Maximum Flows in Scale-Free Networks.
- On the Maximum Expected Flow in a Network
- Maximum entropy principle for Kaniadakis statistics and networks
- Entropy maximisation and queueing network models
Cited in
(9)- Evaluation of water quality reliability based on entropy in water distribution system
- Optimal mixing in transport networks: numerical optimization and analysis
- Controlled maximum entropy method optimization of the initial network topology and routing
- Maximum entropy analysis of flow and reaction networks
- Water supply network in a fuzzy environment; maximum entropy approach
- Maximum Entropy Analysis of Flow Networks with Structural Uncertainty (Graph Ensembles)
- Statistical procedures for estimating branch flows and total network flow
- A Tsallis entropy-based redundancy measure for water distribution networks
- Bayesian and maximum entropy analyses of flow networks with non-Gaussian priors and soft constraints
This page was built for publication: Calculating Maximum Entropy Flows in Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5289350)