Related papers: Sandpile Groups of Random Bipartite Graphs
The clique number of a random graph in the Erdos-Renyi model G(n,p) yields a random variable which is known to be asymptotically (as n tends to infinity) almost surely within one of an explicit logarithmic (on n) function r(n,p). We extend…
We consider the random geometric graph on $n$ vertices drawn uniformly from a $d$--dimensional sphere. We focus on the sparse regime, when the expected degree is constant independent of $d$ and $n$. We show that, when $d$ is larger than $n$…
Exchangeable random graphs serve as an important probabilistic framework for the statistical analysis of network data. In this work we develop an alternative parameterization for a large class of exchangeable random graphs, where the nodes…
We consider a random geometric hypergraph model based on an underlying bipartite graph. Nodes and hyperedges are sampled uniformly in a domain, and a node is assigned to those hyperedges that lie with a certain radius. From a modelling…
We introduce a new graph polynomial that encodes interesting properties of graphs, for example, the number of matchings and the number of perfect matchings. Most importantly, for bipartite graphs the polynomial encodes the number of…
We prove some asymptotic results for the radius and the profile of large random bipartite planar maps. Using a bijection due to Bouttier, Di Francesco and Guitter between rooted bipartite planar maps and certain two-type trees with positive…
Using exact numerical diagonalization, we investigate localization in two classes of random matrices corresponding to random graphs. The first class comprises the adjacency matrices of Erdos-Renyi (ER) random graphs. The second one…
We determine the large-genus limiting distribution of the 4-rank of the Picard group of hyperelliptic curves over a fixed finite field $\mathbb F_q$ of odd characteristic. This is a function field analogue of a result of Fouvry and…
In this paper, we study the task of detecting the edge dependency between two weighted random graphs. We formulate this task as a simple hypothesis testing problem, where under the null hypothesis, the two observed graphs are statistically…
We study the distribution of the set of copies of some given graph $H$ in the random graph $G(n,p)$, focusing on the case when $H = K_r$. Our main results capture the 'leading term' in the difference between this distribution and the…
In this paper we study the local law for eigenvalues of large random regular bipartite graphs with degree growing arbitrarily fast. We prove that the empirical spectral distribution of the adjacency matrix converges to a scaled down copy of…
We prove that the treewidth of an Erd\"{o}s-R\'{e}nyi random graph $\rg{n, m}$ is, with high probability, greater than $\beta n$ for some constant $\beta > 0$ if the edge/vertex ratio $\frac{m}{n}$ is greater than 1.073. Our lower bound…
In this article for a finite typed random geometric graph we define the empirical locality distribution, which records the number of nodes of a given type linked to a given number of nodes of each type. We find large deviation principle…
The sandpile group of a graph is a well-studied object that combines ideas from algebraic graph theory, group theory, dynamical systems, and statistical physics. A graph's sandpile group is part of a larger algebraic structure on the graph,…
In this paper, we apply the Turan sieve and the simple sieve developed by R. Murty and the first author to study problems in random graph theory. In particular, we obtain upper and lower bounds on the probability of a graph on n vertices…
Decomposable graphs are known for their tedious and complicated Markov update steps. Instead of modelling them directly, this work introduces a class of tree-dependent bipartite graphs that span the projective space of decomposable graphs.…
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.…
A probabilistic representation for a class of weighted $p$-radial distributions, based on mixtures of a weighted cone probability measure and a weighted uniform distribution on the Euclidean $\ell_p^n$-ball, is derived. Large deviation…
We analyze the distribution of unitarized L-polynomials Lp(T) (as p varies) obtained from a hyperelliptic curve of genus g <= 3 defined over Q. In the generic case, we find experimental agreement with a predicted correspondence (based on…
The purpose of this article is to introduce a new iterative algorithm with properties resembling real life bipartite graphs. The algorithm enables us to generate wide range of random bigraphs, which features are determined by a set of…