Related papers: Mean field limit of local density-dependent Markov…
We describe an exact approach for calculating transition probabilities and waiting times in finite-state discrete-time Markov processes. All the states and the rules for transitions between them must be known in advance. We can then…
Density dependent Markov population processes with countably many types can often be well approximated over finite time intervals by the solution of the differential equations that describe their average drift, provided that the total…
Consider a filtering process associated to a hidden Markov model with densities for which both the state space and the observation space are complete, separable, metric spaces. If the underlying, hidden Markov chain is strongly ergodic and…
We study asymptotic behaviour of the correlation functions of bipartite sparse random $N\times N$ matrices. We assume that the graphs have $N$ vertices, the ratio of parts is $\displaystyle\frac{\alpha}{1-\alpha}$ and the average number of…
We deal with a random graph model evolving in discrete time steps by duplicating and deleting the edges of randomly chosen vertices. We prove the existence of an a.s. asymptotic degree distribution, with streched exponential decay; more…
We study stochastic Mean Field Games on networks with sticky transition conditions. In this setting, the diffusion process governing the agent's dynamics can spend finite time both in the interior of the edges and at the vertices. The…
We consider Mckean-Vlasov type stochastic differential equations with multiplicative noise arising from the random vortex method. Such an equation can be viewed as the mean-field limit of interacting particle systems with singular…
In a paper entitled singularities of invariant densities for random switching between two linear odes in 2D, Bakhtin et al [5], consider a Markov process obtained by random switching between two stable linear vector fields in the plane and…
We establish a functional weak law of large numbers for observable macroscopic state variables of interacting particle systems (e.g., voter and contact processes) over fast time-varying sparse random networks of interactions. We show that,…
We consider general Markov processes with absorption and provide criteria ensuring the exponential convergence in total variation of the distribution of the process conditioned not to be absorbed. The first one is based on two-sided…
We investigate the mean-field dynamics of stochastic McKean differential equations with heterogeneous particle interactions described by large network structures. To express a wide range of graphs, from dense to sparse structures, we…
We study phase transitions in the Ising model on random graphs using graph limits. We show that the critical temperatures are determined by the eigenvalues of the kernel operator associated with the graph limit. Bifurcation diagrams for…
Using exact numerical diagonalization, we investigate localization in two classes of random matrices corresponding to random graphs. The first class comprises the adjacency matrices of Erdos-Renyi (ER) random graphs. The second one…
We consider a finite-state, continuous-time Markov process, represented in the "linear framework" by a directed graph with labelled edges which specifies the infinitesimal generator of the process. If the graph is strongly connected, the…
We investigate the nonequilibrium roughening transition of a one-dimensional restricted solid-on-solid model by directly sampling the stationary probability density of a suitable order parameter as the surface adsorption rate varies. The…
We consider two classes of natural stochastic processes on finite unlabeled graphs. These are Euclidean stochastic optimization algorithms on the adjacency matrix of weighted graphs and a modified version of the Metropolis MCMC algorithm on…
This study explores a Gaussian quasi-likelihood approach for estimating parameters of diffusion processes with Markovian regime switching. Assuming the ergodicity under high-frequency sampling, we will show the asymptotic normality of the…
We study sufficient conditions for local asymptotic mixed normality. We weaken the sufficient conditions in Theorem 1 of Jeganathan (Sankhya Ser. A 1982) so that they can be applied to a wider class of statistical models including a…
We consider the contact process on a random graph with fixed degree distribution given by a power law. We follow the work of Chatterjee and Durrett, who showed that for arbitrarily small infection parameter $\lambda$, the survival time of…
We study the asymptotic properties, in the weak sense, of regenerative processes and Markov renewal processes. For the latter, we derive both renewal-type results, also concerning the related counting process, and ergodic-type ones,…