相关论文: Random Variables in Graph W*-Probability Spaces

We consider random graphs with a given degree sequence and show, under weak technical conditions, asymptotic normality of the number of components isomorphic to a given tree, first for the random multigraph given by the configuration model…

Random graphs offer a useful mathematical representation of a variety of real world complex networks. Exponential random graphs, for example, are particularly suited towards generating random graphs constrained to have specified statistical…

We explore the recently introduced local-triviality dimensions by studying gauge actions on graph $C^*$-algebras, as well as the restrictions of the gauge action to finite cyclic subgroups. For $C^*$-algebras of finite acyclic graphs and…

Random graphs with a given degree sequence are often constructed using the configuration model, which yields a random multigraph. We may adjust this multigraph by a sequence of switchings, eventually yielding a simple graph. We show that,…

In this article, we discuss the composite likelihood estimation of sparse Gaussian graphical models. When there are symmetry constraints on the concentration matrix or partial correlation matrix, the likelihood estimation can be…

Using diagrammatic techniques, we provide explicit functional relations between the cumulant generating functions for the biunitarily invariant ensembles in the limit of large size of matrices. The formalism allows to map two distinct areas…

Random graphs have proven to be one of the most important and fruitful concepts in modern Combinatorics and Theoretical Computer Science. Besides being a fascinating study subject for their own sake, they serve as essential instruments in…

This paper studies higher index theory for a random sequence of bounded degree, finite graphs with diameter tending to infinity. We show that in a natural model for such random sequences the following hold almost surely: the coarse…

We study the intersection of a random geometric graph with an Erd\H{o}s-R\'enyi graph. Specifically, we generate the random geometric graph $G(n, r)$ by choosing $n$ points uniformly at random from $D=[0, 1]^2$ and joining any two points…

We consider Reinforced Random Walks where transition probabilities are a function of the proportion of times the walk has traversed an edge. We give conditions for recurrence or transience. A phase transition is observed, similar to…

In this paper a subset of High-Dimensional Random Apollonian networks, that we called Wheel Random Apollonian Graphs (WRAG), is considered. We show how to generate a Wheel Random Apollonian Graph from a wheel graph. We analyse some basic…

We study random exponential sums of the form $\sum_{k=1}^nX_k\times\ex p\{i(\lambda_k^{(1)}t_1+...+\lambda_k^{(s)}t_s)\}$, where $\{X_n\}$ is a sequence of random variables and $\{\lambda_n^{(i)}:1\leq i\leq s\}$ are sequences of real…

We investigate the dynamic formation of regular random graphs. In our model, we pick a pair of nodes at random and connect them with a link if both of their degrees are smaller than d. Starting with a set of isolated nodes, we repeat this…

Random graphs are more and more used for modeling real world networks such as evolutionary networks of proteins. For this purpose we look at two different models and analyze how properties like connectedness and degree distributions are…

We consider the number of crossings in a graph which is embedded randomly on a convex set of points. We give an estimate to the normal distribution in Kolmogorov distance which implies a convergence rate of order $n^{-1/2}$ for various…

We study the random graph G_{n,\lambda/n} conditioned on the event that all vertex degrees lie in some given subset S of the non-negative integers. Subject to a certain hypothesis on S, the empirical distribution of the vertex degrees is…

We study the structure of the asymptotic expansion of the probability that a combinatorial object is connected. We show that the coefficients appearing in those asymptotics are integers and can be interpreted as the counting sequences of…

We consider the random hypergraph on a finite vertex set by choosing each set of vertices as an hyperedge independently at random. We express the probability distributions of the (lower-)associated simplicial complex and the…

In this paper, we study Dirac-type theorems for an inhomogenous random graph (G) whose edge probabilities are not necessarily all the same. We obtain sufficient conditions for the existence of Hamiltonian paths and perfect matchings, in…

We introduce probability-graphons which are probability kernels that generalize graphons to the case of weighted graphs. Probability-graphons appear as the limit objects to study sequences of large weighted graphs whose distribution of…