Related papers: Random Variables in Graph W*-Probability Spaces
We present and investigate an extension of the classical random graph to a general class of inhomogeneous random graph models, where vertices come in different types, and the probability of realizing an edge depends on the types of its…
In this paper, we study rare events in spherical and Gaussian random geometric graphs in high dimensions. In these models, the vertices correspond to points sampled uniformly at random on the $d$ dimensional unit sphere or correspond to $d$…
We develop further the graph limit theory for dense weighted graph sequences. In particular, we consider probability graphons, which have recently appeared in graph limit theory as continuum representations of weighted graphs, and we…
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a truly random one. In the context of graphs, Chung, Graham, and Wilson…
We prove that unital graph C*-algebras often admit a convenient decomposition into amalgamated free products. We use this to give a complete characterization of when a unital graph C*-algebra is residually finite-dimensional and when it is…
Consider a random graph process where vertices are chosen from the interval $[0,1]$, and edges are chosen independently at random, but so that, for a given vertex $x$, the probability that there is an edge to a vertex $y$ decreases as the…
Some tools and ideas are interchanged between random matrix theory and multivariate statistics. In the context of the random matrix theory, classes of spherical and generalised Wishart random matrix ensemble, containing as particular cases…
Originating from a system theory and an input/output point of view, I introduce a new class of generalized distributions. A parametric nonlinear transformation converts a random variable $X$ into a so-called Lambert $W$ random variable $Y$,…
This paper concerns the asymptotic behavior of a random variable $W_\lambda$ resulting from the summation of the functionals of a Gibbsian spatial point process over windows $Q_\lambda \uparrow R^d$. We establish conditions ensuring that…
We introduce a natural generalization of the Erd\H{o}s-R\'enyi random graph model in which random instances of a fixed motif are added independently. The binomial random motif graph $G(H,n,p)$ is the random (multi)graph obtained by adding…
There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable minor-closed class, such as the class of all planar graphs. Here we use combinatorial and probabilistic methods to investigate a…
In this thesis, which is supervised by Dr. David Penman, we examine random interval graphs. Recall that such a graph is defined by letting $X_{1},\ldots X_{n},Y_{1},\ldots Y_{n}$ be $2n$ independent random variables, with uniform…
Recent work in graph models has found that probabilistic hyperedge replacement grammars (HRGs) can be extracted from graphs and used to generate new random graphs with graph properties and substructures close to the original. In this paper,…
In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…
In the first part of this paper, we consider weighted domination in the case where the vertices of the complete graph on~\(n\) vertices are equipped with independent and identically distributed (i.i.d.) weights. We use the probabilistic…
We study the spatial Gibbs random graphs introduced in [MV16] from the point of view of local convergence. These are random graphs embedded in an ambient space consisting of a line segment, defined through a probability measure that favors…
This is an extended version of the thesis presented to the Programa de P\'os-Gradua\c{c}\~ao em Matem\'atica of the Departamento de Matem\'atica, PUC-Rio, in September 2013, incorporating some suggestions from the examining commission.…
In this article, we study random graphs with a given degree sequence $d_1, d_2, \cdots, d_n$ from the configuration model. We show that under mild assumptions of the degree sequence, the spectral distribution of the normalized Laplacian…
What is the probability that a random UHF algebra is of infinite type? What is the probability that a random simple AI algebra has at most $k$ extremal traces? What is the expected value of the radius of comparison of a random…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…