6 citations · 10 across the 11 of their papers we have counts for
13 papers
Parameter estimation for graphon-interacting particle systems from discrete observations
Chiara Amorino, Matteo Sfragara
In this paper, we address the joint parameter estimation of drift and diffusion coefficients for heterogeneously interacting particle systems. Unlike the homogeneous setting, the i…
Surviving from the tip of a cone in competing first-passage percolation
Daniel Ahlberg, Maria Deijfen, Matteo Sfragara
In two-type first passage percolation on , two entities compete to capture the sites of the lattice. The entities spread between nearest neighbor sites at times speci…
The Ising Model on a Two-Community Stochastic Block Model
Alessandra Bianchi, Vanessa Jacquier, Matteo Sfragara
We study the Ising model on a two-community stochastic block model, where spins are split into two equal groups with inter-community interaction parameter . We pro…
Mean field stable matchings
Daniel Ahlberg, Maria Deijfen, Matteo Sfragara
Consider the complete bipartite graph on vertices where the edges are equipped with i.i.d. exponential costs. A matching of the vertices is stable if it does not contain any…
From stability to chaos in last-passage percolation
Daniel Ahlberg, Maria Deijfen, Matteo Sfragara
We study the transition from stability to chaos in a dynamic last passage percolation model on with random weights at the vertices. Given an initial weight configura…
Chaos, concentration and multiple valleys in first-passage percolation
Daniel Ahlberg, Maria Deijfen, Matteo Sfragara
A decade and a half ago Chatterjee established the first rigorous connection between anomalous fluctuations and a chaotic behaviour of the ground state in certain Gaussian disorder…
The winner takes it all but one
Maria Deijfen, Remco van der Hofstad, Matteo Sfragara
We study competing first passage percolation on graphs generated by the configuration model with infinite-mean degrees. Initially, two uniformly chosen vertices are infected with t…
Adding edge dynamics to bipartite random-access networks
Matteo Sfragara
We consider random-access networks with nodes representing transmitter-receiver pairs whose signals interfere with each other depending on their vicinity. Data packets arrive at th…
Large deviation principle for the maximal eigenvalue of inhomogeneous Erdős-Rényi random graphs
Arijit Chakrabarty, Rajat Subhra Hazra, Frank den Hollander +1
We consider an inhomogeneous Erdős-Rényi random graph with vertex set for which the pair of vertices , , is connected by an edge w…
Wireless random-access networks with bipartite interference graphs
Sem C. Borst, Frank den Hollander, Francesca R. Nardi +1
We consider random-access networks where nodes represent servers with a queue and can be either active or inactive. A node deactivates at unit rate, while it activates at a rate th…
Spectra of Adjacency and Laplacian Matrices of Inhomogeneous Erdős-Rényi Random Graphs
Arijit Chakrabarty, Rajat Subhra Hazra, Frank den Hollander +1
Inhomogeneous Erdős-Rényi random graphs on vertices in the non-dense regime are considered in this paper. The edge between the pair of vertices is retai…
Transition time asymptotics of queue-based activation protocols in random-access networks
Sem Borst, Frank den Hollander, Francesca R. Nardi +1
We consider networks where each node represents a server with a queue. An active node deactivates at unit rate. An inactive node activates at a rate that depends on its queue lengt…
The switch Markov chain for sampling irregular graphs and digraphs
Catherine Greenhill, Matteo Sfragara
The problem of efficiently sampling from a set of (undirected, or directed) graphs with a given degree sequence has many applications. One approach to this problem uses a simple Ma…