Accuracy Criterion for Mean Field Approximations of Markov Processes on Hypergraphs

@article{Keliger2022AccuracyCF,
  title={Accuracy Criterion for Mean Field Approximations of Markov Processes on Hypergraphs},
  author={D'aniel Keliger and Ill{\'e}s Antal Horv{\'a}th},
  journal={SSRN Electronic Journal},
  year={2022}
}

Figures from this paper

References

SHOWING 1-10 OF 34 REFERENCES

Mean Field for Performance Models with Generally-Distributed Timed Transitions

The main focus is the rigorous proof of the mean-field limit of a class of stochastic models with exponential and deterministic delays to include exponential and generally-distributed delays.

A Critical Point for Random Graphs with a Given Degree Sequence

It is shown that if Σ i(i - 2)λi > 0, then such graphs almost surely have a giant component, while if λ0, λ1… which sum to 1, then almost surely all components in such graphs are small.

The N-intertwined SIS epidemic network model

The N-intertwined virus spread model of the SIS-type is introduced as a promising and analytically tractable model of which the steady-state behavior is fairly completely determined and much insight can be gained that is hidden in the exact Markov model.

Simplicial SIS model in scale-free uniform hypergraph

The hypergraph offers a platform to study structural properties emerging from more complicated and higher-order than pairwise interactions among constituents and dynamical behavior such as the spread

Mean-field Approximation for Stochastic Population Processes in Networks under Imperfect Information

General conditions on the network and policy dynamics for which a suitable mean-field approximation exists are provided and it is shown that as long as the network is well-connected, the macroscopic behavior of the population concentrates around the same mean- field system as the complete-graph case.

Dynamics of majority rule on hypergraphs.

This work focuses on a canonical example from opinion dynamics, namely the majority rule, and investigates the possibility to represent and analyze the system by means of hypergraphs, and explores the formation of consensus.

Solutions of ordinary differential equations as limits of pure jump markov processes

  • T. Kurtz
  • Mathematics
    Journal of Applied Probability
  • 1970
In a great variety of fields, e.g., biology, epidemic theory, physics, and chemistry, ordinary differential equations are used to give continuous deterministic models for dynamic processes which are

SIS Epidemic Propagation on Hypergraphs

The exact master equations of the propagation process are derived for an arbitrary hypergraph given by its incidence matrix, and moment closure approximation and mean-field models are introduced and compared to individual-based stochastic simulations.

Regular Partitions of Graphs

Abstract : A crucial lemma in recent work of the author (showing that k-term arithmetic progression-free sets of integers must have density zero) stated (approximately) that any large bipartite graph

Epidemic Outbreaks in Networks with Equitable or Almost-Equitable Partitions

This work describes the epidemic process as a continuous-time individual-based susceptible-infected-susceptible (SIS) model using a first-order mean-field approximation and proves that, above the threshold, another steady-state exists that can be computed using a lower-dimensional dynamical system associated with the evolution of the process on the quotient graph.