2014
DOI: 10.1112/plms/pdu040
|View full text |Cite
|
Sign up to set email alerts
|

Evolving communities with individual preferences

Abstract: The goal of this paper is to provide mathematically rigorous tools for modelling the evolution of a community of interacting individuals. We model the population by a measure space (Ω, F, ν) where ν determines the abundance of individual preferences. The preferences of an individual ω ∈ Ω are described by a measurable choice X(ω) of a rough path.We aim to identify, for each individual, a choice for the forward evolution Y t(ω) for an individual in the community. These choices Y t(ω) must be consistent so tha… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
45
0

Year Published

2015
2015
2025
2025

Publication Types

Select...
7
1

Relationship

2
6

Authors

Journals

citations
Cited by 32 publications
(45 citation statements)
references
References 31 publications
0
45
0
Order By: Relevance
“…This obstacle eventually boils down to the need for sharp estimates on the integrability of the Jacobian of the flow J X t←0 (y 0 ). Cass, Lyons [4] and Inahama [21] establish such integrability for the Brownian rough path, but only by using the independence of the increments; for more general Gaussian processes a more careful analysis is needed. To understand the difficulty of this problem, we note from [12] that the standard deterministic estimate on J X t←0 (y 0 ) gives |J x t←0 (y 0 )| ≤ C exp(C x p pvar;[0,T ] ).…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…This obstacle eventually boils down to the need for sharp estimates on the integrability of the Jacobian of the flow J X t←0 (y 0 ). Cass, Lyons [4] and Inahama [21] establish such integrability for the Brownian rough path, but only by using the independence of the increments; for more general Gaussian processes a more careful analysis is needed. To understand the difficulty of this problem, we note from [12] that the standard deterministic estimate on J X t←0 (y 0 ) gives |J x t←0 (y 0 )| ≤ C exp(C x p pvar;[0,T ] ).…”
mentioning
confidence: 99%
“…Proof. We will only prove the lemma for the most difficult case p ∈ [3,4). By definition we have that…”
mentioning
confidence: 99%
“…This example makes clear the importance of the Laplace transform when analysing the tail behaviour of N r 0 (X a,x , [0, T ]). What is important, as we will show, is not to have a closed-form expression as in (16), but instead to have an upper bound controlling its asymptotic behaviour as λ → ∞.…”
Section: A Large Deviations Resultsmentioning
confidence: 99%
“…We therefore expect uses of our results to be widespread. In [16] it was observed that M(X, [0, T ]) appears in optimal Lipschitz-estimates on the rough path distance between two different RDE solutions. This has uses in fixed-point arguments, e.g.…”
mentioning
confidence: 99%
“…would follow from (14), giving, for a choice of M = 2c 1 2 , the conclusion Ψ y A ts , B ts − ϕ ts (y) > c 1 |t − s| a , contradicting identity (12), where X ts , X ts belongs to U for δ small enough, and the fact that A ts , B ts is a minimizer. This proves Theorem 6 in the special case where d ≥ m and where for some y ∈ R d the family V i (y), V j , V k (y) ; 1 ≤ i ≤ , 1 ≤ j < k ≤ is free.…”
Section: Proofs Of the Reconstruction Theoremmentioning
confidence: 98%