Pith. sign in

REVIEW 1 cited by

The mean-field Limit of sparse networks of integrate and fire neurons

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2309.04046 v1 pith:4W5RIMUN submitted 2023-09-07 math.PR math.APnlin.AOq-bio.NC

classification math.PRmath.APnlin.AOq-bio.NC
keywords limithierarchymean-fieldneuronsapproachdistributionnetworksnotion
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We study the mean-field limit of a model of biological neuron networks based on the so-called stochastic integrate-and-fire (IF) dynamics. Our approach allows to derive a continuous limit for the macroscopic behavior of the system, the 1-particle distribution, for a large number of neurons with no structural assumptions on the connection map outside of a generalized mean-field scaling. We propose a novel notion of observables that naturally extends the notion of marginals to systems with non-identical or non-exchangeable agents. Our new observables satisfy a complex approximate hierarchy, essentially a tree-indexed extension of the classical BBGKY hierarchy. We are able to pass to the limit in this hierarchy as the number of neurons increases through novel quantitative stability estimates in some adapted weak norm. While we require non-vanishing diffusion, this approach notably addresses the challenges of sparse interacting graphs/matrices and singular interactions from Poisson jumps, and requires no additional regularity on the initial distribution.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Coupling and Tensorization of Kinetic Theory and Graph Theory

    math.AP 2024-12 reject novelty 7.0 of 10

    Convergence of many interacting agents with non-identical connection weights to a deterministic Vlasov limit is proved using a distance that couples optimal transport and graph fractional isomorphism.

Pith tools