Related papers: Blow-up trick in Combinatorics
A graph $F$ is called a fractalizer if for all $n$ the only graphs which maximize the number of induced copies of $F$ on $n$ vertices are the balanced iterated blow ups of $F$. While the net graph is not a fractalizer, we show that the net…
The edge blow-up of a graph $G$, denoted by $G^{p+1}$, is obtained by replacing each edge of $G$ with a clique of order $p+1$, where the new vertices of the cliques are all distinct. Yuan [J. Comb. Theory, Ser. B, 152 (2022) 379-398]…
We describe an explicit method for constructing pseudo-automorphisms of a space $X$ which is obtained by blowing up points of $P^k$ (or a product $P^k \times \cdots \times P^k$). The centers of blowup are chosen to lie on an elliptic normal…
Many geometry processing pipelines implicitly assume their input data is a manifold, or is sampled from one, with a unique tangent plane at every point. Geometric data, however, routinely contains sharp features like edges, corners,…
The transformation of graphs and graph-like structures is ubiquitous in computer science. When a system is described by graph-transformation rules, it is often desirable that the rules are both terminating and confluent so that rule…
For a graph $G$ the random $n$-lift of $G$ is obtained by replacing each of its vertices by a set of $n$ vertices, and joining a pair of sets by a random matching whenever the corresponding vertices of $G$ are adjacent. We show that…
Plagiarism detection is well known phenomenon in the academic arena. Copying other people is considered as serious offence that needs to be checked. There are many plagiarism detection systems such as turn-it-in that has been developed to…
Large datasets with interactions between objects are common to numerous scientific fields (i.e. social science, internet, biology...). The interactions naturally define a graph and a common way to explore or summarize such dataset is graph…
A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…
We study different notions of blow-up of a scheme X along a subscheme Y, depending on the datum of an embedding of X into an ambient scheme. The two extremes in this theory are the ordinary blow-up, corresponding to the identity, and the…
We introduce a new distributed algorithm for aligning graphs or finding substructures within a given graph. It is based on the cavity method and is used to study the maximum-clique and the graph-alignment problems in random graphs. The…
We develop a hybrid scheme based on a finite difference scheme and a rescaling technique to approximate the solution of nonlinear wave equation. In order to numerically reproduce the blow-up phenomena, we propose a rule of scaling…
Graph matching consists of aligning the vertices of two unlabeled graphs in order to maximize the shared structure across networks; when the graphs are unipartite, this is commonly formulated as minimizing their edge disagreements. In this…
This paper is concerned with the blowup phenomenon of stochastic parabolic equations both on bounded domain and in the whole space. We introduce a new method to study the blowup phenomenon on bounded domain. Comparing with the existing…
A pebbling move on a graph consists of taking two pebbles off of one vertex and placing one pebble on an adjacent vertex. In the traditional pebbling problem we try to reach a specified vertex of the graph by a sequence of pebbling moves.…
Vertex splitting replaces a vertex by two copies and partitions its incident edges amongst the copies. This problem has been studied as a graph editing operation to achieve desired properties with as few splits as possible, most often…
String diagrams are a powerful tool for reasoning about composite structures in symmetric monoidal categories. By representing string diagrams as graphs, equational reasoning can be done automatically by double-pushout rewriting. !-graphs…
It has been known for a long time that the equivariant 2+1 wave map into the 2-sphere blows up if the initial data are chosen appropriately. Here, we present numerical evidence for the stability of the blow-up phenomenon under explicit…
In this short paper, we are concerned with the blowup phenomenon of stochastic parabolic equations. By using comparison principle and the results of deterministic parabolic equations, we obtain blowup results of solutions for stochastic…
Within the framework of Gaussian graphical models, a prior distribution for the underlying graph is introduced to induce a block structure in the adjacency matrix of the graph and learning relationships between fixed groups of variables. A…