Related papers: Random hyperbolic graphs in $d+1$ dimensions
We introduce a formalism for computing bond percolation properties of a class of correlated and clustered random graphs. This class of graphs is a generalization of the Configuration Model where nodes of different types are connected via…
We study the emergence of loose Hamilton cycles in subgraphs of random hypergraphs. Our main result states that the minimum $d$-degree threshold for loose Hamiltonicity relative to the random $k$-uniform hypergraph $H_k(n,p)$ coincides with…
The overlap of a $d+1$ dimensional directed polymer of length $t$ in a random medium is studied using a Renormalization Group approach. In $d>2$ it vanishes at $T_c$ for $t\rightarrow \infty$ as $t^{\Sigma}$ where…
High-dimensional multiplex graphs are characterized by their high number of complementary and divergent dimensions. The existence of multiple hierarchical latent relations between the graph dimensions poses significant challenges to…
We discuss selected topics of current research interest in the theory of dynamical systems, with emphasis on dimension theory, multifractal analysis, and quantitative recurrence. The topics include the quantitative versus the qualitative…
We derive the finite size dependence of the clustering coefficient of scale-free random graphs generated by the configuration model with degree distribution exponent $2<\gamma<3$. Degree heterogeneity increases the presence of triangles in…
We study the fluctuations of subgraph counts in hyperbolic random geometric graphs on the $d$-dimensional Poincar\'e ball in the heterogeneous, heavy-tailed degree regime. In a hyperbolic random geometric graph whose vertices are given by a…
We prove the well posedness of a class of non linear and non local mixed hyperbolic-parabolic systems in bounded domains, with Dirichlet boundary conditions. In view of control problems, stability estimates on the dependence of solutions on…
We propose algorithms for construction and random generation of hypergraphs without loops and with prescribed degree and dimension sequences. The objective is to provide a starting point for as well as an alternative to Markov chain Monte…
We analyze site percolation on directed and undirected graphs with site-dependent open-site probabilities. We construct upper bounds on cluster susceptibilities, vertex connectivity functions, and the expected number of simple open cycles…
We present a new notion of limits of weighted directed graphs of growing size based on convergence of their random quotients. These limits are specified in terms of random exchangeable measures on the unit square. We call our limits…
We investigate the number of maximal cliques, i.e., cliques that are not contained in any larger clique, in three network models: Erd\H{o}s-R\'enyi random graphs, inhomogeneous random graphs (also called Chung-Lu graphs), and geometric…
Renormalization factors are most easily extracted by going to the massless limit of the quantum field theory and retaining only a single momentum scale. We derive factors and renormalized Green functions to all orders in perturbation theory…
A mixture of joint generalized hyperbolic distributions (MJGHD) is introduced for asymmetric clustering for high-dimensional data. The MJGHD approach takes into account the cluster-specific subspace, thereby limiting the number of…
We consider an infinite spatial inhomogeneous random graph model with an integrable connection kernel that interpolates nicely between existing spatial random graph models. Key examples are versions of the weight-dependent random connection…
We present here random distributions on $(D+1)$-edge-colored, bipartite graphs with a fixed number of vertices $2p$. These graphs are dual to $D$-dimensional orientable colored complexes. We investigate the behavior of quantities related to…
In this note we analyze two algorithms, one for producing a matching and one for an independent set, on $k$-uniform $d$-regular hypergraphs of large girth. As a result we obtain new lower bounds on the size of a maximum matching or…
Given a dense countable set in a metric space, the infinite random geometric graph is the random graph with the given vertex set and where any two points at distance less than 1 are connected, independently, with some fixed probability. It…
We prove a general criterion for a metric space to have conformal dimension one. The conditions are stated in terms of the existence of enough local cut points in the space. We then apply this criterion to the boundaries of hyperbolic…
We consider a random geometric graph with vertices sampled from a probability measure supported on $\mathbb R^d$, and study its connectivity. We show the graph is typically disconnected, unless the sampling density has superexponential…