相关论文: Hack's law in a drainage network model: A Brownian…

In this work, water distribution systems are regarded as large sparse planar graphs with complex network characteristics and the relationship between important topological features of the network (i.e. structural robustness and loop…

We define a new state-space for the coalescing Brownian flow, also known as the Brownian web, on the circle. The elements of this space are families of order-preserving maps of the circle, depending continuously on two time parameters and…

In real world social networks, there are multiple cascades which are rarely independent. They usually compete or cooperate with each other. Motivated by the reinforcement theory in sociology we leverage the fact that adoption of a user to…

Liquid water, besides being fundamental for life on Earth, has long fascinated scientists due to several anomalies. Different hypotheses have been put forward to explain these peculiarities. The most accredited one foresees the presence in…

We propose a metric space of coalescing pairs of paths on which we are able to prove (more or less) directly convergence of objects such as the persistence probability in the (one dimensional, nearest neighbor, symmetric) voter model or the…

Water distribution networks (WDNs) expand their service areas over time. These growth dynamics are poorly understood. One facet of WDNs is that they have loops in general, and closing loops may be a functionally important process for…

There exist many criteria for the optimal design of water distribution networks. One of the most common criteria is to design the optimal cost water distribution network while satisfying the hydraulic design constraints. This study was…

Motivated by [G. Cannizzaro, M. Hairer, Comm. Pure Applied Math., '22], we provide a construction of the Brownian Web (see [T\'oth B., Werner W., Probab. Theory Related Fields, '98] and [L. R. G. Fontes, M. Isopi, C. M. Newman, and K.…

In this work we explore the one-dimensional extended Hubbard model as a fluid system modelling liquid phases of different densities. This model naturally displays two length scales of interaction, which are connected with waterlike…

We present a theoretical and experimental investigation of drainage in porous media. The study is limited to stabilized fluid fronts at moderate injection rates, but it takes into account capillary, viscous, and gravitational forces. In…

This paper explores the similarity of the streamwise velocity fluctuations in a channel. In the analysis, we employ a one-dimensional scalar variant of the proper orthogonal decomposition (POD). This approach naturally motivates the…

We develop a graph-based model of the hydrogen bond network in water, with a view towards quantitatively modeling the molecular-level correlational structure of the network. The networks are formed are studied by the constructing the model…

We consider a connection-level model of Internet congestion control, introduced by Massouli\'{e} and Roberts [Telecommunication Systems 15 (2000) 185--201], that represents the randomly varying number of flows present in a network. Here,…

In an earlier paper, a randomized load balancing model was studied in a heavy traffic asymptotic regime where the load balancing stream is thin compared to the total arrival stream. It was shown that the limit is given by a system of…

We study the relation between flow structure and fluid deformation in steady two-dimensional random flows. Beyond the linear (shear flow) and exponential (chaotic flow) elongation paradigms, we find a broad spectrum of stretching behaviors,…

We consider a multihop wireless system. There are multiple source-destination pairs. The data from a source may have to pass through multiple nodes. We obtain a channel scheduling policy which can guarantee end-to-end mean delay for the…

The lack of large-scale, continuously evolving empirical data usually limits the study of networks to the analysis of snapshots in time. This approach has been used for verification of network evolution mechanisms, such as preferential…

We propose a combinatorial and graph-theoretic theory of dropout by modeling training as a random walk over a high-dimensional graph of binary subnetworks. Each node represents a masked version of the network, and dropout induces stochastic…

In network flow problems, there is a well-known one-to-one relationship between extreme points of the feasibility region and trees in the associated undirected graph. The same is true for the dual differential problem. In this paper, we…

Capturing the dynamics of granular flows at intermediate length scales can often be difficult. We propose studying the dynamics of contact networks as a new tool to study fracture at intermediate scales. Using experimental three-dimensional…