# Entropy Satisfying Schemes for Computing Selection Dynamics in Competitive Interactions

@article{Liu2015EntropySS, title={Entropy Satisfying Schemes for Computing Selection Dynamics in Competitive Interactions}, author={Hailiang Liu and Wenli Cai and Ning Su}, journal={SIAM J. Numerical Analysis}, year={2015}, volume={53}, pages={1393-1417} }

- Published in SIAM J. Numerical Analysis 2015
DOI:10.1137/140965739

In this paper, we present entropy satisfying schemes for solving an integro-differential equation that describes the evolution of a population structured with respect to a continuous trait. In [P.-E. Jabin and G. Raoul, J. Math. Biol., 63 (2011), pp. 493--517] solutions are shown to converge toward the so-called evolutionary stable distribution (ESD) as time becomes large, using the relative entropy. At the discrete level, the ESD is shown to be the solution to a quadratic programming problem… CONTINUE READING

#### Citations

##### Publications citing this paper.

SHOWING 1-2 OF 2 CITATIONS

## Time-asymptotic convergence rates towards the discrete evolutionary stable distribution

VIEW 4 EXCERPTS

CITES METHODS & BACKGROUND

HIGHLY INFLUENCED

## Selection-Mutation dynamics with spatial dependence

VIEW 1 EXCERPT

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 33 REFERENCES

## On selection dynamics for competitive interactions

VIEW 12 EXCERPTS

HIGHLY INFLUENTIAL

## On selection dynamics for continuous structured populations

VIEW 8 EXCERPTS

HIGHLY INFLUENTIAL

## Meszéna, On the impossibility of coexistence of infinitely many strategies

VIEW 3 EXCERPTS

HIGHLY INFLUENTIAL

## Measure Solutions for Some Models in Population Dynamics

VIEW 1 EXCERPT