10 citations · 52 across the 12 of their papers we have counts for
13 papers
Large-scale circulations in a shear-free convective turbulence: Mean-field simulations
G. Orian, A. Asulin, E. Tkachenko +3
It has been previously shown (Phys. Rev. E 66, 066305, 2002) that a non-rotating turbulent convection with nonuniform large-scale flows contributes to the turbulent heat flux. As a…
Experimental study of turbulent thermal diffusion of particles in inhomogeneous and anisotropic turbulence
E. Elmakies, O. Shildkrot, N. Kleeorin +3
We study experimentally turbulent thermal diffusion of small particles in inhomogeneous and anisotropic stably stratified turbulence produced by one oscillating grid in the air flo…
Experimental study of turbulent transport of nanoparticles in convective turbulence
I. Shimberg, O. Shriki, O. Shildkrot +3
We perform experimental study of turbulent transport of nanoparticles in convective turbulence with the Rayleigh number in the air flow. We measure temperature field in…
Mallows permutations as stable matchings
Omer Angel, Alexander E. Holroyd, Tom Hutchcroft +1
We show that the Mallows measure on permutations of arises as the law of the unique Gale-Shapley stable matching of the random bipartite graph conditioned to be perfec…
Finitely dependent cycle coloring
Alexander E. Holroyd, Tom Hutchcroft, Avi Levy
We construct stationary finitely dependent colorings of the cycle which are analogous to the colorings of the integers recently constructed by Holroyd and Liggett. These colorings…
Mallows Permutations and Finite Dependence
Alexander E. Holroyd, Tom Hutchcroft, Avi Levy
We use the Mallows permutation model to construct a new family of stationary finitely dependent proper colorings of the integers. We prove that these colorings can be expressed as…
Second order logic on random rooted trees
Alexander E. Holroyd, Avi Levy, Moumanti Podder +1
We address questions of logic and expressibility in the context of random rooted trees. Infiniteness of a rooted tree is not expressible as a first order sentence, but is expressib…
Deterministic Discrepancy Minimization via the Multiplicative Weight Update Method
Avi Levy, Harishchandra Ramadas, Thomas Rothvoss
A well-known theorem of Spencer shows that any set system with sets over elements admits a coloring of discrepancy . While the original proof was non-construct…
Ewens sampling and invariable generation
Gerandy Brito, Christopher Fowler, Matthew Junge +1
We study the number of random permutations needed to invariably generate the symmetric group, , when the distribution of cycle counts has the strong -logarithmic property.…
Algebraic Properties of Generalized Graph Laplacians: Resistor Networks, Critical Groups, and Homological Algebra
David Jekel, Avi Levy, Will Dana +2
We propose an algebraic framework for generalized graph Laplacians which unifies the study of resistor networks, the critical group, and the eigenvalues of the Laplacian and adjace…
Constructing Permutation Arrays from Groups
Sergey Bereg, Avi Levy, I. Hal Sudborough
Let M(n, d) be the maximum size of a permutation array on n symbols with pairwise Hamming distance at least d. We use various combinatorial, algebraic, and computational methods to…
Finitely Dependent Insertion Processes
Avi Levy
A -coloring of is a random process assigning one of colors to each integer in such a way that consecutive integers receive distinct colors. A process is -depe…
A 3-to-1 cactus graph: Details
Avi Levy
We briefly present a new construction of a 3-to-1 unrecoverable electrical network. This is a taste of a comprehensive forthcoming paper on unrecoverable electrical networks.