Related papers: Local and global moves on locally planar trivalent…

We consider a class of finite-dimensional dynamical systems whose equations of motion are derived from a non-local-in-time action principle. The action functional has a zeroth order piece derived from a local Hamiltonian and a perturbation…

Consider a navigation rule defined on a graph that maps every vertex of the graph to a vertex in such a way that the navigation rule commutes with every automorphism of the graph. It is to say that the navigation rule applied to the…

Terms in the lambda-calculus can be represented as planar trees decorated with symbols for abstraction and application, and having variables as leaves. In this paper, we concentrate on the branches of such trees, rather than on the trees…

This paper deals with model transformation based on attributed graph rewriting. Our contribution investigates a single pushout approach for applying the rewrite rules. The computation of graph attributes is obtained through the use of typed…

Community structures are critical for understanding the mesoscopic organization of networks, bridging local and global patterns. While methods such as DeepWalk and node2vec capture local positional information through random walks, they…

We show that given a trivalent graph in $S^3$, either the graph complement contains an essential almost meridional planar surface or thin position for the graph is also bridge position. This can be viewed as an extension of a theorem of…

On the one side, the formalism of Global Transformations comes with the claim of capturing any transformation of space that is local, synchronous and deterministic. The claim has been proven for different classes of models such as mesh…

We propose a family of lagged random walk sampling methods in simple undirected graphs, where transition to the next state (i.e. node) depends on both the current and previous states -- hence, lagged. The existing random walk sampling…

Small-world networks, known for high local clustering and short path lengths, are a fundamental structure in many real-world systems, including social, biological, and technological networks. We apply the theory of (marked) local…

Let $\Gamma$ denote a distance-regular graph with classical parameters $(D, b, \alpha, \beta)$ and $D\geq 3$. Assume the intersection numbers $a_1=0$ and $a_2\not=0$. We show $\Gamma$ is 3-bounded in the sense of the article [D-bounded…

We elaborate on the principle that for gapped quantum spin systems with local interaction "local perturbations [in the Hamiltonian] perturb locally [the ground state]". This principle was established in [Bachmann et al. 2012], relying on…

Let $S_n$ be a lattice random walk with mean zero and finite variance, and let $\Lambda^a_n$ be its occupation measure at level $a$. In this note, we prove local limit theorems for $\Pr[S_n=x,\Lambda^a_n=\ell]$ and…

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…

This article is devoted to the study of mappings with branch points whose characteristics satisfy integral-type constraints. We have proved theorems concerning their local and global behavior. In particular, we established the…

We provide an example of a trivalent, 3-connected graph G such that, for any choice of metric on G, the resulting metric graph is Brill-Noether special.

We consider the 1D transport equation with nonlocal velocity field: \begin{equation*}\label{intro eq} \begin{split} &\theta_t+u\theta_x+\nu \Lambda^{\gamma}\theta=0, \\ & u=\mathcal{N}(\theta), \end{split} \end{equation*} where…

We initiate the study of Local Computation Algorithms on average case inputs. In the Local Computation Algorithm (LCA) model, we are given probe access to a huge graph, and asked to answer membership queries about some combinatorial…

We introduce a new algebraic structure called \textit{local biquandles} and show how colorings of oriented classical link diagrams and of broken surface diagrams are related to tribracket colorings. We define a (co)homology theory for local…

Recently, a new class of non-convex optimization problems motivated by the statistical problem of learning an acyclic directed graphical model from data has attracted significant interest. While existing work uses standard first-order…

The stable pairs theory of local curves in 3-folds (equivariant with respect to the scaling 2-torus) is studied with stationary descendent insertions. Reduction rules are found to lower descendents when higher than the degree. Factorization…