Related papers: Spectral Bounds in Random Graphs Applied to Spread…
This paper investigates the nonasymptotic properties of the spectral norm of some random matrices with independent columns. In particular, we consider an $m\times n$ random matrix $BA$, where $A$ is an $N\times n$ random matrix with…
We study the level spacing distribution p(s) in the spectrum of random networks. According to our numerical results, the shape of p(s) in the Erdos-Renyi (E-R) random graph is determined by the average degree <k>, and p(s) undergoes a…
Let $\log^Cn\le d\le n/2$ for a sufficiently large constant $C>0$ and let $A_n$ denote the adjacency matrix of a uniform random $d$-regular directed graph on $n$ vertices. We prove that as $n$ tends to infinity, the empirical spectral…
We give an effective bound of the joint spectral radius $\rho(\Sigma)$ for a finite set $\Sigma$ of nonnegative matrices: For every $n$, \[ \sqrt[n]{\left(\frac{V}{UD}\right)^{D} \max_C \max_{i,j\in C} \max_{A_1,\dots,A_n\in\Sigma}(A_1\dots…
Epidemic spreading can be suppressed by the introduction of containment measures such as social distancing and lock downs. Yet, when such measures are relaxed, new epidemic waves and infection cycles may occur. Here we explore this issue in…
In this paper, we are concerned with SIR epidemics in a random environment on complete graphs, where every edges are assigned with i.i.d. weights. Our main results give large and moderate deviation principles of sample paths of this model.
Random graphs defined by an occurrence probability that is invariant under node aggregation have been identified recently in the context of network renormalization. The invariance property requires that edges are drawn with a specific…
Random Threshold Networks with sparse, asymmetric connections show complex dynamical behavior similar to Random Boolean Networks, with a transition from ordered to chaotic dynamics at a critical average connectivity $K_c$. In this type of…
We examine the heterogeneous responses of individual nodes in sparse networks to the random removal of a fraction of edges. Using the message-passing formulation of percolation, we discover considerable variation across the network in the…
We consider a class of random loop models (including the random interchange process) that are parametrised by a time parameter $\beta\geq 0$. Intuitively, larger $\beta$ means more randomness. In particular, at $\beta=0$ we start with loops…
In this paper we consider a model for the spread of a stochastic SIR (Susceptible $\to$ Infectious $\to$ Recovered) epidemic on a network of individuals described by a random intersection graph. Individuals belong to a random number of…
How does the chromatic number of a graph chosen uniformly at random from all graphs on $n$ vertices behave? This quantity is a random variable, so one can ask (i) for upper and lower bounds on its typical values, and (ii) for bounds on how…
We study the growth of random networks under a constraint that the diameter, defined as the average shortest path length between all nodes, remains approximately constant. We show that if the graph maintains the form of its degree…
The study of random graphs has become very popular for real-life network modeling such as social networks or financial networks. Inhomogeneous long-range percolation (or scale-free percolation) on the lattice $\mathbb Z^d$, $d\ge1$, is a…
The spectral radius of the adjacency matrix can impact both algorithmic efficiency as well as the stability of solutions to an underlying dynamical process. Although much research has considered the distribution of the spectral radius for…
Using spectral embedding based on the signless Laplacian, we obtain bounds on the spectrum of transition matrices on graphs. As a consequence, we bound return probabilities and the uniform mixing time of simple random walk on graphs. In…
The coherence of a random matrix, which is defined to be the largest magnitude of the Pearson correlation coefficients between the columns of the random matrix, is an important quantity for a wide range of applications including…
We give variants of the Krein bound and the absolute bound for graphs with a spectrum similar to that of a strongly regular graph. In particular, we investigate what we call approximately strongly regular graphs. We apply our results to…
In this paper, we derive nearly tight probabilistic norm bounds for a class of random matrices we call graph matrices. While the classical case of symmetric matrices with independent random entries (Wigner's matrices) is a special case, in…
We consider a spatial model related to bond percolation for the spread of a disease that includes variation in the susceptibility to infection. We work on a lattice with random bond strengths and show that with strong disorder, i.e. a wide…