Related papers: On the hyperbolicity constant of circular-arc grap…
Introduced the quantitative measure of the structural complexity of the graph (complex network, etc.) based on a procedure similar to the renormalization process, considering the difference between actual and averaged graph structures on…
We give the asymptotic growth of the number of (multi-)arcs of bounded length between boundary components on complete finite-area hyperbolic surfaces with boundary. Specifically, if $S$ has genus $g$, $n$ boundary components and $p$…
We study intersection properties of two or more independent tree-like random graphs. Our setting encompasses critical, possibly long range, Bernoulli percolation clusters, incipient infinite clusters, as well as critical branching random…
We analyze the properties of degree-preserving Markov chains based on elementary edge switchings in undirected and directed graphs. We give exact yet simple formulas for the mobility of a graph (the number of possible moves) in terms of its…
Given an infinite connected graph $G$, a way to randomly perturb its metric is to assign random i.i.d. lengths to the edges of the graph, a process called first-passage percolation. Assume that the graph is infinite and of bounded degree.…
Graphs are fundamental tools for modeling pairwise interactions in complex systems. However, many real-world systems involve multi-way interactions that cannot be fully captured by standard graphs. Hypergraphs, which generalize graphs by…
Random hyperbolic graphs were recently introduced by Krioukov et. al. [KPKVB10] as a model for large networks. Gugelmann, Panagiotou, and Peter [GPP12] then initiated the rigorous study of random hyperbolic graphs using the following model:…
We study different geometric properties on infinite graphs, related to the weak-type boundedness of the Hardy-Littlewood maximal averaging operator. In particular, we analyze the connections between the doubling condition, having finite…
Through detailed analysis of scores of publicly available data sets corresponding to a wide range of large-scale networks, from communication and road networks to various forms of social networks, we explore a little-studied geometric…
The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppstein [Separating thickness from geometric thickness. In: Towards a…
We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs. In addition, we give estimates for number…
This is an expository article on visual metrics on boundaries of hyperbolic metric spaces. We discuss the construction of visual metrics, quasisymmetries and their invariants, Hausdorff and conformal dimension, and constructions and…
Let $G$ be a finite, connected graph. The eccentricity of a vertex $v$ of $G$ is the distance from $v$ to a vertex farthest from $v$. The average eccentricity of $G$ is the arithmetic mean of the eccentricities of the vertices of $G$. We…
We consider changes in properties of a subgraph of an infinite graph resulting from the addition of open edges of Bernoulli percolation on the infinite graph to the subgraph. We give the triplet of an infinite graph, one of its subgraphs,…
The total angular resolution of a straight-line drawing is the minimum angle between two edges of the drawing. It combines two properties contributing to the readability of a drawing: the angular resolution, which is the minimum angle…
These notes are the English version of the paper "Hyperbolicit\'e du graphe des rayons et quasi-morphismes sur un gros groupe modulaire". The mapping class group Gamma of the complement of a Cantor set in the plane arises naturally in…
In network analysis, a measure of node centrality provides a scale indicating how central a node is within a network. The coreness is a popular notion of centrality that accounts for the maximal smallest degree of a subgraph containing a…
We show that a relatively hyperbolic graph with uniformly hyperbolic peripheral subgraphs is hyperbolic. As an application, we show that the disc graph and the electrified disc graph of a handlebody H of genus g>1 are hyperbolic, and we…
Consider a drawing of a graph $G$ in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of $G$, is the classical graph parameter "thickness". By restricting the edges to be…
We investigate the relationship between the metric boundary and the Gromov boundary of a hyperbolic metric space. We show that the Gromov boundary is a quotient topological space of the metric boundary, and that therefore a word-hyperbolic…