Related papers: Noncrossing partition flow and random matrix model…
When two spherical particles submerged in a viscous fluid are subjected to an oscillatory flow, they align themselves perpendicular to the direction of the flow leaving a small gap between them. The formation of this compact structure is…
In 2021, motivated by graph limit theory Lov\'asz extended most of the theory of flows to a measure theoretic setting. Using this framework, the first author constructed $d$-regular treeings that are measurably bipartite, and have no…
We propose a novel model for generating graphs similar to a given example graph. Unlike standard approaches that compute features of graphs in Euclidean space, our approach obtains features on a surface of a hypersphere. We then utilize a…
The motion of weakly inertial Brownian particles, transported by steady two-dimensional fluid flows, is investigated by means of asymptotic methods. We focus on the phenomenon of noise-induced separatrix crossing, which can force particles…
Graph datasets are frequently constructed by a projection of a bipartite graph, where two nodes are connected in the projection if they share a common neighbor in the bipartite graph; for example, a coauthorship graph is a projection of an…
We investigate joint spectral characteristics of a family of matrices $\mathcal F $, associated with products in the semigroup generated by $\mathcal F$. In the literature, extremal measures such as the well-known joint spectral radius and…
An important challenge in the field of exponential random graphs (ERGs) is the fitting of non-trivial ERGs on large graphs. By utilizing fast matrix block-approximation techniques, we propose an approximative framework to such non-trivial…
We study the statistical properties of energy spectra of two-dimensional quasiperiodic tight-binding models. We demonstrate that the nearest-neighbor level spacing distributions of these non-random systems are well described by random…
Distribution regression, where the goal is to predict a scalar response from a distribution-valued predictor, arises naturally in settings where observations are grouped and outcomes depend on group-level characteristics rather than on…
The capacity (or maximum flow) of an unicast network is known to be equal to the minimum s-t cut capacity due to the max-flow min-cut theorem. If the topology of a network (or link capacities) is dynamically changing or unknown, it is not…
We consider the problem of determining the proportion of edges that are discovered in an Erdos-Renyi graph when one constructs all shortest paths from a given source node to all other nodes. This problem is equivalent to the one of…
We study the random loop model with crosses and bars on sparse random graphs. Our main objective is to prove the existence of macroscopic loops, in the sense that a loop visits a positive proportion of the vertices. We develop a…
Start with a graph with a subset of vertices called {\it the border}. A particle released from the origin performs a random walk on the graph until it comes to the immediate neighbourhood of the border, at which point it joins this subset…
Exchangeable random graphs serve as an important probabilistic framework for the statistical analysis of network data. In this work we develop an alternative parameterization for a large class of exchangeable random graphs, where the nodes…
A 2-D version of the asymmetric exclusion model for granular sheared flows is presented. The velocity profile exhibits two qualitatively different behaviors, dependent on control parameters. For low friction, the velocity profile follows an…
We consider the canonical ensemble of $N$-vertex Erd\H{o}s-R\'enyi (ER) random topological graphs with quenched vertex degree, and with fugacity $\mu$ for each closed triple of bonds. We claim complete defragmentation of large-$N$ graphs…
We study the dynamics of asymmetric, deformable particles in oscillatory, linear shear flow. By simulating the motion of a dumbbell, a ring polymer, and a capsule we show that cross-stream migration occurs for asymmetric elastic particles…
We characterize the generating function of bipartite planar maps counted according to the degree distribution of their black and white vertices. This result is applied to the solution of the hard particle and Ising models on random planar…
We study spectral behavior of sparsely connected random networks under the random matrix framework. Sub-networks without any connection among them form a network having perfect community structure. As connections among the sub-networks are…
We consider real eigen-functions of the Schr\"odinger operator in 2-d. The nodal lines of separable systems form a regular grid, and the number of nodal crossings equals the number of nodal domains. In contrast, for wave functions of non…