相关论文: Criticality for the Gehring link problem

We study the fine-grained complexity of graph connectivity problems in unweighted undirected graphs. Recent development shows that all variants of edge connectivity problems, including single-source-single-sink, global, Steiner,…

Given finitely many pointed forces in the plane. Suppose that these forces sum up to zero and their net torques also sum up to zero. One can show that there exists a system of springs whose boundary forces exactly counter-balance these…

Principal curves are defined as parametric curves passing through the "middle" of a probability distribution in R^d. In addition to the original definition based on self-consistency, several points of view have been considered among which a…

We study limits of the largest connected components (viewed as metric spaces) obtained by critical percolation on uniformly chosen graphs and configuration models with heavy-tailed degrees. For rank-one inhomogeneous random graphs, such…

Networks with higher-order interactions, prevalent in biological, social, and information systems, are naturally represented as hypergraphs, yet their structural complexity poses fundamental challenges for geometric characterization. While…

We introduce a notion of curvature on finite, combinatorial graphs. It can be easily computed by solving a linear system of equations. We show that graphs with curvature bounded below by $K>0$ have diameter bounded by $\mbox{diam}(G) \leq…

Reliability evaluation and fault tolerance of an interconnection network of some parallel and distributed systems are discussed separately under various link-faulty hypotheses in terms of different $\mathcal{P}$-conditional…

The Lusternik-Schnirelmann category of a space was introduced to obtain a lower bound on the number of critical points of a $C^1$-function on a given manifold. Related to Lusternik-Schnirelmann category and motivated by topological…

Berry phases and the quantum-information theoretic notion of fidelity have been recently used to analyze quantum phase transitions from a geometrical perspective. In this paper we unify these two approaches showing that the underlying…

We study a new notion of Ricci curvature that applies to Markov chains on discrete spaces. This notion relies on geodesic convexity of the entropy and is analogous to the one introduced by Lott, Sturm, and Villani for geodesic measure…

Motivated by the importance of geometric information in real systems, a new model for long-range correlated percolation in link-adding networks is proposed with the connecting probability decaying with a power-law of the distance on the…

In the note, we give a proof, based on the Generalized Thom Conjecture, of Bennequin's Theorem on upper bound for the Euler number of a link which is considered as a closed braid. A lower bound for the Euler number of a link is also given.

We classify all the $n$-component links in the $3$-sphere that bound a Thurston norm minimizing Seifert surface $\Sigma$ with Euler characteristic $\chi(\Sigma)=n-2$ and that are nearly fibered, which means that their rank of the maximal…

Theoretical description of anisotropic systems, such as layered superconductors and coupled spin chains, is often a challenge due to the different natures of interactions along different directions. As a model of such a system, we present…

Comparison theorems are foundational to our understanding of the geometric features implied by various curvature constraints. This paper considers manifolds with a positive lower bound on either scalar, 2-Ricci, or Ricci curvature, and…

The Heisenberg chain with a weak link is studied, as a simple example of a quantum ring with a constriction or defect. The Heisenberg chain is equivalent to a spinless electron gas under a Jordan-Wigner transformation. Using density matrix…

This paper establishes a metric framework for Spencer complexes based on the geometric theory of compatible pairs $(D,\lambda)$ in principal bundle constraint systems, solving fundamental technical problems in computing Spencer cohomology…

We study the limiting eigenvalue distribution of $n\times n$ banded Toeplitz matrices as $n\to \infty$. From classical results of Schmidt-Spitzer and Hirschman it is known that the eigenvalues accumulate on a special curve in the complex…

This paper studies a survivable traffic grooming problem in large-scale optical transport networks under double-link failures (STG2). Each communication demand must be assigned a route for every possible scenario involving zero, one, or two…

Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental…