Filters

2019 - 201912020 - 20213

More filters

2019 - 201912020 - 20223
Reset filters

Settings

Author: Andreis, Luisa × WGL Institute: WIAS ×

Search Results

Now showing 1 - 4 of 4
  • Thumbnail Image
    Item
    Large deviations for Markov jump processes with uniformly diminishing rates
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2021) Agazzi, Andrea; Andreis, Luisa; Patterson, Robert I. A.; Renger, D. R. Michiel
    We prove a large-deviation principle (LDP) for the sample paths of jump Markov processes in the small noise limit when, possibly, all the jump rates vanish uniformly, but slowly enough, in a region of the state space. We further show that our assumptions on the decay of the jump rates are optimal. As a direct application of this work we relax the assumptions needed for the application of LDPs to, e.g., Chemical Reaction Network dynamics, where vanishing reaction rates arise naturally particularly the context of Mass action kinetics.
  • Thumbnail Image
    Item
    A large-deviations approach to gelation
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2019) Andreis, Luisa; König, Wolfgang; Patterson, Robert
    A @large-deviations principle (LDP) is derived for the state, at fixed time, of the multiplicative coalescent in the large particle number limit. The rate function is explicit and describes each of the three parts of the state: microscopic, mesoscopic and macroscopic. In particular, it clearly captures the well known gelation phase transition given by the formation of a particle containing a positive fraction of the system mass at time t = 1. Via a standard map of the multiplicative coalescent onto a time-dependent version of the Erdos-Rényi random graph, our results can also be rephrased as an LDP for the component sizes in that graph. Our proofs rely on estimates and asymptotics for the probability that smaller Erdos-Rényi graphs are connected.
  • Thumbnail Image
    Item
    A large-deviations principle for all the cluster sizes of a sparse Erdős-Rényi graph
    (New York, NY [u.a.] : Wiley, 2021) Andreis, Luisa; König, Wolfgang; Patterson, Robert I. A.
    [For Abstract, see PDF]
  • Thumbnail Image
    Item
    A large-deviations principle for all the components in a sparse inhomogeneous random graph
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2021) Andreis, Luisa; König, Wolfgang; Langhammer, Heide; Patterson, Robert I. A.
    We study an inhomogeneous sparse random graph, GN, on [N] = { 1,...,N } as introduced in a seminal paper [BJR07] by Bollobás, Janson and Riordan (2007): vertices have a type (here in a compact metric space S), and edges between different vertices occur randomly and independently over all vertex pairs, with a probability depending on the two vertex types. In the limit N → ∞ , we consider the sparse regime, where the average degree is O(1). We prove a large-deviations principle with explicit rate function for the statistics of the collection of all the connected components, registered according to their vertex type sets, and distinguished according to being microscopic (of finite size) or macroscopic (of size ≈ N). In doing so, we derive explicit logarithmic asymptotics for the probability that GN is connected. We present a full analysis of the rate function including its minimizers. From this analysis we deduce a number of limit laws, conditional and unconditional, which provide comprehensive information about all the microscopic and macroscopic components of GN. In particular, we recover the criterion for the existence of the phase transition given in [BJR07].