Related papers: Stochastic Telegraph Equation Limit for the Stocha…
The threshold network model is a type of finite random graphs. In this paper, we introduce a generalized threshold network model. A pair of vertices with random weights is connected by an edge when real-valued functions of the pair of…
We study the integrability of the quantized six-vertex model with four parameters on a torus. It is a three-dimensional integrable lattice model in which a layer transfer matrix, depending on two spectral parameters associated with the…
Every route of a transport network approaching equilibrium can be represented by a vector of Euclidean space which length quantifies its segregation from the rest of the graph. We have empirically observed that the distribution of lengths…
This work theoretically studies stochastic neural networks, a main type of neural network in use. We prove that as the width of an optimized stochastic neural network tends to infinity, its predictive variance on the training set decreases…
We study the 19-vertex model of Statistical Mechanics in a square with the domain wall boundary condition. Using the minimal set of generating flip actions we build a parametrized dynamic version of the model. For all observed dynamic…
Concerning Numerical Stochastic Perturbation Theory, we discuss the convergence of the stochastic process (idea of the proof, features of the limit distribution, rate of convergence to equilibrium). Then we also discuss the expected…
We study the stochastic total variation flow (STVF) equation with linear multiplicative noise. By considering a limit of a sequence of regularized stochastic gradient flows with respect to a regularization parameter $\varepsilon$ we obtain…
This paper proposes the first distributed algorithm that solves the weight-balancing problem using only finite rate and simplex communications among nodes, compliant with the directed nature of the graph edges. It is proved that the…
This doctoral thesis concerns novel distributed algorithms for weight balancing over directed (communication) topologies. A directed topology (digraph) with nonnegative (or positive) weights assigned on each edge is weight-balanced if, for…
Stochastic thermodynamics is the field of study relating fluctuations in stochastic systems to thermodynamic quantities. The total entropy production (EP), is central to the thermodynamic classification of systems. Non-equilibrium systems…
We consider spatial stochastic models, which can be applied e.g. to telecommunication networks with two hierarchy levels. In particular, we consider two Cox processes concentrated on the edge set of a random tessellation, where the points…
To obtain Russo-Seymour-Welsh estimates for the height function of the six-vertex model under sloped boundary conditions, which can be leveraged to demonstrate that the height function logarithmically delocalizes under a broader class of…
A noisy stabilized Kuramoto-Sivashinsky equation is analyzed by stochastic decomposition. For values of control parameter for which periodic stationary patterns exist, the dynamics can be decomposed into diffusive and transverse parts which…
The finite-size spectrum of the critical staggered six-vertex model with antidiagonal boundary conditions is studied. Similar to the case of periodic boundary conditions, we identify three different phases. In two of those, the underlying…
We study the gauge-fixing and symmetries (BRST-invariance and vector supersymmetry) of various six-dimensional topological models involving Abelian or non-Abelian 2-form potentials.
In this paper, we examine fluctuations of polynomial linear statistics for the Anderson model on $\mathbb{Z}^d$ for any potential with finite moments. We prove that if normalized by the square root of the size of the truncated operator,…
Scheduling control problems for a family of unitary networks under heavy traffic with general interarrival and service times, probabilistic routing and an infinite horizon discounted linear holding cost are studied. Diffusion control…
In the Telephone Broadcast problem we are given a graph $G=(V,E)$ with a designated source vertex $s\in V$. Our goal is to transmit a message, which is initially known only to $s$, to all vertices of the graph by using a process where in…
We establish the dual notions of scaling and saturation from geometric control theory in an infinite-dimensional setting. This generalization is applied to the low-mode control problem in a number of concrete nonlinear partial differential…
In the present paper, for a given (possibly, infinite) strongly connected digraph $\cal{D},$ we consider the class $\cal{S}_{<}({\cal D})$ of all truthly substochastic weightings of ${\cal D}$ (here, the word "truthly" means that there…