Related papers: Random lattice triangulations: Structure and algor…
We present the results of a large-scale simulation of a Dynamically Triangulated Random Surface with extrinsic curvature embedded in three-dimensional flat space. We measure a variety of local observables and use a finite size scaling…
The number of triangles in a graph is useful to deduce a plethora of important features of the network that the graph is modeling. However, finding the exact value of this number is computationally expensive. Hence, a number of…
Random unimodular lattice triangulations have been recently used as an embedded random graph model, which exhibit a crossover behaviour between an ordered, large-world and a disordered, small-world behaviour. Using the ergodic Pachner flips…
We study a discrete-time Markov process on triangular arrays of matrices of size $d\geq 1$, driven by inverse Wishart random matrices. The components of the right edge evolve as multiplicative random walks on positive definite matrices with…
We study the Glauber dynamics on the set of tilings of a finite domain of the plane with lozenges of side 1/L. Under the invariant measure of the process (the uniform measure over all tilings), it is well known that the random height…
As a minimal fermionic model with kinetic frustration, we study a system of spinless fermions in the lowest band of a triangular lattice with long-range repulsion. We find that the combination of interactions and kinetic frustration leads…
We report on simulations of reversible random sequential adsorption of dimers on three different lattices: a one-dimensional lattice, a two-dimensional triangular lattice, and a two-dimensional triangular lattice with the nearest neighbors…
In spatial networks vertices are arranged in some space and edges may cross. When arranging vertices in a 1-dimensional lattice edges may cross when drawn above the vertex sequence as it happens in linguistic and biological networks. Here…
A generalization of the random geometric graph (RGG) model is proposed by considering a set of points uniformly and independently distributed on a rectangle of unit area instead of on a unit square [0,1]^2. The topological properties of the…
Given a planar triangulation, a 3-orientation is an orientation of the internal edges so all internal vertices have out-degree three. Each 3-orientation gives rise to a unique edge coloring known as a Schnyder wood that has proven powerful…
Three-dimensional shell-like structures can be obtained spontaneously at the microscale from the self-folding of 2D templates of rigid panels. At least for simple structures, the motion of each panel is consistent with a Brownian process…
We study random graphs with latent geometric structure, where the probability of each edge depends on the underlying random positions corresponding to the two endpoints. We focus on the setting where this conditional probability is a…
We construct random metric spaces by gluing together an infinite sequence of pointed metric spaces that we call blocks. At each step, we glue the next block to the structure constructed so far by randomly choosing a point on the structure…
Based on numerical simulation and local stability analysis we describe the structure of the phase space of the edge/triangle model of random graphs. We support simulation evidence with mathematical proof of continuity and discontinuity for…
Starting from a complete graph on $n$ vertices, repeatedly delete the edges of a uniformly chosen triangle. This stochastic process terminates once it arrives at a triangle-free graph, and the fundamental question is to estimate the final…
A model describing the three-dimensional folding of the triangular lattice on the face-centered cubic lattice is generalized allowing the presence of defects corresponding to cuts in the two-dimensional network. The model can be expressed…
Higher order scrambled digital nets are randomized quasi-Monte Carlo rules which have recently been introduced in [J. Dick, Ann. Statist., 39 (2011), 1372--1398] and shown to achieve the optimal rate of convergence of the root mean square…
Zigzags in graphs embedded in surfaces are cyclic sequences of edges whose any two consecutive edges are different, have a common vertex and belong to the same face. We investigate zigzags in randomly constructed combinatorial tetrahedral…
Non-spherical particles transported by an anisotropic turbulent flow preferentially align with the mean shear and intermittently tumble when the local strain fluctuates. Such an intricate behaviour is here studied for inertialess,…
We study percolation and the random cluster model on the triangular lattice with 3-body interactions. Starting with percolation, we generalize the star--triangle transformation: We introduce a new parameter (the 3-body term) and identify…