相关论文: Graphical Representations and Worm Algorithms for …

The idea of implicit representation of graphs was introduced in [S. Kannan, M. Naor, S. Rudich, Implicit representation of graphs, SIAM J. Discrete Mathematics, 5 (1992) 596--603] and can be defined as follows. A representation of an…

Orthogonal drawings, i.e., embeddings of graphs into grids, are a classic topic in Graph Drawing. Often the goal is to find a drawing that minimizes the number of bends on the edges. A key ingredient for bend minimization algorithms is the…

The loop gas approach to lattice field theory provides an alternative, geometrical description in terms of fluctuating loops. Statistical ensembles of random loops can be efficiently generated by Monte Carlo simulations using the worm…

The renormalization group transformation for the hierarchical O(N) spin model in four dimensions is studied by means of characteristic functions of single-site measures, and convergence of the critical trajectory to the Gaussian fixed point…

Using Monte Carlo simulations we study the Ising model with spin S=1/2 and 1 on {\it directed} and {\it undirected} Erd\"os-R\'enyi (ER) random graphs, with $z$ neighbors for each spin. In the case with spin S=1/2, the {\it undirected} and…

A graphical representation of supersymmetry is presented. It clearly expresses the chiral flow appearing in SUSY quantities, by representing spinors by {\it directed lines} (arrows). The chiral suffixes are expressed by the directions (up,…

Miller et al. \cite{MPVX15} devised a distributed\footnote{They actually showed a PRAM algorithm. The distributed algorithm with these properties is implicit in \cite{MPVX15}.} algorithm in the CONGEST model, that given a parameter $k =…

Let G = (V,E) be an n-vertex graph and M_d a d-vertex graph, for some constant d. Is M_d a subgraph of G? We consider this problem in a model where all n processes are connected to all other processes, and each message contains up to O(log…

The Nearest Neighbor (NN) Representation is an emerging computational model that is inspired by the brain. We study the complexity of representing a neuron (threshold function) using the NN representations. It is known that two anchors (the…

We describe a simple deterministic $O( \varepsilon^{-1} \log \Delta)$ round distributed algorithm for $(2\alpha+1)(1 + \varepsilon)$ approximation of minimum weighted dominating set on graphs with arboricity at most $\alpha$. Here $\Delta$…

The loop $O(n)$ model is a family of probability measures on collections of non-intersecting loops on the hexagonal lattice, parameterized by a loop-weight $n$ and an edge-weight $x$. Nienhuis predicts that, for $0 \leq n \leq 2$, the model…

A graph $G = (V,E)$ can be described by the characteristic function of the edge set $\chi_E$ which maps a pair of binary encoded nodes to 1 iff the nodes are adjacent. Using \emph{Ordered Binary Decision Diagrams} (OBDDs) to store $\chi_E$…

We investigate the effects of anisotropic perturbations in three-dimensional O(N)-symmetric vector models. In order to assess their relevance for the critical behavior, we determine the renormalization-group dimensions of the anisotropic…

We give an algorithm which for an input planar graph $G$ of $n$ vertices and integer $k$, in $\min\{O(n\log^3n),O(nk^2)\}$ time either constructs a branch-decomposition of $G$ with width at most $(2+\delta)k$, $\delta>0$ is a constant, or a…

Algorithms in the data stream model use $O(polylog(N))$ space to compute some property of an input of size $N$, and many of these algorithms are implemented and used in practice. However, sketching algorithms in the graph semi-streaming…

We report on the development of two dual worm constructions that lead to cluster algorithms for efficient and ergodic Monte Carlo simulations of frustrated Ising models with arbitrary two-spin interactions that extend up to third-neighbours…

As a characteristic property of all quantum systems, entanglement participates in many important quantum phenomena. In this proceeding, we employ it in the study of quantum field theories at finite density. We incorporate evaluations of…

Circle graphs are intersection graphs of chords of a circle. In this paper, we present a new algorithm for the circle graph isomorphism problem running in time $O((n+m)\alpha(n+m))$ where $n$ is the number of vertices, $m$ is the number of…

The \emph{Steiner tree} problem is one of the fundamental and classical problems in combinatorial optimization. In this paper, we study this problem in the $\mathcal{CONGESTED}$ $\mathcal{CLIQUE}$ model of distributed computing and present…

Max-k-Cut and correlation clustering are fundamental graph partitioning problems. For a graph with G=(V,E) with n vertices, the methods with the best approximation guarantees for Max-k-Cut and the Max-Agree variant of correlation clustering…