Related papers: Large Random Simplicial Complexes, III; The Critic…
In this manuscript, we provide a concise review of the concept of metric dimension for both deterministic as well as random graphs. Algorithms to approximate this quantity, as well as potential applications, are also reviewed. This work has…
The notion of Laplacian of a graph can be generalized to simplicial complexes and hypergraphs, and contains information on the topology of these structures. Even for a graph, the consideration of associated simplicial complexes is…
In this talk I review some of the recent developments in the field of random surfaces and the Dynamical Triangulation approach to simplicial quantum gravity. In two dimensions I focus on the c=1 barrier and the fractal dimension of…
Homogeneous random fractals form a probabilistic extension of self-similar sets with more dependencies than in random recursive constructions. For such random fractals we consider mean values of the Lipschitz-Killing curvatures of their…
The past two decades have seen significant successes in our understanding of complex networked systems, from the mapping of real-world social, biological and technological networks to the establishment of generative models recovering their…
In this article we introduce a simple tool to derive polynomial upper bounds for the probability of observing unusually large maximal components in some models of random graphs when considered at criticality. Specifically, we apply our…
We introduce a novel operator to describe a random walk process on a simplicial complex. Walkers are allowed to wonder across simplices of various dimensions, bridging nodes to edges, and edges to triangles, via a nested organization that…
The large-N saddle-point equations for the principal chiral models defined on a d-1 dimensional simplex are derived from the external field problem for unitary integrals. The saddle point equation are studied analytically and numerically in…
We simulate the bond and site percolation models on several three-dimensional lattices, including the diamond, body-centered cubic, and face-centered cubic lattices. As on the simple-cubic lattice [Phys. Rev. E, \textbf{87} 052107 (2013)],…
Higher order interactions are increasingly recognised as a fundamental aspect of complex systems ranging from the brain to social contact networks. Hypergraph as well as simplicial complexes capture the higher-order interactions of complex…
The phenomenon of scale dependent spectral dimension has attracted special interest in the quantum gravity community over the last eight years. It was first observed in computer simulations of the causal dynamical triangulation (CDT)…
We study the homological properties of random simplicial complexes. In particular, we obtain the asymptotic behavior of lifetime sums for a class of increasing random simplicial complexes; this result is a higher-dimensional counterpart of…
We study bootstrap percolation processes on random simplicial complexes of some fixed dimension $d \geq 3$. Starting from a single simplex of dimension $d$, we build our complex dynamically in the following fashion. We introduce new…
Consider the critical long-range percolation on $\mathbb{Z}$, where an edge connects $i$ and $j$ independently with probability $1-\exp\{-\beta\int_i^{i+1}\int_j^{j+1}|u-v|^{-2}d ud v\}$ for $|i-j|>1$ for some fixed $\beta>0$ and with…
This work will appear as a chapter in a forthcoming volume titled "Topics in Probabilistic Graph Theory". A theory of scaling limits for random graphs has been developed in recent years. This theory gives access to the large-scale geometric…
The effect of blocking between different species occurring in one dimension is investigated here numerically in the case of particles following branching and annihilating random walk with two offsprings. It is shown that two-dimensional…
Motivated by the recent interest in the criticality of open quantum many-body systems, we study nonlinear sigma models with complexified couplings as a general framework for nonunitary field theory. Applying the perturbative…
The spatial coverage produced by a single discrete-time random walk, with asymmetric jump probability $p\neq 1/2$ and non-uniform steps, moving on an infinite one-dimensional lattice is investigated. Analytical calculations are complemented…
Clique complexes of Erd\H{o}s-R\'{e}nyi random graphs with edge probability between $n^{-{1\over 3}}$ and $n^{-{1\over 2}}$ are shown to be aas not simply connected. This entails showing that a connected two dimensional simplicial complex…
Simplicial complexes are generalized network structures able to encode interactions occurring between more than two nodes. Simplicial complexes describe a large variety of complex interacting systems ranging from brain networks, to social…