Search arXivSearch

arXiv · 2305.03464

Replica-mean-field limit of continuous-time fragmentation-interaction-aggregation processes

Abstract

Many phenomena can be modeled as network dynamics with punctuate interactions. However, most relevant dynamics do not allow for computational tractability. To circumvent this difficulty, the Poisson Hypothesis regime replaces interaction times between nodes by independent Poisson processes, allowing for tractability in several cases, such as intensity-based models from computational neuroscience. This hypothesis is usually only conjectured, or numerically validated. In this work, we introduce a class of processes in continuous time called continuous fragmentation-interaction-aggregation processes, by analogy with previously introduced processes in discrete time. The state of each node, described by the stochastic intensity of an associated point process, aggregates arrivals from its neighbors and is fragmented upon departure. We consider the replica-mean-field version of such a process, which is a physical system consisting of randomly interacting copies of the network of interest. Generalizing results proved in discrete time and in the particular case of excitatory intensity-based neural dynamics, we prove that the Poisson Hypothesis holds at the limit of an infinite number of replicas.

Explore related subjects

Keep this discovery

BibTeXRIS

Michel Davydov. 2023-05-05. Replica-mean-field limit of continuous-time fragmentation-interaction-aggregation processes. https://arxiv.org/abs/2305.03464

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR