Related papers: The interchange process with reversals on the comp…
This work investigates theoretically the interplay between interpolation and aggregation in regression. We establish that the $\gamma$-graph dimension characterizes learnability for a broad class of natural aggregation procedures.…
We introduce techniques for proving uniform termination of graph transformation systems, based on matrix interpretations for string rewriting. We generalize this technique by adapting it to graph rewriting instead of string rewriting and by…
Consider the complete graph on \(n\) vertices where each edge is independently open with probability \(p,\) or closed otherwise. Phase transitions for such graphs for \(p = \frac{C}{n}\) have previously been studied using techniques like…
For any $\epsilon>0$ and $n>(1+\epsilon)t$, $n>n_0(\epsilon)$ we determine the size of the largest $t$-intersecting family of permutations, as well as give a sharp stability result. This resolves a conjecture of Ellis, Friedgut and Pilpel…
We develop a diffusion approximation for systems subject to fast random resetting by small amplitudes. Equivalently, this describes systems with frequent but small catastrophes. We demonstrate the validity of the approximation by computing…
We consider a version of continuum long-range percolation on finite boxes of $\mathbb{R}^d$ in which the vertex set is given by the points of a Poisson point process and each pair of two vertices at distance $r$ is connected with…
The problem of transient hysteresis cycles induced by the pre-sliding kinetic friction is relevant for analyzing the system dynamics e.g. of micro- and nano-positioning instruments and devices and their controlled operation. The associated…
We analyze the existence and the size of the giant component in the stationary state of a Markovian model for bipartite multigraphs, in which the movement of the edge ends on one set of vertices of the bipartite graph is a zero-range…
We propose a power-law $m$-uniform random hypergraph on $n$ vertexes. In this hypergraph, each vertex is independently assigned a random weight from a power-law distribution with exponent $\alpha\in(0,\infty)$ and the hyperedge…
We consider the contact process on a dynamic graph defined as a random $d$-regular graph with a stationary edge-switching dynamics. In this graph dynamics, independently of the contact process state, each pair $\{e_1,e_2\}$ of edges of the…
We prove a general transfer theorem for multivariate random sequences with independent random indexes in the double array limit setting. We also prove its partial inverse providing necessary and sufficient conditions for the convergence of…
We study spatial permutations with cycle weights that are bounded or slowly diverging. We show that a phase transition occurs at an explicit critical density. The long cycles are macroscopic and their cycle lengths satisfy a…
We show that a superposition of an $\varepsilon$-Bernoulli bond percolation and any everywhere percolating subgraph of $\mathbb Z^d$, $d\ge 2$, results in a connected subgraph, which after a renormalization dominates supercritical Bernoulli…
Consider a permutation $\sigma\in S_n$ as a deck of cards numbered from 1 to $n$ and laid out in a row, where $\sigma_j$ denotes the number of the card that is in the $j$-th position from the left.\rm\ We define two cyclic to random…
We revisit the scaling properties of a model for non-equilibrium wetting [Phys. Rev. Lett. 79, 2710 (1997)], correcting previous estimates of the critical exponents and providing a complete scaling scheme. Moreover, we investigate a special…
The decay of (disorder-averaged) static spin correlation functions at T=0 for the one-dimensional spin-1/2 XXZ antiferromagnet with uniform longitudinal coupling $J\Delta$ and random transverse coupling $J\lambda_i$ is investigated by…
A fluctuation theorem is proved for the macroscopic currents of a system in a nonequilibrium steady state, by using Schnakenberg network theory. The theorem can be applied, in particular, in reaction systems where the affinities or…
We develop Markov chain mixing time estimates for a class of Markov chains with restricted transitions. We assume transitions may occur along a cycle of $n$ nodes and on $n^\gamma$ additional edges, where $\gamma < 1$. We find that the…
Networks of financial exposures are the key propagators of risk and distress among banks, but their empirical structure is not publicly available because of confidentiality. This limitation has triggered the development of methods of…
Phase transitions are fundamental features of statistical physics. While the well-studied continuous phase transitions are known to be controlled by external \textit{macroscopic} changes in the order parameter, the origin of abrupt…