6 papers · 1 filter
Transitivity in Inhomogeneous Random Tournaments
Sayak Chatterjee, Bhaswar B. Bhattacharya
Paired-comparison data are naturally represented by tournaments, where transitivity corresponds to the existence of a global ranking consistent with all pairwise outcomes. Accordin…
Asymptotic Normality of Subgraph Counts in Sparse Inhomogeneous Random Graphs
Sayak Chatterjee, Anirban Chatterjee, Abhinav Chakraborty +1
In this paper, we derive the asymptotic distribution of the number of copies of a fixed graph in a random graph sampled from a sparse graphon model. Specifically, we prov…
Thresholds and Fluctuations of Submultiplexes in Random Multiplex Networks
Bhaswar B. Bhattacharya, Sanchayan Bhowal, Karambir Das +2
In a multiplex network a common set of nodes is connected through different types of interactions, each represented as a separate graph (layer) within the network. In this paper, w…
Multiplexons: Limits of Multiplex Networks
Ankan Ganguly, Bhaswar B. Bhattacharya
In a multiplex network, a set of nodes is connected by different types of interactions, each represented as a separate layer within the network. Multiplexes have emerged as a key i…
Monochromatic Subgraphs in Randomly Colored Dense Multiplex Networks
Mauricio Daros Andrade, Bhaswar B. Bhattacharya
Given a sequence of graphs and a fixed graph , denote by the number of monochromatic copies of the graph in a uniformly random -coloring of the vertices…
Joint Poisson Convergence of Monochromatic Hyperedges in Multiplex Hypergraphs
Yangxinyu Xie, Bhaswar B. Bhattacharya
Given a sequence of -uniform hypergraphs , denote by the number of monochromatic hyperedges when the vertices of are colored uniformly at random with $c = c_…