Related papers: A crossinggram for random fields on lattices
We develop a weighted local likelihood estimate for the parameters that govern the local spatial dependency of a locally stationary random field. The advantage of this local likelihood estimate is that it smoothly downweights the influence…
We simulate static memory materials on a two-dimensional lattice. The bulk properties of such materials depend on boundary conditions. Considerable information can be stored in various local patterns. We observe local probabilities…
A new transient effective theory of the relativistic Boltzmann equation is derived for locally momentum-anisotropic systems. In the expansion of the distribution function around a local "quasi-equilibrium" state a non-hydrodynamic dynamical…
We study the fluctuations of a random surface in a stochastic growth model on a system of interlacing particles placed on a two dimensional lattice. There are two different types of particles, one with a low jump rate and the other with a…
Motivated by the problem of testing for the existence of a signal of known parametric structure and unknown ``location'' (as explained below) against a noisy background, we obtain for the maximum of a centered, smooth random field an…
Ground motion scenarios exists for most of the seismically active areas around the globe. They essentially correspond to shaking level maps at given earthquake return times which are used as reference for the likely areas under threat from…
In many networks such as transportation or communication networks, distance is certainly a relevant parameter. In addition, real-world examples suggest that when long-range links are existing, they usually connect to hubs-the well connected…
Random walks represent an important tool for probing the structural and dynamical properties of networks and modeling transport and diffusion processes on networks. However, when individuals' movement becomes dictated by more complicated…
Irregularly sampling a spatially stationary random field does not yield a graph stationary signal in general. Based on this observation, we build a definition of graph stationarity based on intrinsic stationarity, a less restrictive…
Binomial random intersection graphs can be used as parsimonious statistical models of large and sparse networks, with one parameter for the average degree and another for transitivity, the tendency of neighbours of a node to be connected.…
We introduce the extremal range, a local statistic for studying the spatial extent of extreme events in random fields on $\mathbb{R}^d$. Conditioned on exceedance of a high threshold at a location $s$, the extremal range at $s$ is the…
This contribution reports on numerical simulations of 2D granular flows on erodible beds. The broad aim is to investigate whether simple flows of model granular matter exhibits spontaneous oscillatory motion in generic flow conditions, and…
We consider bond percolation on the square lattice with perfectly correlated random probabilities. According to scaling considerations, mapping to a random walk problem and the results of Monte Carlo simulations the critical behavior of the…
For spatiotemporal chaos described by partial differential equations, there are generally locations where the dynamical variable achieves its local extremum or where the time partial derivative of the variable vanishes instantaneously. To a…
Oscillatory dynamics are ubiquitous in biological networks. Possible sources of oscillations are well understood in low-dimensional systems, but have not been fully explored in high-dimensional networks. Here we study large networks…
Monte Carlo simulations and dynamical mean-field approximations are performed to study the phase transitions in rock-scissors-paper game on different host networks. These graphs are originated from lattices by introducing quenched and…
For more than a century lattice random walks have been employed ubiquitously, both as a theoretical laboratory to develop intuition about more complex stochastic processes and as a tool to interpret a vast array of empirical observations.…
In Puplinskaite and Surgailis (2014) we introduced the notion of scaling transition for stationary random fields $X$ on $\mathbb{Z}^2$ in terms of partial sums limits, or scaling limits, of $X$ over rectangles whose sides grow at possibly…
We study the maximal displacement of branching random walks in a class of time inhomogeneous environments. Specifically, binary branching random walks with Gaussian increments will be considered, where the variances of the increments change…
Latent space models are popular for analyzing dynamic network data. We propose a variational approach to estimate the model parameters as well as the latent positions of the nodes in the network. The variational approach is much faster than…