Related papers: Large Random Simplicial Complexes, III; The Critic…
We introduce appropriate definitions of dimensions in order to characterize the fractal properties of complex networks. We compute these dimensions in a hierarchically structured network of particular interest. In spite of the nontrivial…
The metric dimension of a graph $G$ is the minimum number of vertices in a subset $S$ of the vertex set of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $S$. In this paper we investigate the…
In statistical and nonlinear systems, two qualitatively distinct parameter regions are typically identified: the regular region, characterized by smooth behavior of key quantities, and the critical region, where these quantities exhibit…
A class of simplified measures is constructed to capture the key features of generic spatio-temporally chaotic systems. A combined analytical and numerical investigation allows us to extablish the scaling beahviour of the fractal dimension…
Critical points and singularities are encountered in the study of critical phenomena in probability and physics. We present recent results concerning the values of such critical points and the nature of the singularities for two prominent…
The existing estimation of the upper critical dimension of the Abelian Sandpile Model is based on a qualitative consideration of avalanches as self-avoiding branching processes. We find an exact representation of an avalanche as a sequence…
In recent years, there has been a growing recognition that higher-order structures are important features in real-world networks. A particular class of structures that has gained prominence is known as a simplicial complex. Despite their…
We study a classical spin model (more precisely a class of models) with O(N) symmetry that can be viewed as a simplified $D$ dimensional lattice model. It is equivalent to a non-translationinvariant one dimensional model and contains the…
This article presents the precise asymptotical distribution of two types of critical transmission radii, defined in terms of $k-$connectivity and the minimum vertex degree, for a random geometry graph distributed over a unit-volume region…
The diameter of a strongly connected $d$-dimensional simplicial complex is the diameter of its dual graph. We provide a probabilistic proof of the existence of $d$-dimensional simplicial complexes with diameter $ (\frac{1}{d \cdot d!} -…
One major open conjecture in the area of critical random graphs, formulated by statistical physicists, and supported by a large amount of numerical evidence over the last decade [23, 24, 28, 63] is as follows: for a wide array of random…
By analogy with Carleson's observation on Cardy's formula describing crossing probabilities for the scaling limit of critical percolation, we exhibit ``privileged geometries'' for Stochastic Loewner Evolutions with various parameters, for…
In this article we report a preliminary investigation of the large $N$ limit of a generalized one-matrix model which represents an $O(n)$ symmetric model on a random lattice. The model on a regular lattice is known to be critical only for…
We consider higher-dimensional generalizations of the normalized Laplacian and the adjacency matrix of graphs and study their eigenvalues for the Linial-Meshulam model $X^k(n,p)$ of random $k$-dimensional simplicial complexes on $n$…
Many real-world networks of interest are embedded in physical space. We present a new random graph model aiming to reflect the interplay between the geometries of the graph and of the underlying space. The model favors configurations with…
Structured high-cardinality data arises in many domains, and poses a major challenge for both modeling and inference. Graphical models are a popular approach to modeling structured data but they are unsuitable for high-cardinality…
We discuss the definition and measurability questions of random fractals and find under certain conditions a formula for upper and lower Minkowski dimensions. For the case of a random self-similar set we obtain the packing dimension.
The maximum likelihood threshold of a statistical model is the minimum number of datapoints required to fit the model via maximum likelihood estimation. In this paper we determine the maximum likelihood thresholds of generic linear…
The so-called diluted-random-cluster model may be viewed as a random-cluster representation of the Blume--Capel model. It has three parameters, a vertex parameter $a$, an edge parameter $p$, and a cluster weighting factor $q$. Stochastic…
We consider a model for random hypergraphs with identifiability, an analogue of connectedness. This model has a phase transition in the proportion of identifiable vertices when the underlying random graph becomes critical. The phase…