Skip to search formSkip to main contentSkip to account menu

Lyapunov fractal

Known as: Lyapunov, Markus-Lyapunov fractal 
In mathematics, Lyapunov fractals (also known as Markus–Lyapunov fractals) are bifurcational fractals derived from an extension of the logistic map… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations
AlgorithmBifurcation theoryFractalList of chaotic maps

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
Flocking for multi-agent dynamic systems: algorithms and theory
In this paper, we present a theoretical framework for design and analysis of distributed flocking algorithms. Two cases of… 
Highly Cited
2005
Highly Cited
2005
Stability of multiagent systems with time-dependent communication links
  • L. Moreau
  • IEEE Transactions on Automatic Control
  • 2005
  • Corpus ID: 6211634
We study a simple but compelling model of network of agents interacting via time-dependent communication links. The model finds… 
Highly Cited
2004
Highly Cited
2004
Consensus problems in networks of agents with switching topology and time-delays
In this paper, we discuss consensus problems for networks of dynamic agents with fixed and switching topologies. We analyze three… 
Highly Cited
2002
Highly Cited
2002
Coordination of groups of mobile autonomous agents using nearest neighbor rules
Vicsek et al. proposed (1995) a simple but compelling discrete-time model of n autonomous agents {i.e., points or particles} all… 
Highly Cited
2000
Highly Cited
2000
Finite-Time Stability of Continuous Autonomous Systems
Finite-time stability is defined for equilibria of continuous but non-Lipschitzian autonomous systems. Continuity, Lipschitz… 
Highly Cited
1998
Highly Cited
1998
Convergence Properties of the Nelder-Mead Simplex Method in Low Dimensions
The Nelder--Mead simplex algorithm, first published in 1965, is an enormously popular direct search method for multidimensional… 
Highly Cited
1998
Highly Cited
1998
Rate control for communication networks: shadow prices, proportional fairness and stability
This paper analyses the stability and fairness of two classes of rate control algorithm for communication networks. The… 
Highly Cited
1998
Highly Cited
1998
Multiple Lyapunov functions and other analysis tools for switched and hybrid systems
  • M. Branicky
  • IEEE Transactions on Automatic Control
  • 1998
  • Corpus ID: 9689676
We introduce some analysis tools for switched and hybrid systems. We first present work on stability analysis. We introduce… 
Highly Cited
1985
Highly Cited
1985
Determining Lyapunov exponents from a time series
Highly Cited
1983
Highly Cited
1983
Absolute stability of global pattern formation and parallel memory storage by competitive neural networks
Systems that are competitive and possess symmetric interactions admit a global Lyapunov function. However, a global Lyapunov… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)