Related papers: The large deviation principle for interacting dyna…
In this paper we present a new and flexible method to show that, in one dimension, various self-repellent random walks converge to self-repellent Brownian motion in the limit of weak interaction after appropriate space-time scaling. Our…
We study the greedy independent set algorithm on sparse Erd\H{o}s-R\'enyi random graphs ${\mathcal G}(n,c/n)$. This range of $p$ is of interest due to the threshold at $c=e$, beyond which it appears that greedy algorithms are affected by a…
For a finite random graph, we defined a simple model of statistical mechanics. We obtain an annealed asymptotic result for the random partition function for this model on finite random graphs as n; the size of the graph is very large. To…
Let L be a positive line bundle over a projective complex manifold X. Consider the space of holomorphic sections of the tensor power of order p of L. The determinant of a basis of this space, together with some given probability measure on…
In the study of dynamical systems on networks/graphs, a key theme is how the network topology influences stability for steady states or synchronized states. Ideally, one would like to derive conditions for stability or instability that…
Universality, namely distributional invariance, is a well-known property for many random structures. For example, it is known to hold for a broad range of variational problems with random input. Much less is known about the algorithmic…
We numerically investigate the dynamics of an SIR model with infection level-based lockdowns on Small-World networks. Using a large-deviation approach, namely the Wang-Landau algorithm, we study the distribution of the cumulative fraction…
We study two problems. First, we consider the large deviation behavior of empirical measures of certain diffusion processes as, simultaneously, the time horizon becomes large and noise becomes vanishingly small. The law of large numbers…
We define a dynamic model of random networks, where new vertices are connected to old ones with a probability proportional to a sublinear function of their degree. We first give a strong limit law for the empirical degree distribution, and…
The Adaptive Multilevel Splitting (AMS) algorithm is a powerful and versatile method for the simulation of rare events. It is based on an interacting (via a mutation-selection procedure) system of replicas, and depends on two integer…
Many real-world systems, such as moving planets, can be considered as multi-agent dynamic systems, where objects interact with each other and co-evolve along with the time. Such dynamics is usually difficult to capture, and understanding…
We consider the Markovian supermarket model with growing choices, where jobs arrive at rate $n\lambda_n$ and each of $n$ parallel servers processes jobs in its queue at rate $1$. Each incoming job joins the shortest among $d_n \in…
We study large deviations for random walks on stratified (Carnot) Lie groups. For such groups, there is a natural collection of vectors which generates their Lie algebra, and we consider random walks with increments in only these…
We study using large deviation theory the fluctuations of time-integrated functionals or observables of the unbiased random walk evolving on Erd\"os-R\'enyi random graphs, and construct a modified, biased random walk that explains how these…
We study the time-averaged flow in a model of particles that randomly hop on a finite directed graph. In the limit as the number of particles and the time window go to infinity but the graph remains finite, the large-deviation rate…
This paper is devoted to the problem of sample path large deviations for multidimensional queueing models with feedback. We derive a new version of the contraction principle where the continuous map is not well-defined on the whole space:…
We study the large-population limit of interacting particle systems evolving on adaptive dynamical networks, motivated in particular by models of opinion dynamics. In such systems, agents interact through weighted graphs whose structure…
Generative models for graphs have been typically committed to strong prior assumptions concerning the form of the modeled distributions. Moreover, the vast majority of currently available models are either only suitable for characterizing…
In this paper, we consider the large deviations principles (LDPs) for the stochastic linear Schr\"odinger equation and its symplectic discretizations. These numerical discretizations are the spatial semi-discretization based on spectral…
We prove the small-noise large deviation principle (LDP) for stochastic evolution equations in an $L^2$-setting. As the coefficients are allowed to be non-coercive, our framework encompasses a much broader scope than variational settings.…