We investigate random connected graphs from a block-stable class whose distribution is weighted based on the number of $2$-connected components, or blocks. This includes the class of planar graphs. For this, we develop a notion of a decorated block tree. Following similar ideas to Fleurat and the second author on block-weighted planar maps, we find a phase transition in the singular behaviour of the appropriate generating function and in the typical structure of the block tree. Moreover, for certain block-stable classes (including planar graphs), we obtain precise enumeration results and determine also the typical sizes of the largest blocks in subcritical, critical, and supercritical regimes. It strengthens previously known results on block sizes in uniform random planar graphs.
We prove invariance for the number of planar tropical curves enhanced with polynomial multiplicities recently proposed by Florian Block and Lothar Goettsche. This invariance has a number of implications in tropical enumerative geometry.
In this article, we evaluate determinants of block hook matrices, which are block matrices consist of hook matrices. In particular, we deduce that the determinant of a block hook matrix factorizes nicely. In addition we give a combinatorial interpretation of the aforesaid factorization property by counting weighted paths in a suitable weighted digraph.
We study the asymptotic shape of random unlabelled graphs subject to certain subcriticality conditions. The graphs are sampled with probability proportional to a product of Boltzmann weights assigned to their $2$-connected components. As their number of vertices tends to infinity, we show that they admit the Brownian tree as Gromov--Hausdorff--Prokhorov scaling limit, and converge in a strengthened Benjamini--Schramm sense toward an infinite random graph. We also consider a family of random graphs that are allowed to be disconnected. Here a giant connected component emerges and the small fragm…
A graph $G$ is \emph{nonsingular (singular)} if its adjacency matrix $A(G)$ is nonsingular (singular). In this article, we consider the nonsingularity of block graphs, i.e., graphs in which every block is a clique. Extending the problem, we characterize nonsingular vertex-weighted block graphs in terms of reduced vertex-weighted graphs resulting after successive deletion and contraction of pendant blocks. Special cases where nonsingularity of block graphs may be directly determined are discussed.
We analyse uniform random cubic rooted planar maps and obtain limiting distributions for several parameters of interest. From the enumerative point of view, we present a unified approach for the enumeration of several classes of cubic planar maps, which allow us to recover known results in a more general and transparent way. This approach allows us to obtain new enumerative results. Concerning random maps, we first obtain the distribution of the degree of the root face, which has an exponential tail as for other classes of random maps. Our main result is a limiting map-Airy distribution law fo…
Unravelling the block structure of a network is critical for studying macroscopic features and community-level dynamics. The weighted stochastic block model (WSBM), a variation of the traditional stochastic block model, is designed for weighted networks, but it is not always optimal. We introduce a novel topological method to study the block structure of weighted networks by comparing their persistence diagrams. We found persistence diagrams of networks with different block structures show distinct features, sufficient to distinguish. Moreover, the overall characteristics are preserved even wi…
We study the geodesic two- and three-point functions of random weighted cubic maps, which are obtained by assigning random edge lengths to random cubic planar maps. Explicit expressions are obtained by taking limits of recently established bivariate multi-point functions of general planar maps. We give an alternative interpretation of the two-point function in terms of an Eden model exploration process on a random planar triangulation. Finally, the scaling limits of the multi-point functions are studied, showing in particular that the two- and three-point functions of the Brownian map are reco…
Let $P(n,m)$ be a graph chosen uniformly at random from the class of all planar graphs on vertex set $\{1, \ldots, n\}$ with $m=m(n)$ edges. We study the cycle and block structure of $P(n,m)$ when $m\sim n/2$. More precisely, we determine the asymptotic order of the length of the longest and shortest cycle in $P(n,m)$ in the critical range when $m=n/2+o(n)$. In addition, we describe the block structure of $P(n,m)$ in the weakly supercritical regime when $n^{2/3}\ll m-n/2\ll n$.
Consider a planar graph $G=(V,E)$ with polynomially bounded edge weight function $w:E\to [0, poly(n)]$. The main results of this paper are NC algorithms for the following problems: - minimum weight perfect matching in $G$, - maximum cardinality and maximum weight matching in $G$ when $G$ is bipartite, - maximum multiple-source multiple-sink flow in $G$ where $c:E\to [1, poly(n)]$ is a polynomially bounded edge capacity function, - minimum weight $f$-factor in $G$ where $f:V\to [1, poly(n)]$, - min-cost flow in $G$ where $c:E\to [1, poly(n)]$ is a polynomially bounded edge capacity function and…
Let $G$ be a digraph and $r(G)$ be its rank. Many interesting results on the rank of an undirected graph appear in the literature, but not much information about the rank of a digraph is available. In this article, we study the rank of a digraph using the ranks of its blocks. In particular, we define classes of digraphs, namely $r_2$-digraph, and $r_0$-digraph, for which the rank can be exactly determined in terms of the ranks of subdigraphs of the blocks. Furthermore, the rank of directed trees, simple biblock graphs, and some simple block graphs are studied.
The prism over a graph $G$ is the Cartesian product of $G$ with the complete graph $K_2$. $G$ is prism-hamiltonian if the prism over $G$ has a Hamilton cycle. A good even cactus is a connected graph in which every block is either an edge or an even cycle, and every vertex is contained in at most two blocks. It is known that good even cacti are prism-hamiltonian. Indeed, showing the existence of a spanning good even cactus has become one of the most common techniques in proving prism-hamiltonicity. Špacapan asked whether having a spanning good even cactus is equivalent to having a hamiltonian p…
We give upper bounds on weighted perfect matchings in pfaffian graphs. These upper bounds are better than Bregman's upper bounds on the number of perfect matchings. We show that some of our upper bounds are sharp for 3 and 4-regular pfaffian graphs. We apply our results to fullerene graphs.
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 more general model. We consider random graphs from a `well-behaved' class of graphs: examples of such classes include all minor-closed classes of graphs with 2-connected excluded minors (such as forests, series-parallel graphs and planar graphs), the class of graphs embeddable on any given surface, and the class of graphs with at most k vertex-disjoint cycles…
Given $[n]=\{1,2,\ldots,n\}$, a partial order $\preceq$ on $[n]$, a label map $π: [n] \rightarrow \mathbb{N}$ defined by $π(i) = k_i$ with $\sum_{i=1}^{n}π(i) = N$, the direct sum $ \mathbb{F}_{q}^{k_1} \oplus \mathbb{F}_{q}^{k_2}\oplus \ldots \oplus \mathbb{F}_{q}^{k_n} $ of $ \mathbb{F}_q^N $, and a weight function $w$ on $ \mathbb{F}_q $, we define a poset block metric $d_{(P,w,π)}$ on $\mathbb{F}_{q}^{N}$ based on the poset $P=([n],\preceq)$. The metric $d_{(P,w,π)}$ is said to be weighted coordinates poset block metric ($(P,w,π)$-metric). It extends the weighted coordinates poset metric (…
We address the six vertex model on a random lattice, which in combinatorial terms corresponds to the enumeration of weighted 4-valent planar maps equipped with an Eulerian orientation. This problem was exactly, albeit non-rigorously solved by Ivan Kostov in 2000 using matrix integral techniques. We convert Kostov's work to a combinatorial argument involving functional equations coming from recursive decompositions of the maps, which we solve rigorously using complex analysis. We then investigate modular properties of the solution, which lead to simplifications in certain special cases. In part…
Given $[n]=\{1,2,\ldots,n\}$, a poset order $\preceq$ on $[n]$, a label map $π: [n] \rightarrow \mathbb{N}$ defined by $π(i)=k_i$ with $\sum_{i=1}^{n}π(i) = N$, and a weight function $w$ on $\mathbb{F}_{q}$, let $\mathbb{F}_{q}^N$ be the vector space of $N$-tuples over the field $\mathbb{F}_{q}$ equipped with $(P,w,π)$-metric where $ \mathbb{F}_q^N $ is the direct sum of spaces $ \mathbb{F}_{q}^{k_1}, \mathbb{F}_{q}^{k_2}, \ldots, \mathbb{F}_{q}^{k_n} $. In this paper, we determine the groups of linear isometries of $(P,w,π)$-metric spaces in terms of a semi-direct product, which turns out to …
The infinite tumbling block graph is a bipartite graph, where each vertex in one partite set is of degree 3 and each vertex in the other partite set is of degree 6. It is a 2-dimensional array of blocks of seven vertices and nine edges, a planar graph that has 3-D looks. This paper introduces tumbling block graphs and considers various graphical parameters for different classes of infinite and finite tumbling blocks.
Maximal minors of Kasteleyn sign matrices on planar bipartite graphs in the disk count dimer configurations with prescribed boundary conditions, and the weighted version of such matrices provides a natural parametrization of the totally non--negative part of real Grassmannians (see Refs. [54,43,44,58,7]). In this paper we provide a geometric interpretation of such variant of Kasteleyn theorem: a signature is Kasteleyn if and only if it is geometric in the sense of Ref. [5]. We apply this geometric characterization to explicitly solve the associated system of relations and provide a new proof t…
