Related papers: Fractional Pebbling Game Lower Bounds
We contribute to the program of proving lower bounds on the size of branching programs solving the Tree Evaluation Problem introduced by Cook et. al. (2012). Proving a super-polynomial lower bound for the size of nondeterministic thrifty…
The dimension is a key measure of complexity of partially ordered sets. Small dimension allows succinct encoding. Indeed if $P$ has dimension $d$, then to know whether $x \leq y$ in $P$ it is enough to check whether $x\leq y$ in each of the…
A randomised trapezoidal quadrature rule is proposed for continuous functions which enjoys less regularity than commonly required. Indeed, we consider functions in some fractional Sobolev space. Various error bounds for this randomised rule…
We develop further a new geometrical model of a discretized string, proposed in [1] and establish its basic physical properties. The model can be considered as the natural extention of the usual Feynman amplitude of the random walks to…
This paper has a twofold scope. The first one is to clarify and put in evidence the isomorphic character of two theories developed in quite different fields: on one side, threshold logic, on the other side, simple games. One of the main…
This paper introduces fractional type evolutionary equations modeling the interaction between short waves and long waves. We consider a fractional Benney type system, which is given by a fractional Schr\"odinger equation coupled with a…
We introduce and study Maker/Breaker-type positional games on random graphs. Our main concern is to determine the threshold probability $p_{F}$ for the existence of Maker's strategy to claim a member of $F$ in the unbiased game played on…
In this short note we consider the finite-dimensional distributions of sets of states generated by dispersing billiards with a random initial condition. We establish a functional correlation bound on the distance between the…
The work we present in this paper initiated the formal study of fractional hedonic games, coalition formation games in which the utility of a player is the average value he ascribes to the members of his coalition. Among other settings,…
We present the fractional perimeter as a set-function interpolation between the Lebesgue measure and the perimeter in the sense of De Giorgi. Our motivation comes from a new fractional Boxing inequality that relates the fractional perimeter…
We present a new semidefinite Farkas lemma involving a side constraint on the rank. This lemma is then used to present a new proof of a recent characterization, by Connelly and Gortler, of dimensional rigidity of bar frameworks.
Consider ``stochastic differential equations" driven by fractional Brownian motion with Hurst parameter H (1/4 <H< 1). Their solutions are sometimes called fractional diffusion processes. The main purpose of this paper is conditioning these…
Graph pebbling is a game played on graphs with pebbles on their vertices. A pebbling move removes two pebbles from one vertex and places one pebble on an adjacent vertex. The pebbling number $\pi(G)$ is the smallest $t$ so that from any…
Fractional generalizations of the Poisson process and branching Furry process are considered. The link between characteristics of the processes, fractional differential equations and Levy stable densities are discussed and used for…
We define the parametric closure problem, in which the input is a partially ordered set whose elements have linearly varying weights and the goal is to compute the sequence of minimum-weight lower sets of the partial order as the weights…
Analyzing refutations of the well known 0pebbling formulas Peb$(G)$ we prove some new strong connections between pebble games and algebraic proof system, showing that there is a parallelism between the reversible, black and black-white…
We prove upper and lower bounds for certain sums of products of fractional parts by using majoring and minorizing functions from Fourier analysis. In special cases the upper bounds are sharp if there exist counterexamples to the Littlewood…
We introduce the notion of a restricted exchangeable partition of $\mathbb{N}$. We obtain integral representations, consider associated fragmentations, embeddings into continuum random trees and convergence to such limit trees. In…
In the Firefighter problem, introduced by Hartnell in 1995, a fire spreads through a graph while a player chooses which vertices to protect in order to contain it. In this paper, we focus on the case of trees and we consider as well the…
Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…