Homological Connectivity Of Random 2-Complexes

Let Δ_n−1 denote the (n − 1)-dimensional simplex. Let Y be a random 2-dimensional subcomplex of Δ_n−1 obtained by starting with the full 1-dimensional skeleton of Δ_n−1 and then adding each 2−simplex independently with probability p. Let denote the first homology group of Y with mod 2 coefficients. It is shown that for any function ω(n) that tends to infinity

Dynamical 2-Complexes

We introduce the class of dynamical 2-complexes. These complexes particularly allow the obtaining of a topological representation of any free group automorphism. A dynamical 2-complex can be roughly defined as a special polyhedron or standard 2-complex equipped with an orientation on its 1-cells satisfying two simple combinatorial properties. These orientations allow us to define non-singular semi-flows on the complex. The relationship with the free group automorphisms is done via a cohomological criterion to foliate the complex by compact graphs.     

The Picture Problem for 3-Complexes

This paper introduces the picture problem which is the analogue of the word problem, one dimension higher. Then the existence of a finite connected 3-complex with unsolvable picture problem is shown.AMS Subject Classification (1991): 20F10, 20E6.     

Topology and Nesting of the Zero Set Components of Monochromatic Random Waves

This paper is dedicated to the study of the topologies and nesting configurations of the components of the zero set of monochromatic random waves. We prove that the probability of observing any diffeomorphism type and any nesting arrangement among the zero set components is strictly positive for waves of large enough frequencies. Our results are a consequence of building Laplace eigenfunctions in euclidean space whose zero sets have a component with prescribed topological type or an arrangement of components with prescribed nesting configuration. © 2018 Wiley Periodicals, Inc.     

Queueing Networks of Random Link Topology: Stationary Dynamics of Maximal Throughput Schedules

In this paper, we study the stationary dynamics of a processing system comprised of several parallel queues and a single server of constant rate. The connectivity of the server to each queue is randomly modulated, taking values 1 (connected) or 0 (severed). At any given time, only the currently connected queues may receive service. A key issue is how to schedule the server on the connected queues in order to maximize the system throughput. We investigate two dynamic schedules, which are shown to stabilize the system under the highest possible traffic load, by scheduling the server on the connected queue of maximum backlog (workload or job number). They are analyzed under stationary ergodic traffic flows and connectivity modulation. The results also extend to the more general case of random server rate.We then investigate the dynamics of acyclic (feed-forward) queueing networks with nodes of the previous type. Their links (connectivities) are stochastically modulated, inducing fluctuating network topologies. We focus on the issue of network throughput and show that it is maximized by simple node server schedules. Rate ergodicity of the traffic flows traversing the network is established, allowing the computation of the maximal throughput.Queueing networks of random topology model several practical systems with unreliable service, including wireless communication networks with extraneous interference, flexible manufacturing systems with failing components, production management under random availability of resources etc.Research supported in part by the National Science Foundation.This revised version was published online in June 2005 with corrected coverdate     

弱拓扑下的非线性随机积分和微分方程组的解*

在本文中,我们首先对具有随机定义域的弱连续随机算子组证明了一个Darbo型随机不动点定理.利用这一定理,我们对Banach空间中关于弱拓扑的非线性随机Volterra积分方程组给出了随机解的存在性准则.作为应用,我们得到了非线性随机微分方程组的Canchy问题弱随机解的存在定理.也得到了这些随机方程组在Banach空间中关于弱拓扑的极值随机解的存在性和随机比较结果.我们的定理改进和推广了Szep,Mitchell－Smith,Cramer－Lakshmikantham,Lakshmikantham-Leela和丁的相应结果.     

Random orders of dimension 2

A relationship is established between (partially) ordered sets of dimension 2 chosen randomly on a labelled set, chosen randomly by isomorphism type, or generated by pairs of random linear orderings. As a consequence we are able to determine the limiting probability (in each of the above sample spaces) that a two-dimensional order is rigid, is uniquely realizable, or has uniquely orientable comparability graph; all these probabilities lie strictly between 0 and 1. Finally, we show that the number of 2-dimensional (partial) orderings of a labelled n-element set is .On leave from Emory University, Atlanta, GA. Research at Emory supported by ONR grant N00014 85-K-0769.     

2D Random Approximation Method

H. Robbins and S. Monro studied the stochastic approximations of one-dimensional system. In this paper, we present the stochastic approximation method of 2D system.     

Distance-2-Matchings of Random Graphs

In this paper we study the maximal size of a distance-2-matching in a random graph G _n;M , i.e., the probability space consisting of subgraphs of the complete graph over n vertices, K _n , having exactly M edges and uniform probability measure. A distance-2-matching in a graph Y, M ₂, is a set of Y-edges with the property that for any two elements every pair of their 4 incident vertices has Y-distance 2. Let M₂(Y) be the maximal size of a distance-2-matching in Y. Our main results are the derivation of a lower bound for M₂(Y) and a sharp concentration result for the random variable AMS Subject Classification: 05C80, 05C70.     

随机积分和微分方程在弱拓扑下解的存在性和比较结果*

在本文中,我们对非线性随机Volterra积分方程在Banach空间的弱拓扑下的随机解证明了几个存在定理.然后作为应用,我们得到了随机微分方程的弱随机解的存在定理.还得到了这些随机方程的极值随机解的存在性和随机比较定理.我们的定理改进和推广了[4,5,10,11,12]中的相应结果.     

Random perturbations of 2-dimensional hamiltonian flows

We consider the motion of a particle in a periodic two dimensional flow perturbed by small (molecular) diffusion. The flow is generated by a divergence free zero mean vector field. The long time behavior corresponds to the behavior of the homogenized process - that is diffusion process with the constant diffusion matrix (effective diffusivity). We obtain the asymptotics of the effective diffusivity when the molecular diffusion tends to zero.     

Singularities, Expanders and Topology of Maps. Part 2: from Combinatorics to Topology Via Algebraic Isoperimetry

We find lower bounds on the topology of the fibers F^-1(y) ì X{F^{-1}(y)\subset X} of continuous maps F : X → Y in terms of combinatorial invariants of certain polyhedra and/or of the cohomology algebras H*(X). Our exposition is conceptually related to but essentially independent of Part 1 of the paper.     

一般随机环境中二重随机游动的强大数定律

讨论了-般环境中二重随机游动的强泛函大数定律,给出了当过程几乎处处趋向于正无穷时的泛函大数定律成立的几个充分条件.     

Random random walks on ℤ2 d

Summary. We consider random walks on classes of graphs defined on the d-dimensional binary cube ℤ₂ ^d by placing edges on n randomly chosen parallel classes of vectors. The mixing time of a graph is the number of steps of a random walk before the walk forgets where it started, and reaches a random location. In this paper we resolve a question of Diaconis by finding exact expressions for this mixing time that hold for all n>d and almost all choices of vector classes. This result improves a number of previous bounds. Our method, which has application to similar problems on other Abelian groups, uses the concept of a universal hash function, from computer science.