Related papers: Local weak convergence for sparse networks of inte…
We propose a novel class of network models for temporal dyadic interaction data. Our goal is to capture a number of important features often observed in social interactions: sparsity, degree heterogeneity, community structure and…
Ergodic exploration has spawned a lot of interest in mobile robotics due to its ability to design time trajectories that match desired spatial coverage statistics. However, current ergodic approaches are for continuous spaces, which require…
Biological circuits such as neural or gene regulation networks use internal states to map sensory input to an adaptive repertoire of behavior. Characterizing this mapping is a major challenge for systems biology, and though experiments that…
We study large-scale systems operating under the JSQ$(d)$ policy in the presence of stringent task-server compatibility constraints. Consider a system with $N$ identical single-server queues and $M(N)$ task types, where each server is able…
We present novel information-theoretic limits on detecting sparse changes in Ising models, a problem that arises in many applications where network changes can occur due to some external stimuli. We show that the sample complexity for…
In this paper we study sharp thresholds for detecting sparse signals in $\beta$-models for potentially sparse random graphs. The results demonstrate interesting interplay between graph sparsity, signal sparsity, and signal strength. In…
Many natural and social systems develop complex networks, that are usually modelled as random graphs. The eigenvalue spectrum of these graphs provides information about their structural properties. While the semi-circle law is known to…
Deep learning models have been shown to be vulnerable to adversarial attacks. This perception led to analyzing deep learning models not only from the perspective of their performance measures but also their robustness to certain types of…
We present a unified framework, with quantitative estimates, for deterministic interacting particle systems whose pairwise interactions may depend on heterogeneous labels. Heterogeneity is kept at every level by adding a frozen label…
This paper investigates the long time dynamics of interacting particle systems subject to singular interactions. We consider a microscopic system of $N$ interacting point particles, where the time evolution of the joint distribution…
We address the long time behaviour of weakly interacting diffusive particle systems on the d-dimensional torus. Our main result is to show that, under certain regularity conditions, the weak error between the empirical distribution of the…
Many complex systems combine dense background structure with sparse contextual information. We introduce a diffusion-based framework for analyzing how sparse condition-specific layers reshape diffusion geometry in multilayer hypergraphs.…
We investigate an interacting particle system inspired by the gypsy moth, whose populations grow until they become sufficiently dense so that an epidemic reduces them to a low level. We consider this process on a random 3-regular graph and…
We study the quenched behaviour of a perturbed version of the simple symmetric random walk on the set of integers. The random walker moves symmetrically with an exception of some randomly chosen sites where we impose a random drift. We show…
We prove the existence of weak solutions of a class of multi-species cross-diffusion systems as well as the propagation of chaos result by means of nonlocal approximation of the nonlinear diffusion terms, coupling methods and compactness…
We consider the structure learning problem for graphical models that we call loosely connected Markov random fields, in which the number of short paths between any pair of nodes is small, and present a new conditional independence test…
We establish an abstract local ergodic theorem, under suitable space-time scaling, for the (boundary-driven) symmetric exclusion process on an increasing sequence of balls covering an infinite weighted graph. The proofs are based on 1-block…
In this article we show, in a concise manner, a result of uniform in time propagation of chaos for non exchangeable systems of particles interacting according to a random graph. Provided the interaction is Lipschitz continuous, the…
In this paper, we revisit a well-known distributed projected subgradient algorithm which aims to minimize a sum of cost functions with a common set constraint. In contrast to most of existing results, weight matrices of the time-varying…
We study an interacting particle system whose dynamics depends on an interacting random environment. As the number of particles grows large, the transition rate of the particles slows down (perhaps because they share a common resource of…