Related papers: Switching Identities by Probabilistic Means
Population dynamics with complex biological interactions, accounting for uncertainty quantification, is critical for many application areas. However, due to the complexity of biological systems, the mathematical formulation of the…
Population-based search has recently emerged as a possible alternative to Reinforcement Learning (RL) for black-box neural architecture search (NAS). It performs well in practice even though it is not theoretically well understood. In…
A stochastic orbital approach to the resolution of identity (RI) approximation for 4-index 2-electron electron repulsion integrals (ERIs) is presented. The stochastic RI-ERIs are then applied to M\o ller-Plesset perturbation theory (MP2)…
We present a broader framework for the Cauchy identity derived from the determinant expansion of collocation matrices. This approach yields an infinite family of identities, where the original Cauchy identity stands as a particular case. To…
We present new combinatorial and probabilistic identities relating three random processes: the oriented swap process on $n$ particles, the corner growth process, and the last passage percolation model. We prove one of the probabilistic…
We consider the cheating strategies for the popular matchings problem. The popular matchings problem can be defined as follows: Let G = (A U P, E) be a bipartite graph where A denotes a set of agents, P denotes a set of posts and the edges…
We give new combinatorial constructions for codes providing authentication and secrecy for equiprobable source probability distributions. In particular, we construct an infinite class of optimal authentication codes which are multiple-fold…
We study the problem of approximation of solutions of the Skorokhod problem and reflecting stochastic differential equations (SDEs) with jumps by sequences of solutions of equations with penalization terms. Applications to discrete…
Secure relative timestamping and secure append-only logs are two historically mostly independent lines of research, which we show to be sides of the same coin -- the authentication of prefix relations. From this more general viewpoint, we…
The problem of optimal power allocation among the relays in a two-hop decode-and-forward cooperative relay network with independent Rayleigh fading channels is considered. It is assumed that only the relays that decode the source message…
We solve the Skorokhod embedding problem for a class of stochastic processes satisfying an inhomogeneous stochastic differential equation (SDE) of the form $d A_t =\mu (t, A_t) d t + \sigma(t, A_t) d W_t$. We provide sufficient conditions…
In the process of studying a conjecture of Holly M. Green and Martin W. Liebeck, we obtain two interesting identities by elementary methods, one is a combinatorial identity, and the other is a number theoretic identity.
Probabilistic hyperproperties describe probabilistic relations between multiple sets of executions in a stochastic system. Prominent examples include information-theoretic characterizations of security and privacy policies. However, model…
This paper presents a new family of almost identities. These are based on series that sum to elements close to either rationals or rational multiples of pi. The explanation of the phenomenon takes its roots in the theory of Mellin…
This paper develops an embedding-based approach to solve switched optimal control problems (SOCPs) with an arbitrary number of subsystems. Initially, the discrete switching signal is represented by a set of binary variables, encoding each…
User identity linkage is a task of recognizing the identities of the same user across different social networks (SN). Previous works tackle this problem via estimating the pairwise similarity between identities from different SN, predicting…
We prove two identities of Hall-Littlewood polynomials, which appeared recently in a paper by two of the authors. We also conjecture, and in some cases prove, new identities which relate infinite sums of symmetric polynomials and partition…
The reverse engineering problem with probabilities and sequential behavior is introducing here, using the expression of an algorithm. The solution is partially founded, because we solve the problem only if we have a Probabilistic Sequential…
We develop a new methodology for the fluctuation theory of continuous-time skip-free Markov chains, extending the recent work of Choi and Patie [5] for discrete-time skip-free Markov chains. As the main application we use it to derive a…
A probability method is provided to prove three classes of combinatorial identities. The method is extremely simple, only one step after the proper probability setup.