相关论文: The SIS process on Erd\"os-R\'enyi graphs: determi…

We study the Susceptible-Infectious-Susceptible (SIS) model on arbitrary networks. The well-established pair approximation treats neighboring pairs of nodes exactly while making a mean field approximation for the rest of the network. We…

We study the near-critical behavior of the sparse Erd\H{o}s-R\'enyi random graph $\mathcal{G}(n,p)$ on $n\gg1$ vertices, where the connection probability $p$ satisfies $np = 1+\theta(b_n^2/n)^{1/3}$, with $n^{3/10}\ll {b_n}\ll n^{1/2}$, and…

The problem of detecting edge correlation between two Erd\H{o}s-R\'enyi random graphs on $n$ unlabeled nodes can be formulated as a hypothesis testing problem: under the null hypothesis, the two graphs are sampled independently; under the…

We construct a compound Poisson process conditioned on its random summation that represents the sizes of the connected components in the sparse Erd\H{o}s-R\'enyi random graph $G(n,c/n)$. This new representation depicts a connection between…

We study the exploration of an Erd\"os-R\'enyi random graph by a respondent-driven sampling method, where discovered vertices reveal their neighbours. Some of them receive coupons to reveal in their turn their own neighbourhood. This leads…

We study the problem of detecting the edge correlation between two random graphs with $n$ unlabeled nodes. This is formalized as a hypothesis testing problem, where under the null hypothesis, the two graphs are independently generated;…

The problem of aligning Erd\"os-R\'enyi random graphs is a noisy, average-case version of the graph isomorphism problem, in which a pair of correlated random graphs is observed through a random permutation of their vertices. We study a…

In network-based SIS models of infectious disease transmission, infection can only occur between directly connected individuals. This constraint naturally gives rise to spatial correlations between the states of neighboring nodes, as the…

We investigate the SIR epidemic on a dynamic inhomogeneous Erd\H{o}s-R\'enyi random graph, in which vertices are of one of $k$ types and in which edges appear and disappear independently of each other. We establish a functional law of large…

We study atypical behavior in bootstrap percolation on the Erd\H{o}s-R\'enyi random graph. Initially a set $S$ is infected. Other vertices are infected once at least $r$ of their neighbors become infected. Janson et al. (2012) locates the…

Graph matching is an important problem in machine learning and pattern recognition. Herein, we present theoretical and practical results on the consistency of graph matching for estimating a latent alignment function between the vertex sets…

Motivated by an application in community detection, we consider an \ER random graph conditioned on the rare event that all connected components are fully connected. Such graphs can be considered as partitions of vertices into cliques.…

The susceptible--infected--susceptible (SIS) epidemic process on complex networks can show metastability, resembling an endemic equilibrium. In a general setting, the metastable state may involve a large portion of the network, or it can be…

We study the problem of robustly estimating the edge density of Erd\H{o}s-R\'enyi random graphs $G(n, d^\circ/n)$ when an adversary can arbitrarily add or remove edges incident to an $\eta$-fraction of the nodes. We develop the first…

In this paper, we consider the Ising model on random $d$-regular graphs (with $d\ge3$) and Erd\"os-R\'enyi graphs $G(n,d/n)$ (with $d>1$) at the critical temperature. We prove that the \textit{magnetization}, i.e.\ the sum of the spins of a…

This paper investigate the sparse multi-type Erd\H{o}s R\'enyi random graphs studied in S\"{o}derberg~\cite{soderberg2002general} and also Bollob\'as et al.~\cite{bollobas2007phase}. Although the corresponding central limit results are…

We study a well known noisy model of the graph isomorphism problem. In this model, the goal is to perfectly recover the vertex correspondence between two edge-correlated Erd\H{o}s-R\'{e}nyi random graphs, with an initial seed set of…

We study the diffusion of epidemics on networks that are partitioned into local communities. The gross structure of hierarchical networks of this kind can be described by a quotient graph. The rationale of this approach is that individuals…

Starting from a stochastic individual-based description of an SIS epidemic spreading on a random network, we study the dynamics when the size $n$ of the network tends to infinity. We recover in the limit an infinite-dimensional…

Denote by $A$ the adjacency matrix of an Erdos-Renyi graph with bounded average degree. We consider the problem of maximizing $\langle A-E\{A\},X\rangle$ over the set of positive semidefinite matrices $X$ with diagonal entries $X_{ii}=1$.…