Related papers: Description and comparison of Fat7-bar and HYP fat…
We study various methods of constructing fat links based upon the HYP (by Hasenfratz & Knechtli) and Fat7-bar (by W. Lee) algorithms. We present the minimum plaquette distribution for these fat links. This enables us to determine which…
In the \emph {barrier resilience} problem (introduced by Kumar {\em et al.}, Wireless Networks 2007), we are given a collection of regions of the plane, acting as obstacles, and we would like to remove the minimum number of regions so that…
A Lie-algebra based recipe for smoothing gauge links in lattice field theory is presented, building on the matrix logarithm. With or without hypercubic nesting, this LOG/HYL smearing yields fat links which are differentiable w.r.t. 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…
How to quantify the distance between any two partitions of a finite set is an important issue in statistical classification, whenever different clustering results need to be compared. Developing from the traditional Hamming distance between…
Hexapeptides are increasingly applied as model systems for studying the amyloidogenecity properties of oligo- and polypeptides. It is possible to construct 64 million different hexapeptides from the twenty proteinogenic amino acid residues.…
Drug repositioning offers an effective solution to drug discovery, saving both time and resources by finding new indications for existing drugs. Typically, a drug takes effect via its protein targets in the cell. As a result, it is…
We find the minimal number of links in an embedding of any complete $k$-partite graph on 7 vertices (including $K_7$, which has at least 21 links). We give either exact values or upper and lower bounds for the minimal number of links for…
A $t$-{\em spanner} $H$ of a weighted graph $G=(V,E,w)$ is a subgraph that approximates all pairwise distances up to a factor of $t$. The {\em lightness} of $H$ is defined as the ratio between the weight of $H$ to that of the minimum…
For a multigraph $H$, a graph $G$ is $H$-linked if every injective mapping $\phi: V(H)\to V(G)$ can be extended to an $H$-subdivision in $G$. We study the minimum connectivity required for a graph to be $H$-linked. A $k$-fat-triangle $F_k$…
We study Hilbert functions of certain non-reduced schemes A supported at finite sets of points in projective space, in particular, fat point schemes. We give combinatorially defined upper and lower bounds for the Hilbert function of A using…
Predicting protein secondary structure using lattice model is one of the most studied computational problem in bioinformatics. Here secondary structure or three dimensional structure of protein is predicted from its amino acid sequence.…
We develop distributed algorithms to allocate resources in multi-hop wireless networks with the aim of minimizing total cost. In order to observe the fundamental duplexing constraint that co-located transmitters and receivers cannot operate…
The study of band connectivity is a fundamental problem in condensed matter physics. Here, we develop a new method for analyzing band connectivity, which completely solves the outstanding questions of the reducibility and decomposition of…
We study the design of robust subexponential algorithms for classical connectivity problems on intersection graphs of similarly sized fat objects in $\mathbb{R}^d$. In this setting, each vertex corresponds to a geometric object, and two…
A minimal off-lattice model for alpha-helical proteins is presented. It is based on hydrophobicity forces and sequence independent local interactions. The latter are chosen so as to favor the formation of alpha-helical structure. They model…
We measure the static potential from Wilson loops constructed using hypercubic blocked (HYP) links. The HYP potential agrees with the potential measured using thin links for distances r/a>=2. We calculated the lowest order perturbative…
A gauge field link smearing method developed for calculations with staggered fermions, namely the use of unitarized fat7 links, is applied to mesonic and baryonic Wilson loop calculations. This method is found to be very effective for…
Constructing a shortest path between two network nodes is a fundamental task in distributed computing. This work develops schemes for the construction of shortest paths in randomized beeping networks between a predetermined source node and…
Link prediction aims to uncover missing links or predict the emergence of future relationships according to the current networks structure. Plenty of algorithms have been developed for link prediction in unweighted networks, with only a…