total 3459took 0.16s

Shortest-Path-Preserving RoundingMay 21 2019Various applications of graphs, in particular applications related to finding shortest paths, naturally get inputs with real weights on the edges. However, for algorithmic or visualization reasons, inputs with integer weights would often be preferable ... More

Multigrid-reduction-in-time for Eddy Current problemsMay 16 2019Parallel-in-time methods have shown success for reducing the simulation time of many time-dependent problems. Here, we consider applying the multigrid-reduction-in-time (MGRIT) algorithm to a voltage-driven eddy current model problem.

Significance of parallel computing on the performance of Digital Image Correlation algorithms in MATLABMay 15 2019Digital Image Correlation (DIC) is a powerful tool used to evaluate displacements and deformations in a non-intrusive manner. By comparing two images, one of the undeformed reference state of a specimen and another of the deformed target state, the relative ... More

Introduction to StarNEig -- A Task-based Library for Solving Nonsymmetric Eigenvalue ProblemsMay 13 2019In this paper, we present the StarNEig library for solving dense non-symmetric (generalized) eigenvalue problems. The library is built on top of the StarPU runtime system and targets both shared and distributed memory machines. Some components of the ... More

The compound product distribution; a solution to the distributional equation X=AX+1May 12 2019The solution of $ X=AX+1 $ is analyzed for a discrete variable $ A $ with $ \mathbb{P}\left[A=0\right]>0 $. Accordingly, a fast algorithm is presented to calculate the obtained heavy tail density. To exemplify, the compound product distribution is studied ... More

Lack of Unique Factorization as a Tool in Block Cipher CryptanalysisMay 12 2019Linear (or differential) cryptanalysis may seem dull topics for a mathematician: they are about super simple invariants characterized by say a word on n=64 bits with very few bits at 1, the space of possible attacks is small, and basic principles are ... More

Continuous-Time Systems for Solving 0-1 Integer Linear Programming Feasibility ProblemsMay 12 2019The 0-1 integer linear programming feasibility problem is an important NP-complete problem. This paper proposes a continuous-time dynamical system for solving that problem without getting trapped in non-solution local minima. First, the problem is transformed ... More

A New Shortest Path Algorithm Generalized on Dynamic Graph for Commercial Intelligent Navigation for Transportation ManagementMay 11 2019Dynamic graph research is an essential subject in Computer Science. The shortest path problem is still the central in this field; moreover there is a variety of applications in practical projects. In this paper, we select the transportation activity as ... More

Low-Complexity Tilings of the PlaneMay 10 2019A two-dimensional configuration is a coloring of the infinite grid Z^2 with finitely many colors. For a finite subset D of Z^2, the D-patterns of a configuration are the colored patterns of shape D that appear in the configuration. The number of distinct ... More

Fast electrostatic solvers for kinetic Monte Carlo simulationsMay 10 2019Kinetic Monte Carlo (KMC) is an important computational tool in theoretical physics and chemistry. In contrast to standard Monte Carlo, KMC permits the description of time dependent dynamical processes and is not restricted to systems in equilibrium. ... More

Learning to EvolveMay 08 2019Evolution and learning are two of the fundamental mechanisms by which life adapts in order to survive and to transcend limitations. These biological phenomena inspired successful computational methods such as evolutionary algorithms and deep learning. ... More

On the Approximate Compressibility of Connected Vertex CoverMay 08 2019The Connected Vertex Cover problem, where the goal is to compute a minimum set of vertices in a given graph which forms a vertex cover and induces a connected subgraph, is a fundamental combinatorial problem and has received extensive attention in various ... More

Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelizationMay 08 2019A matching cut is a partition of the vertex set of a graph into two sets $A$ and $B$ such that each vertex has at most one neighbor in the other side of the cut. The MATCHING CUT problem asks whether a graph has a matching cut, and has been intensively ... More

Is a Single Embedding Enough? Learning Node Representations that Capture Multiple Social ContextsMay 06 2019Recent interest in graph embedding methods has focused on learning a single representation for each node in the graph. But can nodes really be best described by a single vector representation? In this work, we propose a method for learning multiple representations ... More

Discrete time stochastic and deterministic Petri box calculusMay 01 2019We propose an extension with deterministically timed multiactions of discrete time stochastic and immediate Petri box calculus (dtsiPBC), previously presented by I.V. Tarasyuk, H. Maci\`a and V. Valero. In dtsdPBC, non-negative integers specify multiactions ... More

Warshall's algorithm -- survey and applicationsMay 01 2019The survey presents the well-known Warshall's algorithm, a generalization and some interesting applications of this.

Simpler and Better Algorithms for Minimum-Norm Load BalancingApr 30 2019Recently, Chakrabarty and Swamy (STOC 2019) introduced the {\em minimum-norm load-balancing} problem on unrelated machines, wherein we are given a set $J$ of jobs that need to be scheduled on a set of $m$ unrelated machines, and a monotone, symmetric ... More

Tracelets and Tracelet Analysis Of Compositional Rewriting SystemsApr 29 2019Taking advantage of a recently discovered associativity property of rule compositions, we extend the classical concurrency theory for rewriting systems over adhesive categories. We introduce the notion of tracelets, which are defined as minimal derivation ... More

Normalizers and permutational isomorphisms in simply-exponential timeApr 24 2019We show that normalizers and permutational isomorphisms of permutation groups given by generating sets can be computed in time simply exponential in the degree of the groups. The result is obtained by exploiting canonical forms for permutation groups ... More

Compositionality of Rewriting Rules with ConditionsApr 19 2019We extend the notion of compositional associative rewriting as recently studied in the rule algebra framework literature to the setting of rewriting rules with conditions. Our methodology is category-theoretical in nature, where the definition of rule ... More

Planar Point Sets Determine Many Pairwise Crossing SegmentsApr 18 2019We show that any set of $n$ points in general position in the plane determines $n^{1-o(1)}$ pairwise crossing segments. The best previously known lower bound, $\Omega\left(\sqrt n\right)$, was proved more than 25 years ago by Aronov, Erd\H os, Goddard, ... More

Sesqui-Pushout Rewriting: Concurrency, Associativity and Rule Algebra FrameworkApr 17 2019Sesqui-pushout (SqPO) rewriting provides a variant of transformations of graph-like and other types of structures that fit into the framework of adhesive categories where deletion in unknown context may be implemented. We provide the first account of ... More

An Axiomatic Approach to Liveness for Differential EquationsApr 16 2019This paper presents an approach for deductive liveness verification for ordinary differential equations (ODEs) with differential dynamic logic. Numerous subtleties prevent the generalization of well-known discrete liveness verification techniques, such ... More

Heuristic algorithms for the Longest Filled Common Subsequence ProblemApr 16 2019At CPM 2017, Castelli et al. define and study a new variant of the Longest Common Subsequence Problem, termed the Longest Filled Common Subsequence Problem (LFCS). For the LFCS problem, the input consists of two strings $A$ and $B$ and a multiset of characters ... More

A Triangle Algorithm for Semidefinite Version of Convex Hull Membership ProblemApr 16 2019Given a subset $\mathbf{S}=\{A_1, \dots, A_m\}$ of $\mathbb{S}^n$, the set of $n \times n$ real symmetric matrices, we define its {\it spectrahull} as the set $SH(\mathbf{S}) = \{p(X) \equiv (Tr(A_1 X), \dots, Tr(A_m X))^T : X \in \mathbf{\Delta}_n\}$, ... More

A Triangle Algorithm for Semidefinite Version of Convex Hull Membership ProblemApr 16 2019May 19 2019Given a subset $\mathbf{S}=\{A_1, \dots, A_m\}$ of $\mathbb{S}^n$, the set of $n \times n$ real symmetric matrices, we define its {\it spectrahull} as the set $SH(\mathbf{S}) = \{p(X) \equiv (Tr(A_1 X), \dots, Tr(A_m X))^T : X \in \mathbf{\Delta}_n\}$, ... More

Approximation Algorithms for Distributionally Robust Stochastic Optimization with Black-Box DistributionsApr 16 2019Two-stage stochastic optimization is a framework for modeling uncertainty, where we have a probability distribution over possible realizations of the data, called scenarios, and decisions are taken in two stages: we make first-stage decisions knowing ... More

Combinatorial Conversion and Moment Bisimulation for Stochastic Rewriting SystemsApr 15 2019We develop a novel method to analyze the dynamics of stochastic rewriting systems evolving over finitary adhesive, extensive categories. Our formalism is based on the so-called rule algebra framework and exhibits an intimate relationship between the combinatorics ... More

Deza graphs with parameters (v,k,k-2,a)Apr 15 2019Apr 24 2019A Deza graph with parameters $(v,k,b,a)$ is a $k$-regular graph on $v$ vertices in which the number of common neighbors of two distinct vertices takes two values $a$ or $b$ ($a\leq b$) and both cases exist. In the previous papers Deza graphs with parameters ... More

Deza graphs with parameters (v,k,k-2,a)Apr 15 2019A Deza graph with parameters $(v,k,b,a)$ is a $k$-regular graph on $v$ vertices in which the number of common neighbors of two distinct vertices takes two values $a$ or $b$ ($a\leq b$) and both cases exist. In the previous papers Deza graphs with parameters ... More

What is a proof? What should it be?Apr 08 2019Mathematical proofs should be paired with formal proofs, whenever feasible.

Sparse Identification of Truncation ErrorsApr 07 2019This work presents a data-driven approach to the identification of spatial and temporal truncation errors for linear and nonlinear discretization schemes of Partial Differential Equations (PDEs). Motivated by the central role of truncation errors, for ... More

Sparse Identification of Truncation ErrorsApr 07 2019Apr 18 2019This work presents a data-driven approach to the identification of spatial and temporal truncation errors for linear and nonlinear discretization schemes of Partial Differential Equations (PDEs). Motivated by the central role of truncation errors, for ... More

A characterization of maximal 2-dimensional subgraphs of transitive graphsApr 07 2019A transitive graph is 2-dimensional if it can be represented as the intersection of two linear orders. Such representations make answering of reachability queries trivial, and allow many problems that are NP-hard on arbitrary graphs to be solved in polynomial ... More

The investigation of social networks based on multi-component random graphsApr 04 2019The methods of non-homogeneous random graphs calibration are developed for social networks simulation. The graphs are calibrated by the degree distributions of the vertices and the edges. The mathematical foundation of the methods is formed by the theory ... More

Growing graphs with addition of communitiesApr 04 2019Paper proposes a model of large networks based on a random preferential attachment graph with addition of complete subgraphs (cliques). The proposed model refers to models of random graphs following the nonlinear preferential attachment rule and takes ... More

Continuous Direct Sparse Visual Odometry from RGB-D ImagesApr 03 2019May 21 2019This paper reports on a novel formulation and evaluation of visual odometry from RGB-D images. Assuming a static scene, the developed theoretical framework generalizes the widely used direct energy formulation (photometric error minimization) technique ... More

An Improved Upper Bound for the Ring Loading ProblemApr 03 2019The Ring Loading Problem emerged in the 1990s to model an important special case of telecommunication networks (SONET rings) which gained attention from practitioners and theorists alike. Given an undirected cycle on $n$ nodes together with non-negative ... More

An Improved Upper Bound for the Ring Loading ProblemApr 03 2019Apr 30 2019The Ring Loading Problem emerged in the 1990s to model an important special case of telecommunication networks (SONET rings) which gained attention from practitioners and theorists alike. Given an undirected cycle on $n$ nodes together with non-negative ... More

Adinkra Height Yielding Matrix Numbers: Eigenvalue Equivalence Classes for Minimal Four-Color AdinkrasApr 03 2019May 15 2019An adinkra is a graph-theoretic representation of spacetime supersymmetry. Minimal four-color valise adinkras have been extensively studied due to their relations to minimal 4D, $\cal N$ = 1 supermultiplets. Valise adinkras, although an important subclass, ... More

Adinkra Height Yielding Matrix Numbers: Eigenvalue Equivalence Classes for Minimal Four-Color AdinkrasApr 03 2019Apr 25 2019An adinkra is a graph-theoretic representation of spacetime supersymmetry. Minimal four-color valise adinkras have been extensively studied due to their relations to minimal 4D, $\cal N$ = 1 supermultiplets. Valise adinkras, although an important subclass, ... More

Adinkra Height Yielding Matrix Numbers: Eigenvalue Equivalence Classes for Minimal Four-Color AdinkrasApr 03 2019An adinkra is a graph-theoretic representation of spacetime supersymmetry. Minimal four-color valise adinkras have been extensively studied due to their relations to minimal 4D, $\cal N$ = 1 supermultiplets. Valise adinkras, although an important subclass, ... More

An Algorithmic Theory of Integer ProgrammingApr 02 2019We study the general integer programming problem where the number of variables $n$ is a variable part of the input. We consider two natural parameters of the constraint matrix $A$: its numeric measure $a$ and its sparsity measure $d$. We show that integer ... More

Decidability and Periodicity of Low Complexity TilingsApr 02 2019We investigate the tiling problem, also known as the domino problem, that asks whether the two-dimensional grid Z^2 can be colored in a way that avoids a given finite collection of forbidden local patterns. The problem is well-known to be undecidable ... More

Vertex degree distribution and arc endpoints degree distribution of graphs with a linear rule of preferential attachment and Pennock graphsMar 31 2019The article deals with two classes of growing random graphs following the preferential attachment rule with a linear weight function, L-graphs, and hybrid Pennock graphs. We determine the exact final vertex degree distribution and the exact final two-dimensional ... More

Decomposition and Modeling in the Non-Manifold domainMar 30 2019The problem of decomposing non-manifold object has already been studied in solid modeling. However, the few proposed solutions are limited to the problem of decomposing solids described through their boundaries. In this thesis we study the problem of ... More

An Analysis Framework for Hardware and Software Implementations with Applications from CryptographyMar 30 2019With the richness of present-day hardware architectures, tightening the synergy between hardware and software has attracted a great attention. The interest in unified approaches paved the way for newborn frameworks that target hardware and software co-design. ... More

Multifractality in random networks with power-law decaying bond strengthsMar 27 2019In this paper we demonstrate numerically that random networks whose adjacency matrices ${\bf A}$ are represented by a diluted version of the Power--Law Banded Random Matrix (PBRM) model have multifractal eigenfunctions. The PBRM model describes one--dimensional ... More

Efficient nuclear norm approximation via the randomized UTV algorithmMar 27 2019The recently introduced algorithm randUTV provides a highly efficient technique for computing accurate approximations to all the singular values of a given matrix $A$. The original version of randUTV was designed to compute a full factorization of the ... More

Jaccard/Tanimoto similarity test and estimation methodsMar 27 2019Binary data are used in a broad area of biological sciences. Using binary presence-absence data, we can evaluate species co-occurrences that help elucidate relationships among organisms and environments. To summarize similarity between occurrences of ... More

A Dynamic Routing Framework for Shared Mobility ServicesMar 26 2019Travel time in urban centers is a significant contributor to the quality of living of its citizens. Mobility on Demand (MoD) services such as Uber and Lyft have revolutionized the transportation infrastructure, enabling new solutions for passengers. Shared ... More

A linear bound on the k-rendezvous time for primitive sets of NZ matricesMar 25 2019A set of nonnegative matrices is called primitive if there exists a product of these matrices that is entrywise positive. Motivated by recent results relating synchronizing automata and primitive sets, we study the length of the shortest product of a ... More

Network Horizon Dynamics I: Qualitative AspectsMar 25 2019Mostly acyclic directed networks, treated mathematically as directed graphs, arise in machine learning, biology, social science, physics, and other applications. Newman [1] has noted the mathematical challenges of such networks. In this series of papers, ... More

Density and Fractal Property of the Class of Oriented TreesMar 23 2019We show the density theorem for the class of finite oriented trees ordered by the homomorphism order. We also show that every interval of oriented trees, in addition to be dense, is in fact universal. We end by considering the fractal property in the ... More

Trifocal Relative Pose from Lines at Points and its Efficient SolutionMar 23 2019Mar 28 2019We present a new minimal problem for relative pose estimation mixing point features with lines incident at points observed in three views and its efficient homotopy continuation solver. We demonstrate the generality of the approach by analyzing and solving ... More

Trifocal Relative Pose from Lines at Points and its Efficient SolutionMar 23 2019Apr 16 2019We present a new minimal problem for relative pose estimation mixing point features with lines incident at points observed in three views and its efficient homotopy continuation solver. We demonstrate the generality of the approach by analyzing and solving ... More

An empirical analysis of exact algorithms for the unbounded knapsack problemMar 21 2019This work presents an empirical analysis of exact algorithms for the unbounded knapsack problem, which includes seven algorithms from the literature, two commercial solvers, and more than ten thousand instances. The terminating step-off, a dynamic programming ... More

A Polynomial-time Solution for Robust Registration with Extreme Outlier RatesMar 20 2019We propose a robust approach for the registration of two sets of 3D points in the presence of a large amount of outliers. Our first contribution is to reformulate the registration problem using a Truncated Least Squares (TLS) cost that makes the estimation ... More

Combining Model and Parameter Uncertainty in Bayesian Neural NetworksMar 18 2019Mar 20 2019Bayesian neural networks (BNNs) have recently regained a significant amount of attention in the deep learning community due to the development of scalable approximate Bayesian inference techniques. There are several advantages of using Bayesian approach: ... More

Combining Model and Parameter Uncertainty in Bayesian Neural NetworksMar 18 2019Bayesian neural networks (BNNs) have recently regained a significant amount of attention in the deep learning community due to the development of scalable approximate Bayesian inference techniques. There are several advantages of using Bayesian approach: ... More

Extending partial automorphisms of $n$-partite tournamentsMar 18 2019We prove that for every $n\geq 2$ the class of all finite $n$-partite tournaments (orientations of complete $n$-partite graphs) has the extension property for partial automorphisms, that is, for every finite $n$-partite tournament $G$ there is a finite ... More

Multi-Stage Fault Warning for Large Electric Grids Using Anomaly Detection and Machine LearningMar 15 2019In the monitoring of a complex electric grid, it is of paramount importance to provide operators with early warnings of anomalies detected on the network, along with a precise classification and diagnosis of the specific fault type. In this paper, we ... More

A polynomial version of Cereceda's conjectureMar 13 2019Let $k$ and $d$ be such that $k \ge d+2$. Consider two $k$-colourings of a $d$-degenerate graph $G$. Can we transform one into the other by recolouring one vertex at each step while maintaining a proper coloring at any step? Cereceda et al. answered that ... More

Financial Applications of Gaussian Processes and Bayesian OptimizationMar 12 2019In the last five years, the financial industry has been impacted by the emergence of digitalization and machine learning. In this article, we explore two methods that have undergone rapid development in recent years: Gaussian processes and Bayesian optimization. ... More

Shapley regressions: A framework for statistical inference on machine learning modelsMar 11 2019Machine learning models often excel in the accuracy of their predictions but are opaque due to their non-linear and non-parametric structure. This makes statistical inference challenging and disqualifies them from many applications where model interpretability ... More

Sparse Grouped Gaussian Processes for Solar Power ForecastingMar 10 2019We consider multi-task regression models where observations are assumed to be a linear combination of several latent node and weight functions, all drawn from Gaussian process priors that allow nonzero covariance between grouped latent functions. Motivated ... More

Only Connect, SecurelyMar 07 2019The lattice model proposed by Denning in her seminal work provided secure information flow analyses with an intuitive and uniform mathematical foundation. Different organisations, however, may employ quite different security lattices. In this paper, we ... More

Socially-Aware Congestion Control in Ad-Hoc Networks: Current Status and The Way ForwardMar 03 2019Ad-hoc social networks (ASNETs) represent a special type of traditional ad-hoc network in which a user's social properties (such as the social connections and communications metadata as well as application data) are leveraged for offering enhanced services ... More

Fair Dimensionality Reduction and Iterative Rounding for SDPsFeb 28 2019We model "fair" dimensionality reduction as an optimization problem. A central example is the fair PCA problem: the input data is divided into $k$ groups, and the goal is to find a single $d$-dimensional representation for all groups for which the maximum ... More

SAFE ML: Surrogate Assisted Feature Extraction for Model LearningFeb 28 2019Complex black-box predictive models may have high accuracy, but opacity causes problems like lack of trust, lack of stability, sensitivity to concept drift. On the other hand, interpretable models require more work related to feature engineering, which ... More

Linear Time Visualization and Search in Big Data using Pixellated Factor Space MappingFeb 27 2019It is demonstrated how linear computational time and storage efficient approaches can be adopted when analyzing very large data sets. More importantly, interpretation is aided and furthermore, basic processing is easily supported. Such basic processing ... More

Minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexityFeb 27 2019An adaptive regularization algorithm using inexact function and derivatives evaluations is proposed for the solution of composite nonsmooth nonconvex optimization. It is shown that this algorithm needs at most $O(|\log(\epsilon)|\,\epsilon^{-2})$ evaluations ... More

Parallel Rendering and Large Data VisualizationFeb 23 2019We are living in the big data age: An ever increasing amount of data is being produced through data acquisition and computer simulations. While large scale analysis and simulations have received significant attention for cloud and high-performance computing, ... More

Revising SA-CCRFeb 22 2019Apr 08 2019From SA-CCR to RSA-CCR: making SA-CCR self-consistent and appropriately risk-sensitive by cashflow decomposition in a 3-Factor Gaussian Market Model

From SA-CCR to RSA-CCR: making SA-CCR self-consistent and appropriately risk-sensitive by cashflow decomposition in a 3-Factor Gaussian Market ModelFeb 22 2019SA-CCR has major issues including: lack of self-consistency for linear trades; lack of appropriate risk sensitivity (zero positions can have material add-ons; moneyness is ignored); dependence on economically-equivalent confirmations. We show that SA-CCR ... More

Robust Asset Allocation for Robo-AdvisorsFeb 20 2019In the last few years, the financial advisory industry has been impacted by the emergence of digitalization and robo-advisors. This phenomenon affects major financial services, including wealth management, employee savings plans, asset managers, etc. ... More

Competitive Concurrent Distributed SchedulingFeb 20 2019We introduce a new scheduling problem in distributed computing that we call the DSMS problem. We are given a set of $k \geq 1$ mobile identical servers that are initially hosted by some processors of the given network. Further, we are given a set of requests ... More

Robot Co-design: Beyond the Monotone CaseFeb 15 2019Recent advances in 3D printing and manufacturing of miniaturized robotic hardware and computing are paving the way to build inexpensive and disposable robots. This will have a large impact on several applications including scientific discovery (e.g., ... More

Constrained Risk Budgeting Portfolios: Theory, Algorithms, Applications & PuzzlesFeb 15 2019This article develops the theory of risk budgeting portfolios, when we would like to impose weight constraints. It appears that the mathematical problem is more complex than the traditional risk budgeting problem. The formulation of the optimization program ... More

On the Convergence of Network SystemsFeb 11 2019The apparent disconnection between the microscopic and the macroscopic is a major issue in the understanding of complex systems. To this extend, we study the convergence of repeatedly applying local rules on a network, and touch on the expressive power ... More

On the number of pancake stacks requiring 4 flips to be sortedFeb 11 2019Feb 26 2019Using existing classification results for the 7- and 8-cycles in the pancake graph, we determine the number of permutations that require 4 pancake flips (prefix reversals) to be sorted. A similar characterization of the 8-cycles in the burnt pancake graph, ... More

On the number of pancake stacks requiring 4 flips to be sortedFeb 11 2019Using an existing classification results for the 7- and 8-cycles in the pancake graph, we determine the number of permutations that require 4 pancake flips (prefix reversals) to be sorted. A similar characterization of the 8-cycles in the burnt pancake ... More

All those EPPA classes (Strengthenings of the Herwig-Lascar theorem)Feb 11 2019In this paper we prove a general theorem showing the extension property for partial automorphisms (EPPA, also called the Hrushovski property) for classes of structures containing relations and unary functions, optionally equipped with a permutation group ... More

On the Complexity of Exact Pattern Matching in Graphs: Determinism and Zig-Zag MatchingFeb 10 2019Exact pattern matching in labeled graphs is the problem of searching paths of a graph $G=(V,E)$ that spell the same string as the given pattern $P[1..m]$. This basic problem can be found at the heart of more complex operations on variation graphs in computational ... More

Bernstein Concentration Inequalities for Tensors via Einstein ProductsFeb 08 2019A generalization of the Bernstein matrix concentration inequality to random tensors of general order is proposed. This generalization is based on the use of Einstein products between tensors, from which a strong link can be established between matrices ... More

Constructive Non-Linear Polynomial Cryptanalysis of a Historical Block CipherFeb 07 2019One of the major open problems in symmetric cryptanalysis is to discover new specif i c types of invariant properties which can hold for a larger number of rounds of a block cipher. We have Generalised Linear Cryptanalysis (GLC) and Partitioning Cryptanalysis ... More

Cramér Type Moderate Deviations for Random FieldsFeb 07 2019We study the Cram\'er type moderate deviation for partial sums of random fields by applying the conjugate method. The results are applicable to the partial sums of linear random fields with short or long memory and to nonparametric regression with random ... More

Distributed Ledger Privacy: Ring Signatures, Möbius and CryptoNoteFeb 07 2019Distributed ledger and blockchain systems are expected to make financial systems easier to audit, reduce counter-party risk and transfer assets seamlessly. The key concept is a token controlled by a cryptographic private key for spending, and represented ... More

Stability of the optimal values under small perturbations of the constraint setFeb 06 2019This paper presents a general and useful stability principle which, roughly speaking, says that given a uniformly continuous function defined on an arbitrary metric space, if we slightly change the constraint set over which the optimal (extreme) values ... More

Minor-Obstructions for Apex Sub-unicyclic GraphsFeb 06 2019A graph is sub-unicyclic if it contains at most one cycle. We also say that a graph $G$ is $k$-apex sub-unicyclic if it can become sub-unicyclic by removing $k$ of its vertices. We identify 29 graphs that are the minor-obstructions of the class of $1$-apex ... More

(Near) Optimal Adaptivity Gaps for Stochastic Multi-Value ProbingFeb 04 2019Feb 06 2019Consider a kidney-exchange application where we want to find a max-matching in a random graph. To find whether an edge $e$ exists, we need to perform an expensive test, in which case the edge $e$ appears independently with a \emph{known} probability $p_e$. ... More

Stabilization Time in Weighted Minority ProcessesFeb 04 2019A minority process in a weighted graph is a dynamically changing coloring. Each node repeatedly changes its color in order to minimize the sum of weighted conflicts with its neighbors. We study the number of steps until such a process stabilizes. Our ... More

Decentralized Stochastic Optimization and Gossip Algorithms with Compressed CommunicationFeb 01 2019We consider decentralized stochastic optimization with the objective function (e.g. data samples for machine learning task) being distributed over $n$ machines that can only communicate to their neighbors on a fixed communication graph. To reduce the ... More

Local minimax rates for closeness testing of discrete distributionsFeb 01 2019We consider the closeness testing (or two-sample testing) problem in the Poisson vector model - which is known to be asymptotically equivalent to the model of multinomial distributions. The goal is to distinguish whether two data samples are drawn from ... More

Quantum model for price forecasting in financial marketsJan 30 2019The present paper describes a practical example in which the probability distribution of the prices of a stock market blue chip is calculated as the wave function of a quantum particle confined in a potential well. This model may naturally explain the ... More

Simulating the DNA String Graph in Succinct SpaceJan 29 2019Converting a set of sequencing reads into a lossless compact data structure that encodes all the relevant biological information is a major challenge. The classical approaches are to build the string graph or the de Bruijn graph. Each has advantages over ... More

Unique perfect matchings, edge-colored graphs and proof nets for linear logic with MixJan 29 2019This paper establishes a bridge between linear logic and mainstream graph theory, building on previous work by Retor\'e (2003). We show that the problem of correctness for MLL+Mix proof nets is equivalent to the problem of uniqueness of a perfect matching. ... More

Neural eliminators and classifiersJan 28 2019Classification may not be reliable for several reasons: noise in the data, insufficient input information, overlapping distributions and sharp definition of classes. Faced with several possibilities neural network may in such cases still be useful if ... More

The CM Algorithm for the Maximum Mutual Information Classifications of Unseen InstancesJan 28 2019The Maximum Mutual Information (MMI) criterion is different from the Least Error Rate (LER) criterion. It can reduce failing to report small probability events. This paper introduces the Channels Matching (CM) algorithm for the MMI classifications of ... More

Plantinga-Vegter algorithm takes average polynomial timeJan 26 2019We exhibit a condition-based analysis of the adaptive subdivision algorithm due to Plantinga and Vegter. The first complexity analysis of the PV Algorithm is due to Burr, Gao and Tsigaridas who proved a $O\big(2^{\tau d^{4}\log d}\big)$ worst-case cost ... More