相关论文: A structure theorem for stochastic processes index…

We give two combinatorial proofs of an elegant product formula for the number of spanning trees of the $n$-dimensional hypercube. The first proof is based on the assertion that if one chooses a uniformly random rooted spanning tree of the…

As toy models for space-time on the Planck scale, we consider examples of fermion systems in discrete space-time which are composed of one or two particles defined on two up to nine space-time points. We study the self-organization of the…

We introduce and study a class of discrete particle ensembles that naturally arise in connection with classical random matrix ensembles, log-gases and Jack polynomials. Under technical assumptions on a general analytic potential we prove…

The Majority is Stablest Theorem has numerous applications in hardness of approximation and social choice theory. We give a new proof of the Majority is Stablest Theorem by induction on the dimension of the discrete cube. Unlike the…

In this thesis I present most of the results obtained during my PhD, where I worked on different subjects regarding jamming in systems of frictionless spheres. In particular, I focused on microscopic properties of jammed packings, such as…

The full family of discrete logistic maps has been widely studied both as a canonical example of the period-doubling route to chaos, and as a model of natural processes. In this paper we present a study of the stochastic process described…

We show by a constructive proof that in all aperiodic dynamical system, for all sequences $(a_n)_{n\in\N}\subset\R_+$ such that $a_n\nearrow\infty$ and $\frac{a_n}{n}\to 0$ as $n\to\infty$, there exists a set $A\in\A$ having the property…

In this paper we provide two results. The first one consists an infinitary version of the Furstenberg-Weiss Theorem. More precisely we show that every subset $A$ of a homogeneous tree $T$ such that $\frac{|A\cap T(n)|}{|T(n)|}\geq\delta$,…

This paper presents a novel framework for characterizing dissipativity of uncertain systems whose dynamics evolve according to differential-algebraic equations. Sufficient conditions for dissipativity (specializing to, e.g., stability or…

An acyclic causal structure can be described with directed acyclic graph (DAG), where arrows indicate the possibility of direct causation. The task of learning this structure from data is known as "causal discovery." Diverse populations or…

It is shown that stochastic processes of diffusion type possess, in all generality, a structure of uncertainty relations and of coherent and squeezed states. This fact is used to obtain, via Nelson stochastic formulation of quantum…

A recent discovery about the inertial range of homogeneous and isotropic turbulence is the saturation of the scaling exponents $\zeta_n$ for large $n$, defined via structure functions of order $n$ as $S_{n}(r)=\overline{(\delta_r…

We introduce and analyze a model for the transport of particles or energy in extended lattice systems. The dynamics of the model acts on a discrete phase space at discrete times but has nonetheless some of the characteristic properties of…

We investigate a discrete model consisting of self-propelled particles that obey simple interaction rules. We show that this model can self-organize and exhibit coherent localized solutions in one- and in two-dimensions.In one-dimension,…

A class of random discrete distributions $P$ is introduced by means of a recursive splitting of unity. Assuming supercritical branching, we show that for partitions induced by sampling from such $P$ a power growth of the number of blocks is…

A discrete--dynamics model, which is specified solely in terms of the system's equilibrium structure, is defined for the density correlators of a simple fluid. This model yields results for the evolution of glassy dynamics which are…

We consider the problem of causal discovery (structure learning) from heterogeneous observational data. Most existing methods assume a homogeneous sampling scheme, which leads to misleading conclusions when violated in many applications. To…

In this paper we use the Recursion Theorem to show the existence of various infinite sequences and sets. Our main result is that there is an increasing sequence e_0, e_1, e_2 .. such that W_{e_n}={e_{n+1}} for every n. Similarly, we prove…

We give several results showing that different discrete structures typically gain certain spanning substructures (in particular, Hamilton cycles) after a modest random perturbation. First, we prove that adding linearly many random edges to…

Hierarchical Archimedean copulas (HACs) are multivariate uniform distributions constructed by nesting Archimedean copulas into one another, and provide a flexible approach to modeling non-exchangeable data. However, this flexibility in the…