Related papers: Sharp threshold functions for the random intersect…
We discuss the property of (almost) complete intersection of LSS-ideals of graphs of some special forms, like trees, unicyclic, and bicyclic graphs. Further, we give a sufficient condition for the complete intersection property of twisted…
Graph signals are functions of the underlying graph. When the edge-weight between a pair of nodes is high, the corresponding signals generally have a higher correlation. As a result, the signals can be represented in terms of a graph-based…
We present a graph theory-based method to characterise flow defects and structural shifts in condensed matter. We explore the connection between dynamical properties, particularly the recently introduced concept of ''softness'', and…
The paper addresses the graph classification problem and introduces a modification of the lazy associative classification method to efficiently handle intersections of graphs. Graph intersections are approximated with all common subgraphs…
Conformal prediction provides rigorous, distribution-free uncertainty guarantees, but often yields prohibitively large prediction sets in structured domains such as routing, planning, or sequential recommendation. We introduce "graph-based…
We identify the scaling limit of random intersection graphs inside their critical windows. The limit graphs vary according to the clustering regimes, and coincide with the continuum Erdos--Renyi graph in two out of the three regimes. Our…
Let $\mathcal{V}$ and $\mathcal{U}$ be the point sets of two independent homogeneous Poisson processes on $\mathbb{R}^d$. A graph $\mathcal{G}_\mathcal{V}$ with vertex set $\mathcal{V}$ is constructed by first connecting pairs of points…
Complex systems frequently exhibit multi-way, rather than pairwise, interactions. These group interactions cannot be faithfully modeled as collections of pairwise interactions using graphs and instead require hypergraphs. However, methods…
Let $G$ be a graph obtained as the union of some $n$-vertex graph $H_n$ with minimum degree $\delta(H_n)\geq\alpha n$ and a $d$-dimensional random geometric graph $G^d(n,r)$. We investigate under which conditions for $r$ the graph $G$ will…
We establish a threshold for the connectivity of certain random graphs whose (dependent) edges are determined by the uniform distributions on generalized Orlicz balls, crucially using their negative correlation properties. We also show the…
We investigate the appearance of the square of a Hamilton cycle in the model of randomly perturbed graphs, which is, for a given $\alpha \in (0,1)$, the union of any $n$-vertex graph with minimum degree $\alpha n$ and the binomial random…
We study the intersection numbers defined on twisted homology or cohomology groups that are associated with hypergeometric integrals corresponding to degenerate hyperplane arrangements in the projective $k$-space. We present formulas to…
We present a new paradigm for creating random features to approximate bi-variate functions (in particular, kernels) defined on general manifolds. This new mechanism of Manifold Random Features (MRFs) leverages discretization of the manifold…
Identifying the underlying models in a set of data points contaminated by noise and outliers, leads to a highly complex multi-model fitting problem. This problem can be posed as a clustering problem by the projection of higher order…
The study of substructures in random objects has a long history, beginning with Erd\H{o}s and R\'enyi's work on subgraphs of random graphs. We study the existence of certain substructures in random subsets of vector spaces over finite…
For two correlated graphs which are independently sub-sampled from a common Erd\H{o}s-R\'enyi graph $\mathbf{G}(n, p)$, we wish to recover their \emph{latent} vertex matching from the observation of these two graphs \emph{without labels}.…
We propose a new cross-correlation method that can recognize independent realizations of the same type of stochastic processes and can be used as a new kind of pattern recognition tool in biometrics, sensing, forensic, security and image…
We study thresholds for the appearance of a 2-core in random hypergraphs that are a mixture of a constant number of random uniform hypergraphs each with a linear number of edges but with different edge sizes. For the case of two overlapping…
We associate all small subgraph counting problems with a systematic graph encoding/representation system which makes a coherent use of graphlet structures. The system can serve as a unified foundation for studying and connecting many…
For positive integers $n$ and $k$ with $n\geq 2k+1$, the Kneser graph $K(n,k)$ is the graph with vertex set consisting of all $k$-sets of $\{1,\dots,n\}$, where two $k$-sets are adjacent exactly when they are disjoint. The independent sets…