Related papers: Weakly interacting oscillators on dense random gra…
We introduce and develop a theory of limits for sequences of sparse graphs based on $L^p$ graphons, which generalizes both the existing $L^\infty$ theory of dense graph limits and its extension by Bollob\'as and Riordan to sparse graphs…
We consider the problem of estimating graph limits, known as graphons, from observations of sequences of sparse finite graphs. In this paper we show a simple method that can shed light on a subset of sparse graphs. The method involves…
We numerically study the structure of the interactions occurring in three-dimensional systems of hard spheres at jamming, focusing on the large-scale behavior. Given the fundamental role they play in the configuration of jammed packings, we…
We consider a system of $N$ interacting particles, described by SDEs driven by Poisson random measures, where the coefficients depend on the empirical measure of the system. Every particle jumps with a jump rate depending on its position.…
We investigate systems of interacting stochastic differential equations with two kinds of heterogeneity: one originating from different weights of the linkages, and one concerning their asymptotic relevance when the system becomes large. To…
Social networks have a small number of large hubs, and a large number of small dense communities. We propose a generative model that captures both hub and dense structures. Based on recent results about graphons on line graphs, our model is…
A graphon is a limiting object used to describe the behaviour of large networks through a function that captures the probability of edge formation between nodes. Although the merits of graphons to describe large and unlabelled networks are…
Large-scale graph machine learning is challenging as the complexity of learning models scales with the graph size. Subsampling the graph is a viable alternative, but sampling on graphs is nontrivial as graphs are non-Euclidean. Existing…
We consider the $N$ particle classical Riesz gas confined in a one-dimensional external harmonic potential with power law interaction of the form $1/r^k$ where $r$ is the separation between particles. As special limits it contains several…
Interacting particle systems are in frequent use to model collective behaviour in various situations and applications. For many systems, the interaction between the agents is restricted to an underlying network structure and often, the…
We show that if a sequence of dense graphs has the property that for every fixed graph F, the density of copies of F in these graphs tends to a limit, then there is a natural ``limit object'', namely a symmetric measurable 2-variable…
Capacitance measurements provide a powerful means of probing the density of states. The technique has proved particularly successful in studying 2D electron systems, revealing a number of interesting many-body effects. Here, we use…
We consider interacting particle dynamics with Vicsek type interactions, and their macroscopic PDE limit, in the non-mean-field regime; that is, we consider the case in which each particle/agent in the system interacts only with a…
Graph partitioning problems emerge in a wide variety of complex systems, ranging from biology to finance, but can be rigorously analyzed and solved only for a few graph ensembles. Here, an ensemble of equitable graphs, i.e. random graphs…
We consider a general framework for multi-type interacting particle systems on graphs, where particles move one at a time by random walk steps, different types may have different speeds, and may interact, possibly randomly, when they meet.…
We present a quantitative analysis of the Boltzmann-Grad (low-density) limit of a hard sphere system. We introduce and study a set of functions (correlation errors) measuring the deviations in time from the statistical independence of…
The present paper is devoted to the study of a simple model of interacting electrons in a random background. In a large interval $\Lambda$, we consider $n$ one dimensional particles whose evolution is driven by the Luttinger-Sy model, i.e.,…
We consider large uniform labeled random graphs in different classes with prescribed decorations in their modular decomposition. Our main result is the estimation of the number of copies of every graph as an induced subgraph. As a…
In two recent publications [Commun. PDE, vol.22, p.307--335 (1997), Commun. Math. Phys., vol.203, p.1--19 (1999)], A. Komech, M. Kunze and H. Spohn studied the joint dynamics of a classical point particle and a wave type generalization of…
We consider random sub-graphs of a fixed graph $G=(V,E)$ with large minimum degree. We fix a positive integer $k$ and let $G_k$ be the random sub-graph where each $v\in V$ independently chooses $k$ random neighbors, making $kn$ edges in…