Related papers: On the tightness of graph-based statistics
The goal of this paper is to provide a general purpose result for the coupling of exploration processes of random graphs, both undirected and directed, with their local weak limits when this limit is a marked Galton-Watson process. This…
Let $G=(V, E)$ be a given edge-weighted graph and let its {\em realization} $\mathcal{G}$ be a random subgraph of $G$ that includes each edge $e \in E$ independently with probability $p$. In the {\em stochastic matching} problem, the goal…
We consider the problem of graph generation guided by network statistics, i.e., the generation of graphs which have given values of various numerical measures that characterize networks, such as the clustering coefficient and the number of…
A dynamical system of points moving along the edges of a graph could be considered as a geometrical discrete dynamical system or as a discrete version of a quantum graph with localized wave packets. We study the set of such systems over…
We consider the limiting behavior of the count of subgraphs isomorphic to a graph $G$ with $m\geq 0$ fixed endpoints (or roots) in the random-connection model, as the intensity $\lambda$ of the underlying Poisson point process tends to…
Our main results are quantitative bounds in the multivariate normal approximation of centred subgraph counts in random graphs generated by a general graphon and independent vertex labels. We are interested in these statistics because they…
Let $G$ be a graph and ${\mathcal{\tau}}: V(G)\rightarrow \Bbb{N}\cup \{0\}$ be an assignment of thresholds to the vertices of $G$. A subset of vertices $D$ is said to be a dynamic monopoly corresponding to $(G, \tau)$ if the vertices of…
Finding important edges in a graph is a crucial problem for various research fields, such as network epidemics, signal processing, machine learning, and sensor networks. In this paper, we tackle the problem based on sampling theory on…
We study the graphs formed from instances of the stable matching problem by connecting pairs of elements with an edge when there exists a stable matching in which they are matched. Our results include the NP-completeness of recognizing…
In this work, we investigate the analysis of generators for dynamic graphs, which are defined as graphs whose topology changes over time. We introduce a novel concept, called ''sustainability,'' to qualify the long-term evolution of dynamic…
The generalised random graph contains $n$ vertices with positive i.i.d. weights. The probability of adding an edge between two vertices is increasing in their weights. We require the weight distribution to have finite second moments and…
Graphs are used to represent and analyze data in domains as diverse as physics, biology, chemistry, planetary science, and the social sciences. Across domains, random graph models relate generative processes to expected graph properties,…
How do real graphs evolve over time? What are ``normal'' growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying properties in a single snapshot of a large…
Dynamic graph datasets often exhibit strong temporal patterns, such as recency, which prioritizes recent interactions, and popularity, which favors frequently occurring nodes. We demonstrate that simple heuristics leveraging only these…
The spectral properties of traditional (dyadic) graphs, where an edge connects exactly two vertices, are widely studied in different applications. These spectral properties are closely connected to the structural properties of dyadic…
We consider the problem of high-dimensional Gaussian graphical model selection. We identify a set of graphs for which an efficient estimation algorithm exists, and this algorithm is based on thresholding of empirical conditional…
In this article, we revisit and expand our prior work on graph similarity. As with our earlier work, we focus on a view of similarity which does not require node correspondence between graphs under comparison. Our work is suited to the…
We obtain upper bounds (in most cases, sharp) for the hitting times of random walks on finite undirected graphs expressed as functions of the graph's number of edges. In particular, we show that the maximum hitting time for a simple random…
A typical result in graph theory says that a graph $G$, satisfying certain conditions, has some property $\cal P$. Once such a theorem is established, it is natural to ask how strongly $G$ satisfies $\cal P$. Can one strengthen the result…
We study the problem of detecting the presence of an underlying high-dimensional geometric structure in a random graph. Under the null hypothesis, the observed graph is a realization of an Erd\H{o}s-R\'enyi random graph $G(n,p)$. Under the…