Related papers: Quenched asymptotics for interacting diffusions on…
Fokker-Planck equations represent a suitable description of the finite-time behavior for a large class of particle systems as the size of the population tends to infinity. Recently, the theory of graph limits has been introduced in the…
We determine the asymptotic behavior of the maximum subgraph density of large random graphs with a prescribed degree sequence. The result applies in particular to the Erd\H{o}s-R\'{e}nyi model, where it settles a conjecture of Hajek [IEEE…
We study cumulants of numbers of $q$-step walks on Erd\"os-R\'enyi-type random graphs of long-range percolation radius model in the limit when the number of vertices $N$, concentration $c$, and the interaction radius $R$ tend to infinity.…
We establish an explicit rate of convergence for some systems of mean-field interacting diffusions with logistic binary branching towards the solutions of nonlinear evolution equations with non-local self-diffusion and logistic mass growth,…
We consider an inhomogeneous Erd\H{o}s-R\'enyi random graph ensemble with exponentially decaying random disconnection probabilities determined by an i.i.d. field of variables with heavy tails and infinite mean associated to the vertices of…
The asymptotic behavior of a class of stochastic reaction-diffusion-advection equations in the plane is studied. We show that as the divergence-free advection term becomes larger and larger, the solutions of such equations converge to the…
We consider a family of one-dimensional diffusions, in dynamical Wiener mediums, which are random perturbations of the Ornstein-Uhlenbeck diffusion process. We prove quenched and annealed convergences in distribution and under weighted…
We prove limit theorems for systems of interacting diffusions on sparse graphs. For example, we deduce a hydrodynamic limit and the propagation of chaos property for the stochastic Kuramoto model with interactions determined by…
In this paper, we investigate the convergence of asymptotic systems in non-autonomous Cohen--Grossberg neural network models, which include both infinite discrete time-varying and distributed delays. We derive stability results under…
The global clustering coefficient is an effective measure for analyzing and comparing the structures of complex networks. The random annulus graph is a modified version of the well-known Erd\H{o}s-R\'{e}nyi random graph. It has been…
We explain the ubiquity and extremely slow evolution of non gaussian out-of-equilibrium distributions for the Hamiltonian Mean-Field model, by means of traditional kinetic theory. Deriving the Fokker-Planck equation for a test particle, one…
Inspired by the modeling of grain growth in polycrystalline materials, we consider a nonlinear Fokker-Plank model, with inhomogeneous diffusion and with variable mobility parameters. We develop large time asymptotic analysis of such…
Non-Gaussian diffusion is commonly considered as a result of fluctuating diffusivity, which is correlated in time or in space or both. In this work, we investigate the non-Gaussian diffusion in static disordered media via a quenched trap…
We present a theoretical and experimental study of light transport in disordered media with strongly heterogeneous distribution of scatterers formed via non-scattering regions. Step correlations induced by quenched disorder are found to…
We conjecture that the distribution of the edge-disjoint union of two random regular graphs on the same vertex set is asymptotically equivalent to a random regular graph of the combined degree, provided it grows as the number of vertices…
In this paper we consider a nonlinear Fokker-Planck equation with asymptotically small parameters. It describes the diffusion of finite-size particles in the presence of a fixed distribution of obstacles in the limit of low-volume fraction.…
We consider two independent Erd\H{o}s-R\'enyi random graphs, with possibly different parameters, and study two isomorphism problems, a graph embedding problem and a common subgraph problem. Under certain conditions on the graph parameters…
We scrutinize the diagrammatic perturbation theory of noninteracting electrons in a random potential with the aim to accomplish a consistent comprehensive theory of quantum diffusion. Ward identity between the one-electron self-energy and…
We study the limiting behavior of interacting particle systems indexed by large sparse graphs, which evolve either according to a discrete time Markov chain or a diffusion, in which particles interact directly only with their nearest…
We study the behaviour of random labelled and unlabelled cographs with n vertices as n tends to infinity. Our main result is a novel probabilistic limit in the space of graphons.