Related papers: A modified Ricci flow on arbitrary weighted graph

We consider a generalized Ricci flow with a given (not necessarily closed) three-form and establish the higher derivatives estimates for compact manifolds. As an application, we prove the compactness theorem for this generalized Ricci flow.…

We find an obstruction to the existence of non-singular solutions to the normalized Ricci flow on four-manifolds with $b^+=1$. By using this obstruction, we study the relationship between the existence or non-existence of non-singular…

The one-way model of quantum computation is an alternative to the circuit model. A one-way computation is driven entirely by successive adaptive measurements of a pre-prepared entangled resource state. For each measurement, only one outcome…

We introduce new definitions of sectional, Ricci and scalar curvature for networks and their higher dimensional counterparts, derived from two classical notions of curvature for curves in general metric spaces, namely, the Menger curvature…

We study the short-time existence and regularity of solutions to a boundary value problem for the Ricci-DeTurck equation on a manifold with boundary. Using this, we prove the short-time existence and uniqueness of the Ricci flow prescribing…

Flow criteria are used to efficiently extract computations, either in the form of measurement patterns or quantum circuits, from ZX-diagrams. Existing criteria such as causal flow, generalised flow, and Pauli flow, were all originally…

Random graphs offer a useful mathematical representation of a variety of real world complex networks. Exponential random graphs, for example, are particularly suited towards generating random graphs constrained to have specified statistical…

Many complex networks exhibit a modular structure of densely connected groups of nodes. Usually, such a modular structure is uncovered by the optimization of some quality function. Although flawed, modularity remains one of the most popular…

This paper studies the normalized Ricci flow on surfaces with conical singularities. It's proved that the normalized Ricci flow has a solution for a short time for initial metrics with conical singularities. Moreover, the solution makes…

Combinatorial Ricci flow on a cusped $3$-manifold is an analogue of Chow-Luo's combinatorial Ricci flow on surfaces and Luo's combinatorial Ricci flow on compact $3$-manifolds with boundary for finding complete hyperbolic metrics on cusped…

We develop a theory of Ricci flow for metrics on Courant algebroids which unifies and extends the analytic theory of various geometric flows, yielding a general tool for constructing solutions to supergravity equations. We prove short time…

We provide a simple new randomized contraction approach to the global minimum cut problem for simple undirected graphs. The contractions exploit 2-out edge sampling from each vertex rather than the standard uniform edge sampling. We…

In his paper on Community Detection [1], Fortunato introduced a quality function called performance to assess the goodness of a graph partition. This measure counts the number of correctly ``interpreted" pairs of vertices, i. e. two…

The 2D Ricci flow equation in the conformal gauge is studied using the linearization approach. Using a non-linear substitution of logarithmic type, the emergent quadratic equation is split in various ways. New special solutions involving…

Aiming at improving the efficiency and accuracy of community detection in complex networks, we proposed a new algorithm, which is based on the idea that communities could be detected from subnetworks by comparing the internal and external…

Random walk-based sampling methods are gaining popularity and importance in characterizing large networks. While powerful, they suffer from the slow mixing problem when the graph is loosely connected, which results in poor estimation…

We discuss from a geometric point of view the connection between the renormalization group flow for non--linear sigma models and the Ricci flow. This offers new perspectives in providing a geometrical landscape for 2D quantum field…

Community detection is crucial in data mining. Traditional methods primarily focus on graph structure, often neglecting the significance of attribute features. In contrast, deep learning-based approaches incorporate attribute features and…

We consider a nonlinear extension of the generalized network flow model, with the flow leaving an arc being an increasing concave function of the flow entering it, as proposed by Truemper and Shigeno. We give a polynomial time combinatorial…

We introduce a family of reductions for removing proper and homogeneous pairs of cliques from a graph G. This family generalizes some routines presented in the literature, mostly in the context of claw-free graphs. These reductions can be…