Related papers: Random Variables in Graph W*-Probability Spaces

We consider 15 properties of labeled random graphs that are of interest in the graph-theoretical and the graph mining literature, such as clustering coefficients, centrality measures, spectral radius, degree assortativity, treedepth,…

For a given permutation $\pi_n$ in $S_n$, a random permutation graph is formed by including an edge between two vertices $i$ and $j$ if and only if $(i - j) (\pi_n(i) - \pi_n (j)) < 0$. In this paper, we study various statistics of random…

If a vertex $v$ in a graph $G$ has degree larger than the average of the degrees of its neighbors, we call it a groupie in $G$. In the current work, we study the behavior of groupie in random multipartite graphs with the link probability…

This is a brief review of our recent work attempted at a generalization of the Grassmann algebra to the paragrassmann ones. The main aim is constructing an algebraic basis for representing `fractional' symmetries appearing in $2D$…

In this paper, we study the summability properties of double sequences of real constants which map sequences of random variables to sequences of random variables that are defined on the same probability sample space. We show that a regular…

An algorithm observes the trajectories of random walks over an unknown graph $G$, starting from the same vertex $x$, as well as the degrees along the trajectories. For all finite connected graphs, one can estimate the number of edges $m$ up…

We find conditions for the connectivity of inhomogeneous random graphs with intermediate density. Our results generalize the classical result for G(n, p), when p = c log n/n. We draw n independent points X_i from a general distribution on a…

Right multiplication operators $R_w: l_2G \rightarrow l_2G$, $w \in \C[G]$, are interpreted as random-walk operators on labelled graphs that are analogous to Cayley graphs. Applying a generalization of the graph convergence defined by R.…

There has been quite some activity and progress concerning spectral asymptotics of random operators that are defined on percolation subgraphs of different types of graphs. In this short survey we record some of these results and explain the…

Graph-theoretic methods have seen wide use throughout the literature on multi-agent control and optimization. When communications are intermittent and unpredictable, such networks have been modeled using random communication graphs. When…

In this paper we relate a fundamental parameter of a random graph, its degree sequence, to a simple model of nearly independent binomial random variables. This confirms a conjecture made in 1997. As a result, many interesting functions of…

Consider a graph on randomly scattered points in an arbitrary space, with two points $x,y$ connected with probability $\phi(x,y)$. Suppose the number of points is large but the mean number of isolated points is $O(1)$. We give general…

Random planar graphs have been the subject of much recent work. Many basic properties of the standard uniform random planar graph P_{n}, by which we mean a graph chosen uniformly at random from the set of all planar graphs with vertex set…

We provide a complete characterization of those graphons $W$ for which the inhomogeneous random graph $G(n,W)$ is asymptotically almost surely Hamiltonian. The characterization involves three conditions. Two of them constitute the…

We study logical limit laws for uniform attachment random graphs. In this random graph model, vertices and edges are introduced recursively: at time $n+1$, the vertex $n+1$ is introduced together with $m$ edges joining the new vertex with…

We characterize semicircular distribution by the freeness of linear and quadratic forms in noncommutative random variables from a tracial $W^*$-probability space with relaxed moment conditions.

We study a recent model for edge exchangeable random graphs introduced by Crane and Dempsey; in particular we study asymptotic properties of the random simple graph obtained by merging multiple edges. We study a number of examples, and show…

Let $A$ be a partial *-algebra endowed with a topology $\tau$ that makes it into a locally convex topological vector space $A[\tau]$. Then $A$ is called a topological partial *-algebra if it satisfies a number of conditions, which all…

In this paper we show how to use simple partitioning lemmas in order to embed spanning graphs in a typical member of $G(n,p)$. Let the \emph{maximum density} of a graph $H$ be the maximum average degree of all the subgraphs of $H$. First,…

We prove a number of results to the effect that generic quantum graphs (defined via operator systems as in the work of Duan-Severini-Winter / Weaver) have few symmetries: for a Zariski-dense open set of tuples $(X_1,\cdots,X_d)$ of…