Related papers: On Sharp Thresholds in Random Geometric Graphs
In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yuster proved the following result on quasi-randomness of…
A random geometric graph $G(\mathcal{X}_n, r_n)$ is formed by taking a binomial process $\mathcal{X}_n$ as the set of vertices and joining any two distinct points with an edge if they lie within distance $r_n$ of each other. We investigate…
A graph is a $k$-threshold graph with thresholds $\theta_1, \theta_2, \dots, \theta_k$ if we can assign a real number $r_v$ to each vertex $v$ such that for any two distinct vertices $u$ and $v$, $uv$ is an edge if and only if the number of…
We explore extreme value phenomena in spatial scale-free random graphs in a continuum setting based on a homogeneous Poisson point process in $\mathbb{R}^d$. Vertices carry i.i.d. weights $(W_x)$ and, conditionally on the vertex set and the…
We provide a simplified proof of the random $k$-XORSAT satisfiability threshold theorem. As an extension we also determine the full rank threshold for sparse random matrices over finite fields with precisely $k$ non-zero entries per row.…
Parameter-dependent statistical properties of spectra of totally connected irregular quantum graphs with Neumann boundary conditions are studied. The autocorrelation functions of level velocities c(x) and c(w,x) as well as the distributions…
We analyse uniformly random proper $k$-colourings of sparse graphs with maximum degree $\Delta$ in the regime $\Delta < k\ln k $. This regime corresponds to the lower side of the shattering threshold for random graph colouring, a…
k-connectivity of random graphs is a fundamental property indicating reliability of multi-hop wireless sensor networks (WSN). WSNs comprising of sensor nodes with limited power resources are modeled by random graphs with unreliable nodes,…
In this paper we study the behavior of maximum out/in-degree of binomial/Poisson random scaled sector graphs in the presence of random vertex and edge faults. We prove that the probability distribution of maximum degrees for random faulty…
It is well known that there is a sharp density threshold for a random $r$-SAT formula to be satisfiable, and a similar, smaller, threshold for it to be satisfied by the pure literal rule. Also, above the satisfiability threshold, where a…
The Kuramoto model can be formulated as a gradient flow on a nonconvex energy landscape of the form $E(\boldsymbol{\theta}) := \frac{1}{2} \sum_{1\le i,j\le n} A_{ij}\bigl(1-\cos(\theta_i-\theta_j)\bigr).$ A fundamental question is to…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
We study topological and geometric functionals of $l_\infty$-random geometric graphs on the high-dimensional torus in a sparse regime, where the expected number of neighbors decays exponentially in the dimension. More precisely, we…
Random $k$-SAT is the single most intensely studied example of a random constraint satisfaction problem. But despite substantial progress over the past decade, the threshold for the existence of satisfying assignments is not known precisely…
We establish the conditions under which several algorithmically exploitable structural features hold for random intersection graphs, a natural model for many real-world networks where edges correspond to shared attributes. Specifically, we…
This paper investigates the addition of random edges to arbitrary dense graphs; in particular, we determine the number of random edges required to ensure various monotone properties including the appearance of a fixed size clique, small…
The $k$-core of a graph is the largest subgraph of minimum degree at least $k$. We show that for $k$ sufficiently large, the $(k + 2)$-core of a random graph $\G(n,p)$ asymptotically almost surely has a spanning $k$-regular subgraph. Thus…
Let $d\geq 3$ be a constant and let $F$ be a $d$-regular graph on $[n]$ with not too many symmetries. By the union bound, the probability threshold for the existence of a spanning subgraph in $G(n,p)$ isomorphic to $F$ is at least…
We explore algebraic and spectral properties of weighted graphs containing twin vertices that are useful in quantum state transfer. We extend the notion of adjacency strong cospectrality to arbitrary Hermitian matrices, with focus on the…