相关论文: The two-star model: exact solution in the sparse r…

The two-step contagion model is a simple toy model for understanding pandemic outbreaks that occur in the real world. The model takes into account that a susceptible person either gets immediately infected or weakened when getting into…

In complex systems, information propagation can be defined as diffused or delocalized, weakly localized, and strongly localized. This study investigates the application of graph neural network models to learn the behavior of a linear…

Competing inhomogeneous orders are a central feature of correlated electron materials including the high-temperature superconductors. The two- dimensional Hubbard model serves as the canonical microscopic physical model for such systems.…

We study both numerically and analytically what happens to a random graph of average connectivity "alpha" when its leaves and their neighbors are removed iteratively up to the point when no leaf remains. The remnant is made of isolated…

The stable matching problem is a prototype model in economics and social sciences where agents act selfishly to optimize their own satisfaction, subject to mutually conflicting constraints. A stable matching is a pairing of adjacent…

Although ubiquitous, interactions of groups of individuals (e.g., modern messaging applications, group meetings, or even a parliament discussion) are not yet thoroughly studied. Frequently, single-groups are modeled as critical-mass…

Recent studies have indicated that the coarse grained dynamics of a large class of traffic models and driven-diffusive systems may be described by urn models. We consider a class of one-dimensional urn models whereby particles hop from an…

The exponential random graph model (ERGM) is a central object in the study of clustering properties in social networks as well as canonical ensembles in statistical physics. Despite some breakthrough works in the mathematical understanding…

The lack of signed random networks in standard balance studies has prompted us to extend the Hamiltonian of the standard balance model. Random networks with tunable parameters are suitable for better understanding the behavior of standard…

We investigate graph problems in the following setting: we are given a graph $G$ and we are required to solve a problem on $G^2$. While we focus mostly on exploring this theme in the distributed CONGEST model, we show new results and…

The rheology of biological tissues is important for their function, and we would like to better understand how single cells control global tissue properties such as tissue fluidity. A confluent tissue can fluidize when cells diffuse by…

We study the dimer model on the square grid, with quenched random edge weights. Randomness is chosen to have a layered structure, similar to that of the celebrated McCoy-Wu disordered Ising model. Disorder has a highly non-trivial effect…

We introduce a growing network model---the copying model---in which a new node attaches to a randomly selected target node and, in addition, independently to each of the neighbors of the target with copying probability $p$. When…

The demand of two-dimensional source coding and constrained coding has been getting higher these days, but compared to the one-dimensional case, many problems have remained open as the analysis is cumbersome. A main reason for that would be…

In this article we propose a generalization of the 2-dimensional notions of convexity resp. being star-shaped to symplectic vector spaces. We call such curves symplectically convex resp. symplectically star-shaped. After presenting some…

We study condensation transitions in the steady state of a zero-range process with two species of particles. The steady state is exactly soluble -- it is given by a factorised form provided the dynamics satisfy certain constraints -- and we…

A fundamental procedure in the analysis of massive datasets is the construction of similarity graphs. Such graphs play a key role for many downstream tasks, including clustering, classification, graph learning, and nearest neighbor search.…

We show that for an infinitely many natural numbers $k$ there are $k$-uniform hypergraphs which admit a `rescaling phenomenon' as described in [9]. More precisely, let $\mathcal{A}(k,I, n)$ denote the class of $k$-graphs on $n$ vertices in…

The aim of the paper is to address the behavior in large population of diffusions interacting on a random, possibly diluted and inhomogeneous graph. This is the natural continuation of a previous work, where the homogeneous Erd\H os-R\'enyi…

We consider an explicitly solvable model (formulated in the Riemannian geometry terms) for a stationary wave process in a specific thin domain with the Dirichlet boundary conditions on the boundary of the domain. The transition from the…