Connectivity and Competition in Airline Networks: A Complexity Analysis of Lufthansa's Network

Author(s):  
Aura Reggiani ◽  
Peter Nijkamp ◽  
Alessandro Cento

2010 ◽  
Vol 19 (4) ◽  
pp. 449-461 ◽  
Author(s):  
Aura Reggiani ◽  
Peter Nijkamp ◽  
Alessandro Cento


1988 ◽  
Author(s):  
Paul E. Janusz


Author(s):  
Mark Newman

This chapter describes models of the growth or formation of networks, with a particular focus on preferential attachment models. It starts with a discussion of the classic preferential attachment model for citation networks introduced by Price, including a complete derivation of the degree distribution in the limit of large network size. Subsequent sections introduce the Barabasi-Albert model and various generalized preferential attachment models, including models with addition or removal of extra nodes or edges and models with nonlinear preferential attachment. Also discussed are node copying models and models in which networks are formed by optimization processes, such as delivery networks or airline networks.





Author(s):  
Baojian Yang ◽  
Lu Cao ◽  
Dechao Ran ◽  
Bing Xiao

Due to unavoidable factors, heavy-tailed noise appears in satellite attitude estimation. Traditional Kalman filter is prone to performance degradation and even filtering divergence when facing non-Gaussian noise. The existing robust algorithms have limited accuracy. To improve the attitude determination accuracy under non-Gaussian noise, we use the centered error entropy (CEE) criterion to derive a new filter named centered error entropy Kalman filter (CEEKF). CEEKF is formed by maximizing the CEE cost function. In the CEEKF algorithm, the prior state values are transmitted the same as the classical Kalman filter, and the posterior states are calculated by the fixed-point iteration method. The CEE EKF (CEE-EKF) algorithm is also derived to improve filtering accuracy in the case of the nonlinear system. We also give the convergence conditions of the iteration algorithm and the computational complexity analysis of CEEKF. The results of the two simulation examples validate the robustness of the algorithm we presented.



Sign in / Sign up

Export Citation Format

Share Document